Publication
Title
The travelling salesperson problem with hotel selection
Author
Abstract
In this paper, we present the travelling salesperson problem with hotel selection (TSPHS), an extension of the TSP with a number of interesting applications. We present a mathematical formulation, explain the difference with related optimization problems and indicate what makes this problem inherently more difficult. We develop a simple but efficient heuristic that uses two constructive initialization procedures and an improvement procedure consisting of several neighbourhood search operators designed specifically for this problem, as well as some typical neighbourhoods from the literature. We generate several benchmark instances of varying sizes and compare the performance of our heuristic with CPLEX (10.0). We also generate some problems with known optimal solutions and use these to further demonstrate that our heuristic achieves good results in very limited computation times. Journal of the Operational Research Society (2012) 63, 207-217. doi: 10.1057/jors.2011.18 Published online 14 September 2011
Language
English
Source (journal)
Journal of the Operational Research Society. - Basingstoke
Publication
Basingstoke : 2012
ISSN
0160-5682
Volume/pages
63:2(2012), p. 207-217
ISI
000299213400007
Full text (Publishers DOI)
Full text (publishers version - intranet only)
UAntwerpen
Faculty/Department
Research group
Publication type
Subject
Affiliation
Publications with a UAntwerp address
External links
Web of Science
Record
Identification
Creation 05.03.2012
Last edited 11.04.2017
To cite this reference