|
Title
|
|
|
|
A memetic algorithm for the travelling salesperson problem with hotel selection
|
|
|
Author
|
|
|
|
|
|
|
Abstract
|
|
|
|
| In 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. (C) 2013 Elsevier Ltd. All rights reserved. |
|
|
|
Language
|
|
|
|
English
|
|
|
Source (journal)
|
|
|
|
Computers & operations research. - New York, N.Y.
|
|
|
Publication
|
|
|
|
New York, N.Y.
:
2013
|
|
|
ISSN
|
|
|
|
0305-0548
|
|
|
DOI
|
|
|
|
10.1016/J.COR.2013.01.006
|
|
|
Volume/pages
|
|
|
|
40
:7
(2013)
, p. 1716-1728
|
|
|
ISI
|
|
|
|
000318131900007
|
|
|
Full text (Publisher's DOI)
|
|
|
|
|
|
|
Full text (publisher's version - intranet only)
|
|
|
|
|
|