Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Hybrid Metaheuristics

HM 2019: Hybrid Metaheuristics pp 31–45Cite as

An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 11299))

Abstract

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.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Applegate, D.L., Bixby, R.E., Chvatal, V., Cook, W.J.: The Traveling Salesman Problem: A Computational Study. Princeton University Press, Princeton (2006)

    MATH  Google Scholar 

  2. Baltz, A., Ouali, M.E., Jäger, G., Sauerland, V., Srivastav, A.: Exact and heuristic algorithms for the travelling salesman problem with multiple time windows and hotel selection. J. Oper. Res. Soc. 66, 615–626 (2014)

    Article  Google Scholar 

  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 

  6. Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P.: A fast metaheuristic for the travelling salesperson problem with hotel selection. 4OR, pp. 1–20 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  7. Castro, M., Sörensen, K., Vansteenwegen, P., Goos, P.: A memetic algorithm for the travelling salesperson problem with hotel selection. Comput. Oper. Res. 40(7), 1716–1728 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  8. Coelho, V.N., Grasas, A., Ramalhinho, H., Coelho, I.M., Souza, M.J.F., Cruz, R.C.: An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints. Eur. J. Oper. Res. 250(2), 367–376 (2016)

    Article  MathSciNet  MATH  Google Scholar 

  9. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6(6), 791–812 (1958)

    Article  MathSciNet  Google Scholar 

  10. Dijkstra, E.W.: A note on two problems in connexion with graphs. Numerische mathematik 1(1), 269–271 (1959)

    Article  MathSciNet  MATH  Google Scholar 

  11. Divsalar, A., Vansteenwegen, P., Cattrysse, D.: A variable neighborhood search method for the orienteering problem with hotel selection. Int. J. Prod. Econ. 145(1), 150–160 (2013)

    Article  Google Scholar 

  12. Hansen, P., Mladenović, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130(3), 449–467 (2001)

    Article  MathSciNet  MATH  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 

  14. Kim, B.I., Kim, S., Sahoo, S.: Waste collection vehicle routing problem with time windows. Comput. Oper. Res. 33(12), 3624–3642 (2006)

    Article  MATH  Google Scholar 

  15. Laporte, G., Gendreau, M., Potvin, J.Y.: Semet: classical and modern heuristics for the vehicle routing problem. Int. Trans. Oper. Res. 7(4–5), 285–300 (2000)

    Article  MathSciNet  Google Scholar 

  16. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21(2), 498–516 (1973)

    Article  MathSciNet  MATH  Google Scholar 

  17. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search: framework and applications. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics. ISOR, vol. 146, pp. 363–397. Springer, Boston (2010). https://doi.org/10.1007/978-1-4419-1665-5_12

    Chapter  Google Scholar 

  18. Markov, I., Varone, S., Bierlaire, M.: Integrating a heterogeneous fixed fleet and a flexible assignment of destination depots in the waste collection VRP with intermediate facilities. Transp. Res. Part B: Methodol. 84, 256–273 (2016)

    Article  Google Scholar 

  19. Martins, I.C., Pinheiro, R.G., Protti, F., Ochi, L.S.: A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem. Expert Syst. Appl. 42(22), 8947–8955 (2015)

    Article  Google Scholar 

  20. Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8(1), 3–30 (1998)

    Article  MATH  Google Scholar 

  21. Mladenović, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097–1100 (1997)

    Article  MathSciNet  MATH  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 

  23. Penna, P.H.V., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the heterogeneous fleet vehicle routing problem. J. Heuristics 19(2), 201–232 (2013)

    Article  Google Scholar 

  24. Polacek, M., Doerner, K.F., Hartl, R.F., Maniezzo, V.: A variable neighborhood search for the capacitated arc routing problem with intermediate facilities. J. Heuristics 14(5), 405–423 (2008)

    Article  MATH  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 

  26. Subramanian, A., Battarra, M.: An iterated local search algorithm for the travelling salesman problem with pickups and deliveries. J. Oper. Res. Soc. 64(3), 402–409 (2013)

    Article  Google Scholar 

  27. Tarantilis, C.D., Zachariadis, E.E., Kiranoudis, C.T.: A hybrid guided local search for the vehicle-routing problem with intermediate replenishment facilities. INFORMS J. Comput. 20(1), 154–168 (2008)

    Article  MathSciNet  MATH  Google Scholar 

  28. Vansteenwegen, P., Souffriau, W., Sorensen, K.: The travelling salesperson problem with hotel selection. J. Oper. Res. Soc. 63(2), 207–217 (2011)

    Article  Google Scholar 

Download references

Acknowledgments

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.

Author information

Authors and Affiliations

  1. Federal Institute of São Paulo, Campos do Jordão-SP, 12460-000, Brazil

    Marques Moreira Sousa

  2. Computing Institute, Fluminense Federal University, Niterói-RJ, 24210-346, Brazil

    Marques Moreira Sousa, Luiz Satoru Ochi & Simone de Lima Martins

Authors
  1. Marques Moreira Sousa
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luiz Satoru Ochi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Simone de Lima Martins
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Marques Moreira Sousa .

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Barcelona, Spain

    Maria J. Blesa Aguilera

  2. Spanish National Research Council, Bellaterra, Spain

    Christian Blum

  3. Universidade Federal de Ouro Preto, Ouro Preto, Brazil

    Haroldo Gambini Santos

  4. University of Concepción, Concepción, Chile

    Pedro Pinacho-Davidson

  5. Universidad de Concepción, Concepción, Chile

    Julio Godoy del Campo

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Moreira Sousa, M., Satoru Ochi, L., de Lima Martins, S. (2019). An Efficient Heuristic to the Traveling Salesperson Problem with Hotel Selection. In: Blesa Aguilera, M., Blum, C., Gambini Santos, H., Pinacho-Davidson, P., Godoy del Campo, J. (eds) Hybrid Metaheuristics. HM 2019. Lecture Notes in Computer Science(), vol 11299. Springer, Cham. https://doi.org/10.1007/978-3-030-05983-5_3

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-05983-5_3

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-05982-8

  • Online ISBN: 978-3-030-05983-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation