A fast metaheuristic for the travelling salesperson problem with hotel selection

e travelling salesperson problem with hotel selection (TSPHS) is a recently proposed variant of the travelling salesperson problem (TSP). Currently, the approach that finds the best solutions is a memetic algorithm. However, this approach is unsuitable for applications that require very short computation times. In this paper, a new set-partitioning formulation is presented along with a simple but powerful metaheuristic for the TSPHS. e algorithm is able to obtain very competitive results while remaining at least one order of magnitude faster than the best-performing method so far. e parameters of the metaheuristic were carefully tuned by means of an extensive statistical experiment.

• Type: Journal
• Year: 2015
• Where: 4OR
• Authors: Marco Castro, Kenneth Sörensen, Pieter Vansteenwegen, Peter Goos
• Keywords: 4OR 2015, Distributed And Parallel Computing