A memetic algorithm for the travelling salesperson problem with hotel selection

M Castro; K Sorensen; P Vansteenwegen; PP Goos

doi:10.1016/j.cor.2013.01.006

A memetic algorithm for the travelling salesperson problem with hotel selection

M Castro, K Sorensen, P Vansteenwegen, PP Goos

Econometrics

Research output: Contribution to journal › Article › Academic › peer-review

36 Citations (Scopus)

Abstract

this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.

Original language	English
Pages (from-to)	1716-1728
Number of pages	13
Journal	Computers and Operations Research
Volume	40
Issue number	7
DOIs	https://doi.org/10.1016/j.cor.2013.01.006
Publication status	Published - 2013

Research programs

EUR ESE 31

Access to Document

10.1016/j.cor.2013.01.006

http://hdl.handle.net/1765/39670

Cite this

@article{2c88f6a4de4543e5b3c815a7d367d3c1,

title = "A memetic algorithm for the travelling salesperson problem with hotel selection",

abstract = "this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.",

author = "M Castro and K Sorensen and P Vansteenwegen and PP Goos",

year = "2013",

doi = "10.1016/j.cor.2013.01.006",

language = "English",

volume = "40",

pages = "1716--1728",

journal = "Computers and Operations Research",

issn = "0305-0548",

publisher = "Elsevier Ltd.",

number = "7",

}

TY - JOUR

T1 - A memetic algorithm for the travelling salesperson problem with hotel selection

AU - Castro, M

AU - Sorensen, K

AU - Vansteenwegen, P

AU - Goos, PP

PY - 2013

Y1 - 2013

N2 - this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.

AB - this paper, a metaheuristic solution procedure for the travelling salesperson problem with hotel selection (TSPHS) is presented. The metaheuristic consists of a memetic algorithm with an embedded tabu search, using a combination of well-known and problem-specific neighbourhoods. This solution procedure clearly outperforms the only other existing metaheuristic in the literature. For smaller instances, whose optimal solution is known, it is able to consistently find the optimal solution. For the other instances, it obtains several new best known solutions.

U2 - 10.1016/j.cor.2013.01.006

DO - 10.1016/j.cor.2013.01.006

M3 - Article

SN - 0305-0548

VL - 40

SP - 1716

EP - 1728

JO - Computers and Operations Research

JF - Computers and Operations Research

IS - 7

ER -

A memetic algorithm for the travelling salesperson problem with hotel selection

Abstract

Research programs

Access to Document

Fingerprint

Cite this