{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,12]],"date-time":"2026-01-12T22:08:09Z","timestamp":1768255689035,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642291234","type":"print"},{"value":"9783642291241","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29124-1_2","type":"book-chapter","created":{"date-parts":[[2012,3,23]],"date-time":"2012-03-23T17:24:42Z","timestamp":1332523482000},"page":"13-24","source":"Crossref","is-referenced-by-count":34,"title":["A Variable Neighborhood Search Approach for the Two-Echelon Location-Routing Problem"],"prefix":"10.1007","author":[{"given":"Martin","family":"Schwengerer","sequence":"first","affiliation":[]},{"given":"Sandro","family":"Pirkwieser","sequence":"additional","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"6","key":"2_CR1","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(80)90124-1","volume":"5","author":"S.K. Jacobsen","year":"1980","unstructured":"Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research\u00a05(6), 378\u2013387 (1980)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S. Salhi","year":"1989","unstructured":"Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. European Journal of Operational Research\u00a039(2), 150\u2013156 (1989)","journal-title":"European Journal of Operational Research"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1007\/978-3-642-16054-7_13","volume-title":"Hybrid Metaheuristics","author":"S. Pirkwieser","year":"2010","unstructured":"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.\u00a06373, pp. 174\u2013189. Springer, Heidelberg (2010)"},{"key":"2_CR4","unstructured":"Gonzalez-Feliu, J.: The n-echelon location routing problem: concepts and methods for tactical and operational planning. Working Papers halshs-00422492, HAL (2009)"},{"key":"2_CR5","unstructured":"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)"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-13193-6_25","volume-title":"Experimental Algorithms","author":"M. Boccia","year":"2010","unstructured":"Boccia, M., Crainic, T., Sforza, A., Sterle, C.: A Metaheuristic for a Two Echelon Location-Routing Problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 288\u2013301. Springer, Heidelberg (2010)"},{"issue":"1","key":"2_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/j.ejor.2011.07.030","volume":"216","author":"V.P. Nguyen","year":"2012","unstructured":"Nguyen, V.P., Prins, C., Prodhon, C.: Solving the two-echelon location routing problem by a GRASP reinforced by a learning process and path relinking. European Journal of Operational Research\u00a0216(1), 113\u2013126 (2012)","journal-title":"European Journal of Operational Research"},{"issue":"1","key":"2_CR8","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.engappai.2011.09.012","volume":"25","author":"V.P. Nguyen","year":"2011","unstructured":"Nguyen, V.P., Prins, C., Prodhon, C.: A multi-start iterated local search with tabu list and path relinking for the two-echelon location-routing problem. Engineering Applications of Artificial Intelligence\u00a025(1), 56\u201371 (2011)","journal-title":"Engineering Applications of Artificial Intelligence"},{"key":"2_CR9","unstructured":"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)"},{"key":"2_CR10","doi-asserted-by":"crossref","unstructured":"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\u2013645 (2010)","DOI":"10.1109\/ICMSS.2010.5577864"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"2_CR12","unstructured":"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)"},{"issue":"3","key":"2_CR13","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1016\/S0377-2217(96)00227-5","volume":"102","author":"S. Tragantalerngsak","year":"1997","unstructured":"Tragantalerngsak, S., Holt, J., R\u00f6nnqvist, M.: Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem. European Journal of Operational Research\u00a0102(3), 611\u2013625 (1997)","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"2_CR14","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1002\/1520-6750(199203)39:2<191::AID-NAV3220390205>3.0.CO;2-T","volume":"39","author":"L.L. Gao","year":"1992","unstructured":"Gao, L.L., Robinson Jr., E.P.: A dual-based optimization procedure for the two-echelon uncapacitated facility location problem. Naval Research Logistics\u00a039(2), 191\u2013212 (1992)","journal-title":"Naval Research Logistics"},{"key":"2_CR15","unstructured":"Gonzalez-Feliu, J.: Two-echelon freight transport optimisation: unifying concepts via a systematic review. Post-Print halshs-00569980, HAL (2011)"},{"key":"2_CR16","unstructured":"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)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/978-1-4419-1665-5_3","volume-title":"Handbook of Metaheuristics","author":"P. Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., Brimberg, J., Moreno P\u00e9rez, J.A.: Variable neighborhood search. In: Gendreau, M., Potvin, J.Y. (eds.) Handbook of Metaheuristics, 2nd edn., pp. 61\u201386. Springer, Heidelberg (2010)","edition":"2"},{"issue":"4","key":"2_CR18","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012(4), 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.Y. Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Journal of the Operational Research Society"},{"issue":"3","key":"2_CR20","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"V.C. Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research\u00a0195(3), 791\u2013802 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"4598","key":"2_CR21","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"key":"2_CR22","unstructured":"Prodhon, C.: (December 2011), \n                  \n                    http:\/\/prodhonc.free.fr\/"},{"key":"2_CR23","unstructured":"Sterle, C.: Private communication (2011)"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29124-1_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:25:01Z","timestamp":1620127501000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29124-1_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642291234","9783642291241"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29124-1_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012]]}}}