{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:36:09Z","timestamp":1774020969434,"version":"3.50.1"},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Manag Sci"],"published-print":{"date-parts":[[2010,7]]},"DOI":"10.1007\/s10287-009-0118-3","type":"journal-article","created":{"date-parts":[[2009,12,31]],"date-time":"2009-12-31T09:41:52Z","timestamp":1262252512000},"page":"229-268","source":"Crossref","is-referenced-by-count":69,"title":["An exact solution framework for a broad class of vehicle routing problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Roberto","family":"Baldacci","sequence":"first","affiliation":[]},{"given":"Enrico","family":"Bartolini","sequence":"additional","affiliation":[]},{"given":"Aristide","family":"Mingozzi","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Roberti","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,1,1]]},"reference":[{"key":"118_CR1","unstructured":"Augerat P (1995) Approche poly\u00e9drale du probl\u00e8me de tourn\u00e9es de v\u00e9hicules. PhD thesis, Institut National Polytechnique de Grenoble"},{"key":"118_CR2","unstructured":"Augerat P, Belenguer JM, Benavent E, Corber\u00e1n A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Technical Report 1 RR949-M, ARTEMIS-IMAG, Grenoble, France"},{"issue":"2","key":"118_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/s10107-008-0218-9","volume":"120","author":"R Baldacci","year":"2009","unstructured":"Baldacci R, Mingozzi A (2009) A unified exact method for solving different classes of vehicle routing problems. Math Program Ser A 120(2): 347\u2013380","journal-title":"Math Program Ser A"},{"key":"118_CR4","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci R, Hadjiconstantinou EA, Mingozzi A (2004a) An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper Res 52: 723\u2013738","journal-title":"Oper Res"},{"key":"118_CR5","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1287\/opre.1030.0106","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci R, Maniezzo V, Mingozzi A (2004b) An exact method for the car pooling problem based on lagrangean column generation. Oper Res 52: 422\u2013439","journal-title":"Oper Res"},{"key":"118_CR6","doi-asserted-by":"crossref","first-page":"2667","DOI":"10.1016\/j.cor.2005.02.023","volume":"33","author":"R Baldacci","year":"2006","unstructured":"Baldacci R, Bodin LD, Mingozzi A (2006) The multiple disposal facilities and multiple inventory locations rollon-rolloff vehicle routing problem. Comput Oper Res 33: 2667\u20132702","journal-title":"Comput Oper Res"},{"issue":"4","key":"118_CR7","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/s10288-007-0063-3","volume":"5","author":"R Baldacci","year":"2007","unstructured":"Baldacci R, Toth P, Vigo D (2007) Recent advances in vehicle routing exact algorithms. 4OR: Q J Oper Res 5(4): 269\u2013298","journal-title":"4OR: Q J Oper Res"},{"key":"118_CR8","volume-title":"The vehicle routing problem: latest advances and new challenges, vol 43","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Battarra M, Vigo D (2008a) Routing a heterogeneous fleet of vehicles. In: Golden BL, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin"},{"issue":"2","key":"118_CR9","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10107-007-0178-5","volume":"115","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Christofides N, Mingozzi A (2008b) An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts. Math Program Ser A 115(2): 351\u2013385","journal-title":"Math Program Ser A"},{"key":"118_CR10","unstructured":"Baldacci R, Bartolini E, Mingozzi A (2009a) An exact algorithm for the pickup and delivery problem with time windows (submitted)"},{"key":"118_CR11","unstructured":"Baldacci R, Bartolini E, Mingozzi A, Valletta A (2009b) An exact algorithm for the period routing problem (submitted)"},{"key":"118_CR12","unstructured":"Baldacci R, Mingozzi A, Roberti R (2009c) Solving the vehicle routing problem with time windows using new state space relaxation and pricing strategies (submitted)"},{"key":"118_CR13","unstructured":"Baldacci R, Mingozzi A, Roberti R (2009d) New benchmarks results for the capacitated vehicle routing problem. Working paper"},{"key":"118_CR14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1023\/B:ANOR.0000019089.86834.91","volume":"127","author":"MA Boschetti","year":"2004","unstructured":"Boschetti MA, Mingozzi A, Ricciardelli S (2004) An exact algorithm for the simplyfied multi depot crew scheduling problem. Ann Oper Res 127: 177\u2013201","journal-title":"Ann Oper Res"},{"issue":"1","key":"118_CR15","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Braysy","year":"2005","unstructured":"Braysy O, Gendreau M (2005a) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1): 119\u2013139","journal-title":"Transp Sci"},{"issue":"1","key":"118_CR16","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Braysy","year":"2005","unstructured":"Braysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part I: route construction and local search algorithms. Transp Sci 39(1): 104\u2013118","journal-title":"Transp Sci"},{"issue":"1","key":"118_CR17","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1002\/net.3230260104","volume":"26","author":"IM Chao","year":"1995","unstructured":"Chao IM, Golden BL, Wasil E (1995) An improved heuristic for the period vehicle-routing problem. Networks 26(1): 25\u201344","journal-title":"Networks"},{"key":"118_CR18","doi-asserted-by":"crossref","first-page":"2080","DOI":"10.1016\/j.cor.2005.08.002","volume":"34","author":"E Choi","year":"2007","unstructured":"Choi E, Tcha DW (2007) A column generation approach to the heterogeneous fleet vehicle routing problem. Comput Oper Res 34: 2080\u20132095","journal-title":"Comput Oper Res"},{"key":"118_CR19","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christofides","year":"1984","unstructured":"Christofides N, Beasley JE (1984) The period routing problem. Networks 14: 237\u2013256","journal-title":"Networks"},{"key":"118_CR20","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. Oper Res Q 20: 309\u2013318","journal-title":"Oper Res Q"},{"key":"118_CR21","first-page":"30","volume-title":"Logistics: where ends have to meet","author":"N Christofides","year":"1989","unstructured":"Christofides N, Mingozzi A (1989) Vehicle routing: practical and algorithmic aspects. In: van Rijn CFH (eds) Logistics: where ends have to meet. Pergamon Press, New York, pp 30\u201348"},{"key":"118_CR22","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp 315\u2013338"},{"key":"118_CR23","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"10","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981a) Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxation. Math Program 10: 255\u2013280","journal-title":"Math Program"},{"key":"118_CR24","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981b) State-space relaxation procedures for the computation of bounds to routing problems. Networks 11: 145\u2013164","journal-title":"Networks"},{"issue":"20","key":"118_CR25","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981c) Exact algorithms for the vehicle routing problem based on spanning tree and shortest path relaxations. Math Program 20(20): 255\u2013282","journal-title":"Math Program"},{"key":"118_CR26","first-page":"367","volume-title":"Transportation, handbooks in operations research and management science, vol 14","author":"J-F Cordeau","year":"2007","unstructured":"Cordeau J-F, Laporte G, Savelsbergh MWP, Vigo D (2007) Vehicle routing. In: Barnhart C, Laporte G (eds) Transportation, handbooks in operations research and management science, vol 14. Elsevier, Amsterdam, pp 367\u2013428"},{"key":"118_CR27","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/978-0-387-77778-8_15","volume-title":"The vehicle routing problem: latest advances and new challenges, vol 43","author":"J-F Cordeau","year":"2008","unstructured":"Cordeau J-F, Laporte G, Ropke S (2008) Recent models and algorithms for one-to-one pickup and delivery problems. In: Golden B, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin, pp 327\u2013357"},{"key":"118_CR28","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B Crevier","year":"2007","unstructured":"Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176: 756\u2013773","journal-title":"Eur J Oper Res"},{"issue":"3","key":"118_CR29","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3): 387\u2013404","journal-title":"Transp Sci"},{"issue":"2","key":"118_CR30","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle-routing problem with time windows. Oper Res 40(2): 342\u2013354","journal-title":"Oper Res"},{"issue":"1","key":"118_CR31","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1016\/0377-2217(91)90319-Q","volume":"54","author":"Y Dumas","year":"1991","unstructured":"Dumas Y, Desrosiers J, Soumis F (1991) The pickup and delivery problem with time windows. Eur J Oper Res 54(1): 7\u201322","journal-title":"Eur J Oper Res"},{"key":"118_CR32","volume-title":"The vehicle routing problem: latest advances and new challenges, vol 43","author":"PM Francis","year":"2008","unstructured":"Francis PM, Smilowitz KR, Tzur M (2008) The period vehicle routing problem and its extensions. In: Golden BL, Raghavan S, Wasil E (eds) The vehicle routing problem: latest advances and new challenges, vol 43. Springer, Berlin"},{"key":"118_CR33","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R Fukasawa","year":"2006","unstructured":"Fukasawa R, Longo H, Lysgaard J, Poggide Arag\u00e3o M, Reis M, Uchoa E, Werneck RF (2006) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Math Program Ser A 106: 491\u2013511","journal-title":"Math Program Ser A"},{"key":"118_CR34","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The vehicle routing problemm, vol 9","author":"M Gendreau","year":"2002","unstructured":"Gendreau M, Laporte G, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problemm, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 129\u2013154"},{"issue":"2","key":"118_CR35","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1287\/opre.1070.0449","volume":"56","author":"M Jepsen","year":"2008","unstructured":"Jepsen M, Petersen B, Spoorendonk S, Pisinger D (2008) Subset-row inequalities applied to the vehicle-routing problem with time windows. Oper Res 56(2): 497\u2013511","journal-title":"Oper Res"},{"key":"118_CR36","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1137\/1.9780898718515.ch5","volume-title":"The vehicle routing problem, vol 9","author":"G Laporte","year":"2002","unstructured":"Laporte G, Semet F (2002) Classical heuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem, vol 9. SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, pp 109\u2013128"},{"key":"118_CR37","first-page":"283","volume":"44","author":"G Laporte","year":"1984","unstructured":"Laporte G, Nobert Y, Arpin D (1984) Optimal solutions to capacitated multi depot vehicle routing problems. Congressus Numerantium 44: 283\u2013292","journal-title":"Congressus Numerantium"},{"key":"118_CR38","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1287\/trsc.22.3.161","volume":"22","author":"G Laporte","year":"1988","unstructured":"Laporte G, Nobert Y, Taillefer S (1988) Solving a family of multi-depot vehicle routing and location-routing problems. Transp Sci 22: 161\u2013172","journal-title":"Transp Sci"},{"key":"118_CR39","doi-asserted-by":"crossref","unstructured":"Li H, Lim A (2001) A metaheuristic for the pickup and delivery problem with time windows. In: 13th IEEE international conference on tools with artificial intelligence, ICTAI-2001, Dallas, USA","DOI":"10.1109\/ICTAI.2001.974461"},{"issue":"4","key":"118_CR40","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1287\/trsc.1030.0040","volume":"38","author":"Q Lu","year":"2004","unstructured":"Lu Q, Dessouky M (2004) An exact algorithm for the multiple vehicle pickup and delivery problem. Transp Sci 38(4): 503\u2013514","journal-title":"Transp Sci"},{"key":"118_CR41","unstructured":"Lysgaard J (2003) CVRPSEP: a package of separation routines for the capacitated vehicle routing problem. Technical report, Dept. of Mgt. Science and Logistics, Aarhus School of Business"},{"key":"118_CR42","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 Ser A 100: 423\u2013445","journal-title":"Math Program Ser A"},{"key":"118_CR43","unstructured":"Mingozzi A, Christofides N, Hadjiconstantinou EA (1994) An exact algorithm for the vehicle routing problem based on the set partitioning formulation. Technical report, University of Bologna"},{"issue":"3","key":"118_CR44","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1287\/trsc.33.3.315","volume":"33","author":"A Mingozzi","year":"1999","unstructured":"Mingozzi A, Giorgi S, Baldacci R (1999) An exact method for the vehicle routing problem with backhauls. Transp Sci 33(3): 315\u2013329","journal-title":"Transp Sci"},{"issue":"2","key":"118_CR45","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1051\/ro:2006015","volume":"40","author":"M Mourgaya","year":"2006","unstructured":"Mourgaya M, Vanderbeck F (2006) The periodic vehicle routing problem: classification and heuristic. Rairo-Oper Res 40(2): 169\u2013194","journal-title":"Rairo-Oper Res"},{"key":"118_CR46","unstructured":"Niskanen S, \u00d6sterg\u00e5rd PRJ (2003) Cliquer user\u2019s guide. Technical Report 48, Helsinki University of Technology Communications Laboratory"},{"key":"118_CR47","doi-asserted-by":"crossref","first-page":"81","DOI":"10.1007\/s11301-008-0036-4","volume":"51","author":"SN Parragh","year":"2008","unstructured":"Parragh SN, Doerner KF, Hartl RF (2008) A survey on pickup and delivery problems part II: transportation between pickup and delivery locations. J Betriebswirtschaft 51:81\u2013117","journal-title":"J Betriebswirtschaft"},{"key":"118_CR48","first-page":"150","volume-title":"A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Lecture notes in computer science, vol 4525","author":"A Pessoa","year":"2007","unstructured":"Pessoa A, Poggi de Arag\u00e3o M, Uchoa E (2007) A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Lecture notes in computer science, vol 4525. Springer, Berlin, pp 150\u2013160"},{"key":"118_CR49","doi-asserted-by":"crossref","unstructured":"Ropke S, Cordeau J-F (2009) Branch-and-cut-and-price for the pickup and delivery problem with time windows. Transp Sci (Forthcoming)","DOI":"10.1287\/trsc.1090.0272"},{"issue":"4","key":"118_CR50","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1002\/net.20177","volume":"49","author":"S Ropke","year":"2007","unstructured":"Ropke S, Cordeau JF, Laporte G (2007) Models and branch-and-cut algorithms for pickup and delivery problems with time windows. Networks 49(4): 258\u2013272","journal-title":"Networks"},{"key":"118_CR51","doi-asserted-by":"crossref","first-page":"747","DOI":"10.1002\/net.3230210704","volume":"21","author":"RA Russel","year":"1991","unstructured":"Russel RA, Gribbin D (1991) A multiphase approach to the period routing problem. Networks 21: 747\u2013765","journal-title":"Networks"},{"key":"118_CR52","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230090102","volume":"9","author":"RA Russel","year":"1979","unstructured":"Russel RA, Igo W (1979) An assignment routing problem. Networks 9: 1\u201317","journal-title":"Networks"},{"issue":"4","key":"118_CR53","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"MWP Savelsbergh","year":"1998","unstructured":"Savelsbergh MWP, Sol M (1998) Drive: dynamic routing of independent vehicles. Oper Res 46(4): 474\u2013490","journal-title":"Oper Res"},{"key":"118_CR54","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with the time window constraints. Oper Res 35: 254\u2013265","journal-title":"Oper Res"},{"key":"118_CR55","doi-asserted-by":"crossref","unstructured":"Toth, P, Vigo, D (eds) (2002) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia","DOI":"10.1137\/1.9780898718515"}],"container-title":["Computational Management Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-009-0118-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10287-009-0118-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10287-009-0118-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:48Z","timestamp":1559131968000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10287-009-0118-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,1,1]]},"references-count":55,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2010,7]]}},"alternative-id":["118"],"URL":"https:\/\/doi.org\/10.1007\/s10287-009-0118-3","relation":{},"ISSN":["1619-697X","1619-6988"],"issn-type":[{"value":"1619-697X","type":"print"},{"value":"1619-6988","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,1,1]]}}}