A memetic algorithm for the travelling salesperson problem with hotel selection

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 rest of the instances, it obtains a number of new best known solutions.publisher: Elsevier articletitle: A memetic algorithm for the travelling salesperson problem with hotel selection journaltitle: Computers & Operations Research articlelink: http://dx.doi.org/10.1016/j.cor.2013.01.006 content_type: article copyright: Copyright © 2013 Elsevier Ltd. All rights reserved.status: publishe