4OR

, Volume 4, Issue 3, pp 221–238 | Cite as

Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking

  • Christian Prins
  • Caroline Prodhon
  • Roberto Wolfler Calvo
Regular Paper
First Online:
Received:
Revised:

Abstract

As shown in recent researches, the costs in distribution systems may be excessive if routes are ignored when locating depots. The location routing problem (LRP) overcomes this drawback by simultaneously tackling location and routing decisions. This paper presents a new metaheuristic to solve the LRP with capacitated routes and depots. A first phase executes a GRASP, based on an extended and randomized version of Clarke and Wright algorithm. This phase is implemented with a learning process on the choice of depots. In a second phase, new solutions are generated by a post-optimization using a path relinking. The method is evaluated on sets of randomly generated instances, and compared to other heuristics and a lower bound. Solutions are obtained in a reasonable amount of time for such a strategic problem. Furthermore, the algorithm is competitive with a metaheuristic published for the case of uncapacitated depots.

Keywords

Heuristic Location routing problem GRASP Path relinking 

MSC Classification

90B06 
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Albareda-Sambola M, Díaz JA, Fernández E (2005) A compact model and tight bounds for a combined location-routing problem. Comput Oper Res 32(3):407–428CrossRefGoogle Scholar
  2. Barreto SS (2004) Análise e Modelização de Problemas de localização-distribuição (Analysis and modelization of location-routing problems)(in Portuguese). PhD thesis, University of Aveiro, campus universitário de Santiago, 3810–193Google Scholar
  3. Bruns A, Klose A (1995) An iterative heuristic for location-routing problems based on clustering. In: Proceedings of the 2nd international workshop on distribution logistics, OegstgeestGoogle Scholar
  4. Chan Y, Carter WB, Burnes MD (2001) A multiple-depot, multiple-vehicle, location-routing problem with stochastically processed demands. Comput Oper Res 28:803–826CrossRefGoogle Scholar
  5. Chien TW (1993) Heuristic procedures for practical-sized uncapacitated location-capacitated routing problems. Decis Sci 24(5):995–1021CrossRefGoogle Scholar
  6. Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568–581Google Scholar
  7. Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS (2004) New heuristics for the vehicle routing problem. In: Technical Report G-2004-33, GERADGoogle Scholar
  8. Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 2:1–27Google Scholar
  9. Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptative memory. INFORMS J Comput 11:198–204Google Scholar
  10. Ghiani G, Laporte G (2001) Location-arc routing problems. OPSEARCH 38:151–159Google Scholar
  11. Labadi N (2003) Problèmes tactiques et stratégiques en tournées sur arcs (Tactical and strategic problems on arc routing). PhD thesis, University of Technology of TroyesGoogle Scholar
  12. Laguna M, Martí R (1995) Grasp and path relinking for 2-layer straight line crossing minimization. INFORMS J Comput 11(1):44–52Google Scholar
  13. Laporte G, Gendreau M, Potvin JY, Semet F (2000) Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7:285–300CrossRefGoogle Scholar
  14. Laporte G, Louveaux F, Mercure H (1989) Models and exact solutions for a class of stochastic location-routing problems. Eur J Oper Res 39:71–78CrossRefGoogle Scholar
  15. Laporte G, Norbert Y, Taillefer S (1988) Solving a family of multi-depot vehicle routing and location-routing problems. Transportation Sci 22(3):161–167Google Scholar
  16. Lin S, Kernigham BW (1973) An effective heuristic algorithm for the traveling salesman problem. Oper Res 21:498–516CrossRefGoogle Scholar
  17. Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. European J Oper Res 108:1–15CrossRefGoogle Scholar
  18. Piñana E, Plana I, Campos V, Martí R (2004) GRASP and path relinking for the matrix bandwidth minimization. Eur J Oper Res 153:200–210CrossRefGoogle Scholar
  19. Prais M, Ribeiro CC (2000) Reactive GRASP: an application to a matrix decomposition problem in TDMA traffic assignment. INFORMS J Comput 12(3):164–176CrossRefGoogle Scholar
  20. Prins C, Prodhon C, Wolfler Calvo R (2004) Nouveaux algorithmes pour le problème de localisation et routage sous contraintes de capacité. In: Dolgui A., Dauzère-Pérès S. (eds) MOSIM’04, vol 2. Ecole des Mines de Nantes, Lavoisier, pp 1115–1122Google Scholar
  21. Resende MGC, Rebeiro CC (2003) Greedy randomized adaptive search procedures. In: Glover F., Kochenberger G. (eds) Handbook of metaheuristics. Kluwer, Dordrecht, pp 219–249CrossRefGoogle Scholar
  22. Resende MGC, Werneck RF (2002) A hybrid heuristic for the p-median problem. In: Technical report TD-SNWRCR, AT & TLab Research, Florham Park, NJ 07932Google Scholar
  23. Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39:150–156CrossRefGoogle Scholar
  24. Srivastava R (1993) Alternate solution procedures for the locating-routing problem. OMEGA Int J Manage Sci 21(4):497–506CrossRefGoogle Scholar
  25. Tuzun D, Burke LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 116:87–99CrossRefGoogle Scholar
  26. Wu TH, Low C, Bai JW (2002) Heuristic solutions to multi-depot location-routing problems. Comput Oper Res 29:1393–1415CrossRefGoogle Scholar

Copyright information

© Springer Verlag 2006

Authors and Affiliations

  • Christian Prins
    • 1
  • Caroline Prodhon
    • 1
  • Roberto Wolfler Calvo
    • 1
  1. 1.Institute Charles DelaunayUniversity of Technology of TroyesTroyes CedexFrance

Personalised recommendations