Journal of Heuristics

, Volume 20, Issue 1, pp 1–38 | Cite as

A GRASP + ILP-based metaheuristic for the capacitated location-routing problem

  • Claudio Contardo
  • Jean-François Cordeau
  • Bernard Gendron
Article

Abstract

In this paper we present a three-phase heuristic for the Capacitated Location-Routing Problem. In the first stage, we apply a GRASP followed by local search procedures to construct a bundle of solutions. In the second stage, an integer-linear program (ILP) is solved taking as input the different routes belonging to the solutions of the bundle, with the objective of constructing a new solution as a combination of these routes. In the third and final stage, the same ILP is iteratively solved by column generation to improve the solutions found during the first two stages. The last two stages are based on a new model, the location-reallocation model, which generalizes the capacitated facility location problem and the reallocation model by simultaneously locating facilities and reallocating customers to routes assigned to these facilities. Extensive computational experiments show that our method is competitive with the other heuristics found in the literature, yielding the tightest average gaps on several sets of instances and being able to improve the best known feasible solutions for some of them.

Keywords

Location-routing Column generation Metaheuristic 

References

  1. Baldacci, R., Mingozzi, A., Wolfler-Calvo, R.: An exact method for the capacitated location-routing problem. Oper. Res. 59, 1284–1296 (2011)CrossRefMATHMathSciNetGoogle Scholar
  2. Barreto, S.: Análise e Modelização de Problemas de localização-distribuição. Ph.D. thesis, University of Aveiro, Campus Universitário de Santiago, 3810–193 Aveiro, Portugal. In Portuguese (2004)Google Scholar
  3. Belenguer, J.M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R.: A branch-and-cut algorithm for the capacitated location routing problem. Comput. Oper. Res. 38, 931–941 (2011)CrossRefMATHMathSciNetGoogle Scholar
  4. Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Oper. Res. 12, 568–581 (1964)CrossRefGoogle Scholar
  5. Contardo, C., Cordeau, J.F., Gendron, B.: A computational comparison of flow formulations for the capacitated location-routing problem. Technical Report CIRRELT-2011-47, Université de Montréal, Canada (2011)Google Scholar
  6. Contardo, C., Cordeau, J.F.: Gendron. B. An exact algorithm based on cut-and-column generation for the capacitated location-routing problem, INFORMS J. Comput. (2013). (Forthcoming)Google Scholar
  7. Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6, 791–812 (1958)CrossRefMathSciNetGoogle Scholar
  8. de Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. Ser. B 105, 471–499 (2006)CrossRefMATHGoogle Scholar
  9. Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASP\(\times \)ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37, 1912–1923 (2010)CrossRefMATHGoogle Scholar
  10. Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67–71 (1989)CrossRefMATHMathSciNetGoogle Scholar
  11. Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput. Oper. Res. 39, 3185–3199 (2012)CrossRefMathSciNetGoogle Scholar
  12. Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498–516 (1973)CrossRefMATHMathSciNetGoogle Scholar
  13. Pirkwieser, S., Raidl, G.R. Variable neighborhood search coupled with ILP-based very large-neighborhood searches for the (periodic) location-routing problem. In: Blesa, M., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, volume 6373 of Lecture Notes in Computer Science, pp. 174–189 (2010)Google Scholar
  14. Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46, 1433–1446 (1995)MATHGoogle Scholar
  15. Prins, C., Prodhon, C., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and path relinking. 4OR 4, 221–238 (2006)CrossRefMATHMathSciNetGoogle Scholar
  16. Prins, C., Prodhon, C., Ruiz, A., Soriano, P., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp. Sci. 41, 470–483 (2007)CrossRefGoogle Scholar
  17. Prodhon, C.: An ELS x path relinking hybrid for the periodic location-routing problem. In: Blesa, M., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) Hybrid Metaheuristics, volume 5818 of Lecture Notes in Computer Science, pp. 15–29 (2009)Google Scholar
  18. Prodhon, C.: A hybrid evolutionary algorithm for the periodic location-routing problem. Eur. J. Oper. Res. 210, 204–212 (2011)CrossRefMATHMathSciNetGoogle Scholar
  19. Prodhon, C., Prins, C.: A memetic algorithm with population management (MA\(|\)PM) for the periodic location-routing problem. In: Blesa, M., Blum, C., Cotta, C., Fernández, A., Gallardo, J., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, volume 5296 of Lecture Notes in Computer Science, pp. 43–57 (2008)Google Scholar
  20. Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147–167 (1995)CrossRefMATHGoogle Scholar
  21. Røpke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455–472 (2006)CrossRefGoogle Scholar
  22. Salhi, S., Sari, M., Saidi, D., Touati, N.: Adaptation of some vehicle fleet mix heuristics. Omega 20, 653–660 (1992)CrossRefGoogle Scholar
  23. Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4, 146–154 (1992)CrossRefMATHGoogle Scholar
  24. Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40, 2519–2531 (2013)Google Scholar
  25. Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116, 87–99 (1999)CrossRefMATHGoogle Scholar
  26. Yu, V.F., Lin, S.W., Lee, W., Ting, C.J.: A simulated annealing heuristic for the capacitated location routing problem. Comput. Ind. Eng. 58, 288–299 (2010)CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 2013

Authors and Affiliations

  • Claudio Contardo
    • 1
    • 2
  • Jean-François Cordeau
    • 3
    • 5
  • Bernard Gendron
    • 4
    • 5
  1. 1.Département de management et technologieESG UQÀMMontréalCanada
  2. 2.Groupe d’études et de recherche en analyse des décisions (GERAD)MontréalCanada
  3. 3.Canada Research Chair in Logistics and TransportationHEC MontréalMontréalCanada
  4. 4.Département d’informatique et de recherche opérationnelleUniversité de MontréalMontréalCanada
  5. 5.Centre interuniversitaire de recherche sur les réseaux d’entreprise la logistique et le transport (CIRRELT)MontréalCanada

Personalised recommendations