{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T20:35:55Z","timestamp":1724531755669},"reference-count":14,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,3,30]],"date-time":"2007-03-30T00:00:00Z","timestamp":1175212800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR"],"published-print":{"date-parts":[[2007,11,29]]},"DOI":"10.1007\/s10288-007-0039-3","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T14:33:24Z","timestamp":1175178804000},"page":"339-342","source":"Crossref","is-referenced-by-count":1,"title":["Solving the capacitated location-routing problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Caroline","family":"Prodhon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2007,3,30]]},"reference":[{"key":"39_CR1","unstructured":"Barreto SS (2004) An\u00e1lise e Modeliza\u00e7\u00e3o de Problemas de localiza\u00e7\u00e3o-distribui\u00e7\u00e3o (Analysis and modelling of location-routing problems). Ph.D thesis, University of Aveiro, campus universit\u00e1rio de Santiago. Aveiro, Portugal, pp 3810\u20133193 (in Portuguese)"},{"key":"39_CR2","doi-asserted-by":"crossref","unstructured":"Belenguer JM, Benavent E, Prins C, Prodhon C, Wolfler-Calvo R (2006) A branch and cut method for the capacitated location-routing problem. In: ICSSSM\u201906, Troyes, France, pp 1541\u20131546, ISBN 1-4244-0451-7","DOI":"10.1109\/ICSSSM.2006.320765"},{"key":"39_CR3","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 JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"key":"39_CR4","first-page":"1","volume":"2","author":"T Feo","year":"1995","unstructured":"Feo T, Resende MGC (1995) Greedy randomized adaptive search procedures. J Global Optim 2:1\u201327","journal-title":"J Global Optim"},{"key":"39_CR5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford AN, Eglese RW (2004) A new branch-and-cut algorithm for the capacitated vehicle routing problem. Math Program 100:423\u2013445","journal-title":"Math Program"},{"key":"39_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(97)00172-0","volume":"108","author":"H Min","year":"1998","unstructured":"Min H, Jayaraman V, Srivastava R (1998) Combined location-routing problems: a synthesis and future research directions. Eur J Oper Res 108:1\u201315","journal-title":"Eur J Oper Res"},{"key":"39_CR7","first-page":"1115","volume-title":"MOSIM\u201904, vol 2","author":"C Prins","year":"2004","unstructured":"Prins C, Prodhon C, Wolfler-Calvo R (2004) Nouveaux algorithmes pour le probl\u00e8me de localisation et routage sous contraintes de capacit\u00e9. In: Dolgui A, Dauz\u00e8re-P\u00e9r\u00e8s S (eds). MOSIM\u201904, vol 2. Ecole des Mines de Nantes, Lavoisier, pp. 1115\u20131122"},{"key":"39_CR8","doi-asserted-by":"crossref","unstructured":"Prins C, Prodhon C, Wolfler-Calvo R (2006a) A memetic algorithm with population management (MA | PM) for the capacitated location-routing problem. In: Gottlieb J, Raidl GR (eds) Lecture Notes in Computer Science, vol 3906. Proceedings of EvoCOP2006 (Evolutionary computation in combinatorial optimization: 6th European conference, Budapest, Hungary, April 10\u201312, 2006), Springer, Heidelberg, pp 183\u2013194","DOI":"10.1007\/11730095_16"},{"key":"39_CR9","doi-asserted-by":"crossref","unstructured":"Prins C, Prodhon C, Wolfler-Calvo R (2006b) Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR, 4:221\u2013238","DOI":"10.1007\/s10288-006-0001-9"},{"key":"39_CR10","doi-asserted-by":"crossref","unstructured":"Prins C, Prodhon C, Wolfler-Calvo R (to appear) Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transp Sci","DOI":"10.1287\/trsc.1060.0187"},{"key":"39_CR11","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S Salhi","year":"1989","unstructured":"Salhi S, Rand GK (1989) The effect of ignoring routes when locating depots. Eur J Oper Res 39:150\u2013156","journal-title":"Eur J Oper Res"},{"key":"39_CR12","unstructured":"S\u00f6rensen K, Sevaux M (2003) GA | PM: genetic algorithms with population management for permutation problems. In: MIC2003"},{"issue":"4","key":"39_CR13","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth P, Vigo D (2003) The granular tabu search (and its application to the vehicle routing problems). INFORMS J Comput 15(4):333\u2013346","journal-title":"INFORMS J Comput"},{"key":"39_CR14","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 LI (1999) A two-phase tabu search approach to the location routing problem. Eur J Oper Res 116:87\u201399","journal-title":"Eur J Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0039-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-007-0039-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-007-0039-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T08:12:54Z","timestamp":1559117574000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-007-0039-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,3,30]]},"references-count":14,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2007,11,29]]}},"alternative-id":["39"],"URL":"https:\/\/doi.org\/10.1007\/s10288-007-0039-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,3,30]]}}}