The travelling salesperson problem with hotel selection
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.
Keywordstravelling salesperson problem hotel selection heuristic
- Applegate DL, Bixby RE, Chvatal V and Cook WJ (2007). The Traveling Salesman Problem: A Computational Study. Princeton Series in Applied Mathematics. Princeton University Press: Princeton, NJ, USA.Google Scholar
- Or I. (1976). Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. PhD thesis, Northwestern University, Evanston, IL.Google Scholar
- Savelsbergh M (1992). The vehicle routing problem with time windows: Minimizing route duration. J Comput 4: 146–154.Google Scholar
- Toth P and Vigo D (2002). The vehicle routing problem. SIAM monographs on discrete mathematics and applications, SIAM.Google Scholar
- Vansteenwegen P, Souffriau W and Sörensen K (2010). Solving the mobile mapping van problem: A hybrid metaheuristic for capacitated arc routing with soft time windows. Comput Opns Res (in press).Google Scholar