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.

Hotel selection, Memetic algorithm, TSP,
Computers & Operations Research
Erasmus Research Institute of Management

Castro Cabezas, M, Sörensen, K, van Steenwegen, P, & Goos, P.P. (2013). A memetic algorithm for the travelling salesperson problem with hotel selection. Computers & Operations Research, 40(7), 1716–1728. doi:10.1016/j.cor.2013.01.006