Nothing Special   »   [go: up one dir, main page]
Skip to main content
Springer Nature Link
Log in

Impact of Iterated Local Search Heuristic Hybridization on Vehicle Routing Problems: Application to the Capacitated Profitable Tour Problem

  • Conference paper
  • First Online:
Operations Research and Enterprise Systems (ICORES 2018)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 966))

Included in the following conference series:

  • 292 Accesses

Abstract

The present paper highlights the impact of heuristic hybridization on Vehicle Routing Problems (VRPs). More specifically, we focus on the hybridization of the Iterated Local Search heuristic (ILS). We propose different hybridization levels for ILS with two other heuristics, namely a Variable Neighborhood Descent with Random neighborhood ordering (RVND) and a Large Neighborhood Search heuristic (LNS). To evaluate the proposed approaches, we test them on a variant of VRPs called the Capacitated Profitable Tour Problem (CPTP). In a CPTP, the visit of all customers is no longer required and the visit of each customer generates a specific profit. The available fleet of vehicle is limited and capacitated. The aim of the CPTP is to choose which set of customers to visit and in which order to maximize the difference between collected profits and routing costs. Our experiments show that the more ILS is hybridized the better are the results. To bring out the effectiveness of the proposed hybrid approach combining ILS, RVND and LNS, a comparison is made between that proposed approach and three local search heuristics from the literature of the CPTP. The obtained results are competitive.

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

Access this chapter

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Institutional subscriptions

Similar content being viewed by others

References

  1. Archetti, C., Feillet, D., Hertz, A., Speranza, M.G.: The capacitated team orienteering and profitable tour problems. J. Oper. Res. Soc. 60, 831–842 (2009)

    Article  Google Scholar 

  2. Lourenço, H.R., Martin, O.C., Stützle, T.: Iterated local search. In: Glover, F., Kochenberger, G.A. (eds) Handbook of Metaheuristics, vol. 57. Springer, Boston (2003). https://doi.org/10.1007/0-306-48056-5_11

  3. Martins, A.X., Duhamel, C., Mahey, P., Saldanha, R.R., de Souza, M.C.: Variable neighborhood descent with iterated local search for routing and wavelength assignment. Comput. Oper. Res. 39, 2133–2141 (2012)

    Article  MathSciNet  Google Scholar 

  4. 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, 8947–8955 (2015)

    Article  Google Scholar 

  5. Chen, P., Huang, H.k., Dong, X.Y.: Iterated variable neighborhood descent algorithm for the capacitated vehicle routing problem. Expert Syst. Appl. 37, 1620–1627 (2010)

    Google Scholar 

  6. Subramanian, A., Drummond, L.M.D.A., Bentes, C., Ochi, L.S., Farias, R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37, 1899–1911 (2010)

    Article  Google Scholar 

  7. Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40, 2519–2531 (2013)

    Article  Google Scholar 

  8. Assis, L.P., Maravilha, A.L., Vivas, A., Campelo, F., Ramírez, J.A.: Multiobjective vehicle routing problem with fixed delivery and optional collections. Optimization Letters 7, 1419–1431 (2013)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  10. Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.J.: A hybrid heuristic approach for the multi-commodity pickup-and-delivery traveling salesman problem. Eur. J. Oper. Res. 251, 44–52 (2016)

    Article  MathSciNet  Google Scholar 

  11. Todosijević, R., Hanafi, S., Urošević, D., Jarboui, B., Gendron, B.: A general variable neighborhood search for the swap-body vehicle routing problem. Comput. Oper. Res. 78, 468–479 (2017)

    Article  MathSciNet  Google Scholar 

  12. Erdoğan, G., Cordeau, J.F., Laporte, G.: The pickup and delivery traveling salesman problem with first-in-first-out loading. Comput. Oper. Res. 36, 1800–1808 (2009)

    Article  MathSciNet  Google Scholar 

  13. Hernández-Pérez, H., Rodríguez-Martín, I., Salazar-González, J.J.: A hybrid grasp/vnd heuristic for the one-commodity pickup-and-delivery traveling salesman problem. Comput. Oper. Res. 36, 1639–1645 (2009)

    Article  Google Scholar 

  14. Rodríguez-Martín, I., Salazar-González, J.J.: A hybrid heuristic approach for the multi-commodity one-to-one pickup-and-delivery traveling salesman problem. J. Heuristics 18, 849–867 (2012)

    Article  Google Scholar 

  15. Gansterer, M., Küçüktepe, M., Hartl, R.F.: The multi-vehicle profitable pickup and delivery problem. OR Spectrum 39, 303–319 (2017)

    Article  MathSciNet  Google Scholar 

  16. Sifaleras, A., Konstantaras, I.: Variable neighborhood descent heuristic for solving reverse logistics multi-item dynamic lot-sizing problems. Comput. Oper. Res. 78, 385–392 (2017)

    Article  MathSciNet  Google Scholar 

  17. Samà, M., Corman, F., Pacciarelli, D., et al.: A variable neighbourhood search for fast train scheduling and routing during disturbed railway traffic situations. Comput. Oper. Res. 78, 480–499 (2017)

    Article  MathSciNet  Google Scholar 

  18. Hassannayebi, E., Zegordi, S.H.: Variable and adaptive neighbourhood search algorithms for rail rapid transit timetabling problem. Comput. Oper. Res. 78, 439–453 (2017)

    Article  MathSciNet  Google Scholar 

  19. Sassi, O., Cherif-Khettaf, W.R., Oulamara, A.: Multi-start iterated local search for the mixed fleet vehicle routing problem with heterogenous electric vehicles. In: Ochoa, G., Chicano, F. (eds.) EvoCOP 2015. LNCS, vol. 9026, pp. 138–149. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-16468-7_12

    Chapter  Google Scholar 

  20. Cuervo, D.P., Goos, P., Sörensen, K., Arráiz, E.: An iterated local search algorithm for the vehicle routing problem with backhauls. Eur. J. Oper. Res. 237, 454–464 (2014)

    Article  Google Scholar 

  21. Silva, M.M., Subramanian, A., Ochi, L.S.: An iterated local search heuristic for the split delivery vehicle routing problem. Comput. Oper. Res. 53, 234–249 (2015)

    Article  MathSciNet  Google Scholar 

  22. Morais, V.W., Mateus, G.R., Noronha, T.F.: Iterated local search heuristics for the vehicle routing problem with cross-docking. Expert Syst. Appl. 41, 7495–7506 (2014)

    Article  Google Scholar 

  23. Li, J., Pardalos, P.M., Sun, H., Pei, J., Zhang, Y.: Iterated local search embedded adaptive neighborhood selection approach for the multi-depot vehicle routing problem with simultaneous deliveries and pickups. Expert Syst. Appl. 42, 3551–3561 (2015)

    Article  Google Scholar 

  24. François, V., Arda, Y., Crama, Y., Laporte, G.: Large neighborhood search for multi-trip vehicle routing. Eur. J. Oper. Res. 255, 422–441 (2016)

    Article  MathSciNet  Google Scholar 

  25. Grangier, P., Gendreau, M., Lehuédé, F., Rousseau, L.M.: A matheuristic based on large neighborhood search for the vehicle routing problem with cross-docking. Comput. Oper. Res. 84, 116–126 (2017)

    Article  MathSciNet  Google Scholar 

  26. Akpinar, S.: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst. Appl. 61, 28–38 (2016)

    Article  Google Scholar 

  27. Dominguez, O., Guimarans, D., Juan, A.A., de la Nuez, I.: A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls. Eur. J. Oper. Res. 255, 442–462 (2016)

    Article  MathSciNet  Google Scholar 

  28. Canca, D., De-Los-Santos, A., Laporte, G., Mesa, J.A.: An adaptive neighborhood search metaheuristic for the integrated railway rapid transit network design and line planning problem. Comput. Oper. Res. 78, 1–14 (2017)

    Article  MathSciNet  Google Scholar 

  29. Chentli, H., Ouafi, R., Cherif-Khettaf, W.R.: Behaviour of a hybrid ils heuristic on the capacitated profitable tour problem. In: Proceedings of the 7th International Conference on Operations Research and Enterprise Systems: ICORES, INSTICC, SciTePress, vol. 1, pp. 115–123 (2018)

    Google Scholar 

  30. Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)

    Article  MathSciNet  Google Scholar 

  31. Talbi, E.G.: Metaheuristics: from design to implementation (2009)

    Google Scholar 

  32. Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)

    Article  MathSciNet  Google Scholar 

  33. Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315–338. Wiley, Chichester (1979)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Operations Research, USTHB, P.O. Box 32 El Alia, 16111, Bab Ezzouar, Algiers, Algeria

    Hayet Chentli & Rachid Ouafi

  2. LORIA, UMR 7503, Lorraine University, Mines Nancy, Nancy, France

    Wahiba Ramdane Cherif-Khettaf

Authors
  1. Hayet Chentli
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rachid Ouafi
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wahiba Ramdane Cherif-Khettaf
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hayet Chentli .

Editor information

Editors and Affiliations

  1. INFORMS, Catonsville, MD, USA

    Greg H. Parlier

  2. UC3M-BS Institute of Financial Big Data, Universidad Carlos III de Madrid, Madrid, Spain

    Federico Liberatore

  3. Royal Melbourne Institute of Technology, Melbourne, VIC, Australia

    Marc Demange

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

Chentli, H., Ouafi, R., Cherif-Khettaf, W.R. (2019). Impact of Iterated Local Search Heuristic Hybridization on Vehicle Routing Problems: Application to the Capacitated Profitable Tour Problem. In: Parlier, G., Liberatore, F., Demange, M. (eds) Operations Research and Enterprise Systems. ICORES 2018. Communications in Computer and Information Science, vol 966. Springer, Cham. https://doi.org/10.1007/978-3-030-16035-7_5

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-16035-7_5

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-16034-0

  • Online ISBN: 978-3-030-16035-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation