{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T05:14:35Z","timestamp":1779081275405,"version":"3.51.4"},"reference-count":26,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T00:00:00Z","timestamp":1374624000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Heuristics"],"published-print":{"date-parts":[[2014,2]]},"DOI":"10.1007\/s10732-013-9230-1","type":"journal-article","created":{"date-parts":[[2013,7,24]],"date-time":"2013-07-24T13:43:57Z","timestamp":1374673437000},"page":"1-38","source":"Crossref","is-referenced-by-count":50,"title":["A GRASP + ILP-based metaheuristic for the capacitated location-routing problem"],"prefix":"10.1007","volume":"20","author":[{"given":"Claudio","family":"Contardo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Fran\u00e7ois","family":"Cordeau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bernard","family":"Gendron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,7,24]]},"reference":[{"key":"9230_CR1","doi-asserted-by":"crossref","first-page":"1284","DOI":"10.1287\/opre.1110.0989","volume":"59","author":"R Baldacci","year":"2011","unstructured":"Baldacci, R., Mingozzi, A., Wolfler-Calvo, R.: An exact method for the capacitated location-routing problem. Oper. Res. 59, 1284\u20131296 (2011)","journal-title":"Oper. Res."},{"key":"9230_CR2","unstructured":"Barreto, S.: An\u00e1lise e Modeliza\u00e7\u00e3o de Problemas de localiza\u00e7\u00e3o-distribui\u00e7\u00e3o. Ph.D. thesis, University of Aveiro, Campus Universit\u00e1rio de Santiago, 3810\u2013193 Aveiro, Portugal. In Portuguese (2004)"},{"key":"9230_CR3","doi-asserted-by":"crossref","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","volume":"38","author":"JM Belenguer","year":"2011","unstructured":"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\u2013941 (2011)","journal-title":"Comput. Oper. Res."},{"key":"9230_CR4","doi-asserted-by":"crossref","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. Oper. Res. 12, 568\u2013581 (1964)","journal-title":"Oper. Res."},{"key":"9230_CR5","unstructured":"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\u00e9 de Montr\u00e9al, Canada (2011)"},{"key":"9230_CR6","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1287\/ijoc.2013.0549"},{"key":"9230_CR7","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"GA Croes","year":"1958","unstructured":"Croes, G.A.: A method for solving traveling-salesman problems. Oper. Res. 6, 791\u2013812 (1958)","journal-title":"Oper. Res."},{"key":"9230_CR8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R Franceschi de","year":"2006","unstructured":"de Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Math. Program. Ser. B 105, 471\u2013499 (2006)","journal-title":"Math. Program. Ser. B"},{"key":"9230_CR9","doi-asserted-by":"crossref","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C Duhamel","year":"2010","unstructured":"Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASP $$\\times $$ \u00d7 ELS approach for the capacitated location-routing problem. Comput. Oper. Res. 37, 1912\u20131923 (2010)","journal-title":"Comput. Oper. Res."},{"key":"9230_CR10","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0167-6377(89)90002-3","volume":"8","author":"T Feo","year":"1989","unstructured":"Feo, T., Resende, M.: A probabilistic heuristic for a computationally difficult set covering problem. Oper. Res. Lett. 8, 67\u201371 (1989)","journal-title":"Oper. Res. Lett."},{"key":"9230_CR11","doi-asserted-by":"crossref","first-page":"3185","DOI":"10.1016\/j.cor.2012.04.003","volume":"39","author":"VC Hemmelmayr","year":"2012","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. Comput. Oper. Res. 39, 3185\u20133199 (2012)","journal-title":"Comput. Oper. Res."},{"key":"9230_CR12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S., Kernighan, B.W.: An effective heuristic algorithm for the traveling-salesman problem. Oper. Res. 21, 498\u2013516 (1973)","journal-title":"Oper. Res."},{"key":"9230_CR13","doi-asserted-by":"crossref","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., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, volume 6373 of Lecture Notes in Computer Science, pp. 174\u2013189 (2010)","DOI":"10.1007\/978-3-642-16054-7_13"},{"key":"9230_CR14","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"JY Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. J. Oper. Res. Soc. 46, 1433\u20131446 (1995)","journal-title":"J. Oper. Res. Soc."},{"key":"9230_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C Prins","year":"2006","unstructured":"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\u2013238 (2006)","journal-title":"4OR"},{"key":"9230_CR16","doi-asserted-by":"crossref","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C Prins","year":"2007","unstructured":"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\u2013483 (2007)","journal-title":"Transp. Sci."},{"key":"9230_CR17","doi-asserted-by":"crossref","unstructured":"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\u201329 (2009)","DOI":"10.1007\/978-3-642-04918-7_2"},{"key":"9230_CR18","doi-asserted-by":"crossref","first-page":"204","DOI":"10.1016\/j.ejor.2010.09.021","volume":"210","author":"C Prodhon","year":"2011","unstructured":"Prodhon, C.: A hybrid evolutionary algorithm for the periodic location-routing problem. Eur. J. Oper. Res. 210, 204\u2013212 (2011)","journal-title":"Eur. J. Oper. Res."},{"key":"9230_CR19","doi-asserted-by":"crossref","unstructured":"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\u00e1ndez, A., Gallardo, J., Roli, A., Sampels, M. (eds.) Hybrid Metaheuristics, volume 5296 of Lecture Notes in Computer Science, pp. 43\u201357 (2008)","DOI":"10.1007\/978-3-540-88439-2_4"},{"key":"9230_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"9230_CR21","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S R\u00f8pke","year":"2006","unstructured":"R\u00f8pke, S., Pisinger, D.: An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transp. Sci. 40, 455\u2013472 (2006)","journal-title":"Transp. Sci."},{"key":"9230_CR22","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1016\/0305-0483(92)90009-V","volume":"20","author":"S Salhi","year":"1992","unstructured":"Salhi, S., Sari, M., Saidi, D., Touati, N.: Adaptation of some vehicle fleet mix heuristics. Omega 20, 653\u2013660 (1992)","journal-title":"Omega"},{"key":"9230_CR23","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"MWP Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.W.P.: The vehicle routing problem with time windows: minimizing route duration. ORSA J. Comput. 4, 146\u2013154 (1992)","journal-title":"ORSA J. Comput."},{"key":"9230_CR24","unstructured":"Subramanian, A., Uchoa, E., Ochi, L.S.: A hybrid algorithm for a class of vehicle routing problems. Comput. Oper. Res. 40, 2519\u20132531 (2013)"},{"key":"9230_CR25","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","volume":"116","author":"D Tuzun","year":"1999","unstructured":"Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. Eur. J. Oper. Res. 116, 87\u201399 (1999)","journal-title":"Eur. J. Oper. Res."},{"key":"9230_CR26","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","volume":"58","author":"VF Yu","year":"2010","unstructured":"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\u2013299 (2010)","journal-title":"Comput. Ind. Eng."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9230-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10732-013-9230-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10732-013-9230-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,3,2]],"date-time":"2022-03-02T00:23:47Z","timestamp":1646180627000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10732-013-9230-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,24]]},"references-count":26,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["9230"],"URL":"https:\/\/doi.org\/10.1007\/s10732-013-9230-1","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,24]]}}}