Advertisement

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

  • Hayet ChentliEmail author
  • Rachid Ouafi
  • Wahiba Ramdane Cherif-Khettaf
Conference paper
Part of the Communications in Computer and Information Science book series (CCIS, volume 966)

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.

Keywords

Heuristics Hybridization Vehicle Routing Problem Iterative local search 

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 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)MathSciNetCrossRefGoogle Scholar
  4. 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)CrossRefGoogle Scholar
  5. 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. 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)CrossRefGoogle Scholar
  7. 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)CrossRefGoogle Scholar
  8. 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)MathSciNetCrossRefGoogle Scholar
  9. 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)CrossRefGoogle Scholar
  10. 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)MathSciNetCrossRefGoogle Scholar
  11. 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)MathSciNetCrossRefGoogle Scholar
  12. 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)MathSciNetCrossRefGoogle Scholar
  13. 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)CrossRefGoogle Scholar
  14. 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)CrossRefGoogle Scholar
  15. 15.
    Gansterer, M., Küçüktepe, M., Hartl, R.F.: The multi-vehicle profitable pickup and delivery problem. OR Spectrum 39, 303–319 (2017)MathSciNetCrossRefGoogle Scholar
  16. 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)MathSciNetCrossRefGoogle Scholar
  17. 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)MathSciNetCrossRefGoogle Scholar
  18. 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)MathSciNetCrossRefGoogle Scholar
  19. 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_12CrossRefGoogle Scholar
  20. 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)CrossRefGoogle Scholar
  21. 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)MathSciNetCrossRefGoogle Scholar
  22. 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)CrossRefGoogle Scholar
  23. 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)CrossRefGoogle Scholar
  24. 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)MathSciNetCrossRefGoogle Scholar
  25. 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)MathSciNetCrossRefGoogle Scholar
  26. 26.
    Akpinar, S.: Hybrid large neighbourhood search algorithm for capacitated vehicle routing problem. Expert Syst. Appl. 61, 28–38 (2016)CrossRefGoogle Scholar
  27. 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)MathSciNetCrossRefGoogle Scholar
  28. 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)MathSciNetCrossRefGoogle Scholar
  29. 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. 30.
    Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35, 254–265 (1987)MathSciNetCrossRefGoogle Scholar
  31. 31.
    Talbi, E.G.: Metaheuristics: from design to implementation (2009)Google Scholar
  32. 32.
    Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403–2435 (2007)MathSciNetCrossRefGoogle Scholar
  33. 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)zbMATHGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2019

Authors and Affiliations

  • Hayet Chentli
    • 1
    Email author
  • Rachid Ouafi
    • 1
  • Wahiba Ramdane Cherif-Khettaf
    • 2
  1. 1.Department of Operations ResearchUSTHBBab EzzouarAlgeria
  2. 2.LORIA, UMR 7503, Lorraine UniversityNancyFrance

Personalised recommendations