Abstract
This paper presents a new hybrid metaheuristic between a greedy randomized adaptive search procedure (GRASP) and an evolutionary/iterated local search (ELS/ILS), using Tabu list to solve the two-echelon location routing problem (LRP-2E). The GRASP uses in turn three constructive heuristics followed by local search to generate the initial solutions. From a solution of GRASP, an intensification strategy is carried out by a dynamic alternation between ELS and ILS. In this phase, each child is obtained by mutation and evaluated through a splitting procedure of giant tour followed by a local search. The tabu list, defined by two characteristics of solution (total cost and number of trips), is used to avoid searching a space already explored. The results show that our metaheuristic clearly outperforms all previously published methods on LRP-2E benchmark instances. Furthermore, it is competitive with the best meta-heuristic published for the single-echelon LRP.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Crainic, T.G., Ricciardi, N., Storchi, G.: Advanced freight transportation systems for congested urban. Transportation Research Part C (12), 119–137 (2004)
Crainic, T.G., Ricciardi, N., Storchi, G.: Models for evaluating and planning city logistic transportation systems. Technical Report, CIRRELT-2007-65, CIRRELT, Montreal, Canada (2007)
Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Heuristics for the two-echelon capacitated vehicle routing problem. Technical report, Université de Montreal, Montreal, Canada (2008)
Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Lower bounds for the two-echelon capacitated vehicle routing problem. In: EU/Meeting, France (2008)
Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Two-Echelon Vehicle Routing Problem: A satellite Location Analysis. Technical Report, CIRRELT-2009-15, CIRRELT, Montreal, Canada (2009)
Crevier, B., Cordeau, J.-F., Laporte, G.: The multi-depot vehicle routing problem with inter-depot routes. European Journal of Operational Research 176(2), 756–773 (2007)
Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASPxELS approach for the capacitated location-routing problem. Computer & Operations Research (2009)
Feliu, J.G., Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem. Technical Report OR/02/08, Politecnico di Torino (2008)
Gendron, B., Semet, F.: Formulations and Relaxations of a Multi-Echelon Capacitated Location-Distribution Probléme. Computers & Operations Research 36, 1335–1355 (2009)
Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level routing-location probléme. European Journal of Operational Research 5, 378–387 (1980)
Nguyen, V.P., Prins, C., Prodhon, C.: GRASP with learning process for a two-echelon location routing problem. In: 8th MOSIM (2010)
Nguyen, V.P., Prins, C., Prodhon, C.: A hybrid GRASP x Path Relinking for the Two-Echelon Location Routing. In: EURO 2010, Lisbon, Portugal (2010)
Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers & Operations Research 31, 1985–2002 (2004)
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(3), 221–238 (2006)
Prins, C., Prodhon, C., Wolfler-Calvo, R.: A Memetic Algorithm with Population Management (MAPM) for the Capacitated Location-Routing Problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol. 3906, pp. 183–194. Springer, Heidelberg (2006)
Prins, C., Prodhon, C., Soriano, P., Ruiz, A., 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)
Prodhon, C.: Le Problme de Localisation-Routage. Thèse de Doctorat, Universit de Technologie de Troyes, France (2006)
Scheuerer, S.: A tabu search heuristic for the truck and trailer routing problem. Computers & Operations Research 33, 894–909 (2006)
Semet, F., Taillard, E.: Solving real-life vehicle routing problems efficiently using tabu search. Annals of Operations Research 41, 469–488 (1993)
Sheskin, J.: Handbook of parametric and nonparametric statistical procedures. Chapman&Hall/CRC, Boca Raton (2000)
Taniguchi, E., Thompson, R.G.: Modeling City Logistics. Transportation Research Record 1970, 45–51 (2002)
Tragantalerngsak, S., Holt, J., Ronnqvist, M.: Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. European Journal of Operational Research 102, 611–625 (2007)
Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: GRASP and multi-start evolutionary local search for the single truck and trailer routing problem with satellite depots. Engineering Applications of Artificial Intelligence (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, VP., Prins, C., Prodhon, C. (2010). A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-16054-7_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16053-0
Online ISBN: 978-3-642-16054-7
eBook Packages: Computer ScienceComputer Science (R0)