{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T04:05:54Z","timestamp":1773201954723,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642203633","type":"print"},{"value":"9783642203640","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-20364-0_16","type":"book-chapter","created":{"date-parts":[[2011,4,26]],"date-time":"2011-04-26T13:21:34Z","timestamp":1303824094000},"page":"179-190","source":"Crossref","is-referenced-by-count":71,"title":["Multi-start Heuristics for the Two-Echelon Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Teodor Gabriel","family":"Crainic","sequence":"first","affiliation":[]},{"given":"Simona","family":"Mancini","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Perboli","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tadei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0305-0548(03)00245-4","volume":"32","author":"M. Albareda-Sambola","year":"2005","unstructured":"Albareda-Sambola, M., Diaz, J., Fernandez, E.: A compact model and tight bounds for a combined location-routing problem. Computers & Operations Research\u00a032, 407\u2013428 (2005)","journal-title":"Computers & Operations Research"},{"key":"16_CR2","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.ejor.2005.06.074","volume":"179","author":"S. Barreto","year":"2007","unstructured":"Barreto, S., Ferreira, C., Paixao, J., Souza Santos, B.: Using clustering analysis in a capacitated location-routing problem. European Journal of Operation Research\u00a0179, 968\u2013977 (2007)","journal-title":"European Journal of Operation Research"},{"issue":"6","key":"16_CR3","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1016\/j.cor.2010.09.019","volume":"38","author":"J. Belenguer","year":"2010","unstructured":"Belenguer, J., Benavent, E., Prins, C., Prodhon, C.: A branch-and-cut method for the capacitated location-routing problem. Computers & Operation Research\u00a038(6), 931\u2013941 (2010)","journal-title":"Computers & Operation Research"},{"key":"16_CR4","unstructured":"Boulanger, C., Semet, F.: A column generation based heuristic for the capacitated location-routing problem. In: EU\/MEeting (2008)"},{"key":"16_CR5","first-page":"315","volume-title":"Combinatorial Optimization","author":"N. Christofides","year":"1979","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The Vehicle Routing Problem. In: Christofides, N., Mingozzi, A., Toth, P., Sandi, C. (eds.) Combinatorial Optimization, pp. 315\u2013338. John Wiley, New York (1979)"},{"key":"16_CR6","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1287\/trsc.1090.0279","volume":"43","author":"T.G. Crainic","year":"2009","unstructured":"Crainic, T.G., Ricciardi, N., Storchi, G.: Models for evaluating and planning city logistics systems. Transportation Science\u00a043, 432\u2013454 (2009)","journal-title":"Transportation Science"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"5944","DOI":"10.1016\/j.sbspro.2010.04.009","volume":"2","author":"T.G. Crainic","year":"2010","unstructured":"Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Two-echelon vehicle routing problem: A satellite location analysis. PROCEDIA Social and Behavioral Sciences\u00a02, 5944\u20135955 (2010)","journal-title":"PROCEDIA Social and Behavioral Sciences"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problems. Tech. Rep. CIRRELT-2010-30, CIRRELT (2010)","DOI":"10.1007\/978-3-642-20364-0_16"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1016\/j.cor.2008.02.009","volume":"36","author":"B. Gendron","year":"2009","unstructured":"Gendron, B., Semet, F.: Formulations and relaxations for a multi-echelon capacitated location-distribution problem. Computers & Operations Research\u00a036, 1335\u20131355 (2009)","journal-title":"Computers & Operations Research"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/0-306-48056-5_12","volume-title":"Handbook of Metaheuristics","author":"R. Marti","year":"2003","unstructured":"Marti, R.: Multi-Start Methods. In: Handbook of Metaheuristics, vol.\u00a057, pp. 355\u2013368. Springer, New York (2003)"},{"key":"16_CR11","unstructured":"Perboli, G., Tadei, R., Masoero, F.: New families of valid inequalities for the two-echelon vehicle routing problem. Electronic Notes on Discrete Mathematics (2010) (forthcoming), 10.1016\/J.ENDM.2010.05.081"},{"key":"16_CR12","unstructured":"Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem. Publication cirrelt-2008-55, CIRRELT Montr\u00e9al, Canada (2008); and Transportation Science (forthcoming)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C. Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Wolfer-Calvo, R.: Solving the capacitated location-routing problem by a grasp complemented by a learning process and a path relinking. 4OR\u00a04, 221\u2013238 (2006)","journal-title":"4OR"},{"key":"16_CR14","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1016\/S0167-8191(03)00045-0","volume":"29","author":"T.K. Ralphs","year":"2003","unstructured":"Ralphs, T.K.: Parallel Branch and Cut for Capacitated Vehicle Routing. Parallel Computing\u00a029, 607\u2013629 (2003)","journal-title":"Parallel Computing"},{"key":"16_CR15","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"S. Salhi","year":"2007","unstructured":"Salhi, S., Nagy, G.: Location-routing: Issues, models and methods. European Journal of Operation Research\u00a0177, 649\u2013672 (2007)","journal-title":"European Journal of Operation Research"},{"key":"16_CR16","unstructured":"Standard Performance Evaluation Corporation: SPEC CPU2006 benchmarks (2006), \n                  \n                    http:\/\/www.spec.org\/cpu2006\/results\/"},{"key":"16_CR17","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1016\/j.cie.2009.10.007","volume":"58","author":"V. Yu","year":"2010","unstructured":"Yu, V., Lin, S., Lee, W., Ting, C.: A simulated annealing heuristic for the capacitated location routing problem. Computers & Industrial Engineering\u00a058, 288\u2013299 (2010)","journal-title":"Computers & Industrial Engineering"}],"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-20364-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:11:08Z","timestamp":1558573868000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-20364-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642203633","9783642203640"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-20364-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}