An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection
Traveling salesperson problem with hotel selection consists of determining a tour for the salesperson who needs to visit a predefined number of customers at different locations by taking into consideration that each working day is limited by time. If the time limit is accomplished, the salesperson must select a hotel from the set of available ones to spend the night. The aim is to minimize the number of necessary days to visit all customers spending the shortest possible travel time. We present an adaptive efficient heuristic based on the Iterated Local Search metaheuristic to solve available instances. The proposed heuristic is able to find good solutions for almost all instances and, in some cases, it is able to improve the quality of the best results found in literature, decreasing the number of trips necessary or time to travel along a tour. Moreover, the heuristic is fast enough to be applied to real problems that require fast responses.
KeywordsOptimization Metaheuristic Iterated Local Search Traveling Salesperson Problem with Hotel Selection
This study was financed in part by the Coordenação de Aperfeiçoamento de Pessoal de Nível Superior - Brasil (CAPES) - Finance Code 001. The authors gratefully acknowledge the financial support from Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq), Federal Institute of São Paulo Campus Campos do Jordão (IFSP) and Computational Intelligence laboratory at Fluminense Federal University (LABIC) for supporting the development of this work.
- 3.Berretta, R., Cotta, C., Moscato, P.: Memetic Algorithm. Wiley, Hoboken (2011)Google Scholar
- 4.Castro, M., Sorensen, K., Goos, P., Vansteenwegen, P.: The multiple travelling salesperson problem with hotel selection. Technical report, University of Antwerp, Faculty of Applied Economics, BE (2014)Google Scholar
- 5.Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P.: A simple GRASP+VND for the travelling salesperson problem with hotel selection. Technical report, University of Antwerp, Faculty of Applied Economics, BE (2012)Google Scholar
- 13.Hansen, P., Mladenović, N., Brimberg, J., Pérez, J.A.M.: Handbook of Metaheuristics: Variable Neighbourhood Search. Springer, Heidelberg (2010)Google Scholar
- 22.Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern University, Evanston, Illinois (1976)Google Scholar
- 25.Sousa, M.M., Gonçalves, L.B.: Comparação de abordagens heurísticas baseadas em algoritmo memético para o problema do caixeiro viajante com seleção de hotéis. In: Proc. XLVI Simpósio Brasileiro de Pesquisa Operacional, pp. 1543–1554. Salvador, Brasil (2014)Google Scholar