A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem
We consider the two-echelon location-routing problem (2E-LRP), a well-known problem in freight distribution arising when establishing a two-level transport system with limited capacities. The problem is a generalization of the location routing problem (LRP), involving strategic (location), tactical (allocation) and operational (routing) decisions at the same time. We present a variable neighborhood search (VNS) based on a previous successful VNS for the LRP, accordingly adapted as well as extended. The proposed algorithm provides solutions of high quality in short time, making use of seven different basic neighborhood structures parameterized with different perturbation size leading to a total of 21 specific neighborhood structures. For intensification, two consecutive local search methods are applied, optimizing the transport costs efficiently by considering only recently changed solution parts. Experimental results clearly show that our method is at least competitive regarding runtime and solution quality to other leading approaches, also improving upon several best known solutions.
KeywordsVariable Neighborhood Search Vehicle Route Problem Facility Location Problem Path Relinking Location Route Problem
Unable to display preview. Download preview PDF.
- 3.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.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) HM 2010. LNCS, vol. 6373, pp. 174–189. Springer, Heidelberg (2010)CrossRefGoogle Scholar
- 4.Gonzalez-Feliu, J.: The n-echelon location routing problem: concepts and methods for tactical and operational planning. Working Papers halshs-00422492, HAL (2009)Google Scholar
- 5.Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: Location-routing models for designing a two-echelon freight distribution system. Technical Report CIRRELT-2011-06, University of Montreal (2011)Google Scholar
- 9.Contardo, C., Hemmelmayr, V.C., Crainic, T.G.: Lower and upper bounds for the two-echelon capacitated location routing problem. Technical Report CIRRELT-2011-63, University of Montreal (2011)Google Scholar
- 10.Jin, L., Zhu, Y., Shen, H., Ku, T.: A hybrid genetic algorithm for two-layer location-routing problem. In: 2010 4th International Conference on New Trends in Information Science and Service Science (NISS), pp. 642–645 (2010)Google Scholar
- 11.Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problem. Technical Report CIRRELT-2010-30, University of Montreal (2010)Google Scholar
- 12.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. Technical Report CIRRELT-2011-42, University of Montreal (2011)Google Scholar
- 15.Gonzalez-Feliu, J.: Two-echelon freight transport optimisation: unifying concepts via a systematic review. Post-Print halshs-00569980, HAL (2011)Google Scholar
- 16.Contardo, C., Cordeau, J.F., Gendron, B.: A grasp + ilp-based metaheuristic for the capacitated location-routing problem. Technical Report CIRRELT-2011-52, University of Montreal (2011)Google Scholar
- 22.Prodhon, C.: (December 2011), http://prodhonc.free.fr/
- 23.Sterle, C.: Private communication (2011)Google Scholar