Skip to main content
Springer Nature Link
Log in

An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem

  • Conference paper
Hybrid Metaheuristics (HM 2009)

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

Included in the following conference series:

Abstract

The well-known Vehicle Routing Problem (VRP) has been deeply studied over the last decades. Nowadays, generalizations of VRP are developed toward tactical or strategic decision levels of companies. The tactical extension plans a set of trips over a multiperiod horizon, subject to frequency constraints. The related problem is called the Periodic VRP (PVRP). On the other hand, the strategic extension is motivated by interdependent depot location and routing decisions in most distribution systems. Low-quality solutions are obtained if depots are located first, regardless the future routes. In the Location-Routing Problem (LRP), location and routing decisions are simultaneously tackled. The goal here is to combine the PVRP and LRP into an even more realistic problem covering all decision levels: the Periodic LRP or PLRP. A hybrid evolutionary algorithm is proposed to solve large size instances of the PLRP. First, an individual representing an assignment of customers to combinations of visit days is randomly generated. Then, a heuristic based on the Randomized Extended Clarke and Wright Algorithm (RECWA) creates feasible solutions. The evolution operates through an Evolutionary Local Search (ELS) on visit days assignments. The algorithm is hybridized with a Path Relinking between individuals from an elite list. The method is evaluated on three sets of instances and solutions are compared to the literature on particular cases such as one-day horizon (LRP) or one depot (PVRP). This metaheuristic outperforms the previous methods for the PLRP.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. http://neo.lcc.uma.es/radi-aeb/WebVRP/ (2007)

  2. Albareda-Sambola, M., Díaz, J.A., Fernández, E.: A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research 32, 407–428 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  3. Belenguer, J.M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R.: A cutting plane method for the capacitated location-routing problem. In: Odysseus 2006 - Third International Workshop on Freight Transportation and Logistics, Altea, Spain, May 2006, pp. 50–52 (2006)

    Google Scholar 

  4. Boudia, M., Louly, M.A.O., Prins, C.: A memetic algorithm with population management for a production-distribution problem. In: Dolgui, A., Morel, G., Pereira, C.E. (eds.) Preprints of the 12th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2006, Saint Etienne-France, May 2006, vol. 3, pp. 541–546 (2006)

    Google Scholar 

  5. Chao, M., Golden, B.L., Wasil, E.: An improved heuristic for the periodic vehicle routing problem. Networks 26, 25–44 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Christofides, N., Beasley, J.E.: The period routing problem. Networks 14, 237–256 (1984)

    Article  MATH  Google Scholar 

  7. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12, 568–581 (1964)

    Article  Google Scholar 

  8. Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks 30, 105–119 (1997)

    Article  MATH  Google Scholar 

  9. Glover, F., Laguna, M., Martí, R.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics 39, 653–684 (2000)

    MathSciNet  MATH  Google Scholar 

  10. Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research 195(3), 791–802 (2009)

    Article  MATH  Google Scholar 

  11. Laporte, G., Norbert, Y., Arpin, D.: Optimal solutions to capacitated multi-depot vehicle routing problems. Congressus Numerantium 44, 283–292 (1984)

    MathSciNet  Google Scholar 

  12. Lima, C.M.R.R., Goldbarg, M.C., Goldbarg, E.F.G.: A memetic algorithm for heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics 18, 171–176 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lourenço, H.R., Martin, O., Stützle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321–353. Kluwer, Boston (2003)

    Google Scholar 

  14. Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research 108, 1–15 (1998)

    Article  MATH  Google Scholar 

  15. Mingozzi, A., Valletta, A.: An exact algorithm for period and multi-depot vehicle routing problems. In: Odysseus 2003 - Second International Workshop on Freight Transportation and Logistics, Palermo, Italy (May 2003)

    Google Scholar 

  16. Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research 31, 1985–2002 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  17. Prins, C.: A GRASP × Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, pp. 35–53. Springer, Berlin (2009)

    Chapter  Google Scholar 

  18. Prins, C., Prodhon, C., Wolfler-Calvo, R.: A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 183–194. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  19. Prins, C., Prodhon, C., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR - A Quarterly Journal of Operations Research 4, 221–238 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  20. Prins, C., Prodhon, C., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a cooperative lagrangean relaxation-granular tabu search heuristic. Transportation Science 41(4), 470–483 (2007)

    Article  Google Scholar 

  21. Prodhon, C.: http://prodhonc.free.fr/homepage (2007)

  22. Prodhon, C.: An iterative metaheurtistic for the periodic location-routing problem. In: GOR 2007, Saarbrücken (September 2007)

    Google Scholar 

  23. Prodhon, C., Prins, C.: A memetic algorithm with population management (MA|PM) for the periodic location-routing problem. In: Blesa, M.J., Blum, C., Cotta, C., Fernández, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol. 5296, pp. 43–57. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  24. Prodhon, C.: An evolutionary algorithm for the periodic location-routing problem. In: Odysseus 2009 - Third International Workshop on Freight Transportation and Logistics, Cesme, Turkey, May 2009, pp. 43–57 (2009)

    Google Scholar 

  25. Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. European Journal of Operational Research 39, 150–156 (1989)

    Article  MathSciNet  MATH  Google Scholar 

  26. Sörensen, K., Sevaux, M.: MA | PM: memetic algorithms with population management. Computers and Operations Research 33, 1214–1225 (2006)

    Article  MATH  Google Scholar 

  27. Tan, C.C.R., Beasley, J.E.: A heuristic algorithm for the periodic vehicle routing problem. OMEGA International Journal of Management Science 12(5), 497–504 (1984)

    Article  Google Scholar 

  28. Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research 116, 87–99 (1999)

    Article  MATH  Google Scholar 

  29. Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI/ICCV 2007. LNCS, vol. 4771, pp. 1–15. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  30. Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research 29, 1393–1415 (2002)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institut Charles Delaunay, Université de Technologie de Troyes, BP 2060, 10010, Troyes Cedex, France

    Caroline Prodhon

Authors
  1. Caroline Prodhon
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Universitat Politècnica de Catalunya, Omega 213 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    María J. Blesa

  2. Universitat Politècnica de Catalunya, Omega 112 Campus Nord, Jordi Girona 1-3, 08034, Barcelona, Spain

    Christian Blum

  3. DIEGM, Università di Udine, via delle Scienze 208, 33100, Udine, Italy

    Luca Di Gaspero

  4. DEIS, Università di Bologna, Sede di Cesena, Via Venezia 52, 47521, Cesena, Italy

    Andrea Roli

  5. IRIDIA CP 194/6, Université Libre de Bruxelles, Avenue Franklin D. Roosevelt 50, 1050, Bruxelles, Belgium

    Michael Sampels

  6. DIEGM, University of Udine, via delle Scienze 208, 33100, Udine, Italy

    Andrea Schaerf

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Prodhon, C. (2009). An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds) Hybrid Metaheuristics. HM 2009. Lecture Notes in Computer Science, vol 5818. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04918-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04918-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04917-0

  • Online ISBN: 978-3-642-04918-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics