4OR

, Volume 13, Issue 1, pp 15–34 | Cite as

A fast metaheuristic for the travelling salesperson problem with hotel selection

  • Marco Castro
  • Kenneth Sörensen
  • Pieter Vansteenwegen
  • Peter Goos
Research paper

Abstract

The travelling salesperson problem with hotel selection (TSPHS) is a recently proposed variant of the travelling salesperson problem. 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. The algorithm is able to obtain very competitive results while remaining at least one order of magnitude faster than the best-performing method so far. The parameters of the metaheuristic were carefully tuned by means of an extensive statistical experiment.

Keywords

TSP Hotel Selection Metaheuristics Combinatorial Optimisation 

Mathematics Subject Classification

90B06 90C27 90C59 

Notes

Acknowledgments

The first, second and fourth author gratefully thank the Fonds voor Wetenschappelijke Onderzoek—Vlaanderen (FWO) as well as the COMEX Project (Combinatorial optimization: metaheuristics and exact methods) for financial support.

References

  1. Angelelli E, Speranza MG (2002) The periodic vehicle routing problem with intermediate facilities. Eur J Oper Res 137(2):233–247CrossRefGoogle Scholar
  2. Applegate D, Bixby R, Chvátal V, Cook W (2007) The traveling salesman problem: a computational study. Princeton University Press, PrincetonGoogle Scholar
  3. Applegate D, Bixby R, Chvátal V, Cook W (2006) Concorde TSP solver. http://www.tsp.gatech.edu/concorde
  4. Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209–219CrossRefGoogle Scholar
  5. Berretta R, Cotta C, Moscato P (2011) Memetic algorithms. In: Cochran JJ, Cox LA, Keskinocak P, Kharoufeh JP, Smith JC (eds) Wiley encyclopedia of operations research and management science. Wiley, LondonGoogle Scholar
  6. Castro M, Sörensen K, Vansteenwegen P, Goos P (2013) A memetic algorithm for the travelling salesperson problem with hotel selection. Comput Oper Res 40(7):1716–1728CrossRefGoogle Scholar
  7. Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30(2):105–119CrossRefGoogle Scholar
  8. Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176(2):756–773CrossRefGoogle Scholar
  9. Croes GA (1958) A method for solving traveling-salesman problems. Oper Res 6(6):791–812CrossRefGoogle Scholar
  10. Desaulniers G, Desrosiers J, Solomon M (2005) Column generation. Springer, BerlinCrossRefGoogle Scholar
  11. Dijkstra EW (1959) A note on two problems in connexion with graphs. Numer Math 1(1):269–271CrossRefGoogle Scholar
  12. Ghiani G, Improta G, Laporte G (2001) The capacitated arc routing problem with intermediate facilities. Networks 37(3):134–143CrossRefGoogle Scholar
  13. Hansen P, Mladenović N, Brimberg J, Moreno-Pérez JA (2008) Variable neighbourhood search: methods and applications. 4OR 6(4):319–360Google Scholar
  14. Hansen P, Mladenović N, Brimberg J, Moreno-Pérez JA (2010) Variable neighborhood search. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. Springer, Berlin, pp 61–86Google Scholar
  15. Kim BI, Kim S, Sahoo S (2006) Waste collection vehicle routing problem with time windows. Comput Oper Res 33(12):3624–3642CrossRefGoogle Scholar
  16. Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7(4–5):285–300CrossRefGoogle Scholar
  17. Letchford AN, Lodi A (2007) The traveling salesman problem: a book review. 4OR 5(4):315–317Google Scholar
  18. Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498–516CrossRefGoogle Scholar
  19. Lourenço HR, Martin OC, Stützle T (2010) Iterated local search: framework and applications. In: Gendreau M, Potvin J-Y (eds) Handbook of metaheuristics. Springer, Berlin, pp 363–397Google Scholar
  20. Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. thesis, Northwestern UniversityGoogle Scholar
  21. Polacek M, Hartl RF, Doerner K, Reimann M (2004) A variable neighborhood search for the multi depot vehicle routing problem with time windows. J Heuristics 10(6):613–627CrossRefGoogle Scholar
  22. Polacek M, Doerner KF, Hartl RF, Maniezzo V (2008) A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J Heuristics 14(5):405–423CrossRefGoogle Scholar
  23. Prins C (2004) A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31(12):1985–2002CrossRefGoogle Scholar
  24. Prins C, Lacomme P, Prodhon C (2014) Order-first split-second methods for vehicle routing problems: a review. Transp Res Part C Emerg Technol 40:179–200CrossRefGoogle Scholar
  25. Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254–265CrossRefGoogle Scholar
  26. Tarantilis CD, Zachariadis EE, Kiranoudis CT (2008) A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J Comput 20(1):154–168CrossRefGoogle Scholar
  27. Toth P, Vigo D (eds) (2002) The vehicle routing problem, volume 9 of discrete mathematics and applications. Society for Industrial and Applied Mathematics, PhiladelphiaGoogle Scholar
  28. Vansteenwegen P, Souffriau W, Sörensen K (2011) The travelling salesperson problem with hotel selection. J Oper Res Soc 63(2):207–217CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Marco Castro
    • 1
  • Kenneth Sörensen
    • 1
  • Pieter Vansteenwegen
    • 2
  • Peter Goos
    • 1
    • 2
  1. 1.Universiteit AntwerpenAntwerpenBelgium
  2. 2.KU LeuvenLeuvenBelgium

Personalised recommendations