{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T03:06:15Z","timestamp":1782183975949,"version":"3.54.5"},"reference-count":87,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T00:00:00Z","timestamp":1510444800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100000038","name":"Natural Sciences and Engineering Research Council of Canada","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["OR Spectrum"],"published-print":{"date-parts":[[2018,1]]},"DOI":"10.1007\/s00291-017-0494-y","type":"journal-article","created":{"date-parts":[[2017,11,12]],"date-time":"2017-11-12T01:39:31Z","timestamp":1510450771000},"page":"125-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":25,"title":["Alternative formulations and improved bounds for the multi-depot fleet size and mix vehicle routing problem"],"prefix":"10.1007","volume":"40","author":[{"given":"Rahma","family":"Lahyani","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9797-1019","authenticated-orcid":false,"given":"Leandro C.","family":"Coelho","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3876-5378","authenticated-orcid":false,"given":"Jacques","family":"Renaud","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2017,11,12]]},"reference":[{"issue":"5","key":"494_CR1","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1007\/s00170-014-6141-8","volume":"75","author":"M Adelzadeh","year":"2014","unstructured":"Adelzadeh M, Asl V, Koosha M (2014) A mathematical model and a solving procedure for multi-depot vehicle routing problem with fuzzy time window and heterogeneous vehicle. Int J Adv Manuf Technol 75(5):793\u2013802","journal-title":"Int J Adv Manuf Technol"},{"issue":"1","key":"494_CR2","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1287\/ijoc.2013.0550","volume":"26","author":"Y Adulyasak","year":"2013","unstructured":"Adulyasak Y, Cordeau JF, Jans R (2013) Formulations and branch-and-cut algorithms for multivehicle production and inventory routing problems. INFORMS J Comput 26(1):103\u2013120","journal-title":"INFORMS J Comput"},{"issue":"9","key":"494_CR3","doi-asserted-by":"crossref","first-page":"1515","DOI":"10.1016\/j.cor.2009.11.009","volume":"37","author":"H Andersson","year":"2010","unstructured":"Andersson H, Hoff A, Christiansen M, Hasle G, L\u00f8kketangen A (2010) Industrial aspects and literature survey: combined inventory management and routing. Comput Oper Res 37(9):1515\u20131536","journal-title":"Comput Oper Res"},{"key":"494_CR4","volume-title":"The traveling salesman problem: a computational study","author":"DL Applegate","year":"2011","unstructured":"Applegate DL, Bixby RE, Chv\u00e1tal V, Cook WJ (2011) The traveling salesman problem: a computational study. Princeton University Press, Princeton"},{"key":"494_CR5","unstructured":"Araque JR, Hall LA, Magnanti TL (1990) Capacitated trees, capacitated routing, and associated polyhedra. Massachusetts Institute of Technology, Operations Research Center"},{"key":"494_CR6","unstructured":"Augerat P (1995) Approche poly\u00e8drale du probl\u00e8me de tourn\u00e9es de v\u00e9hicules. Ph.D. thesis, Institut National Polytechnique de Grenoble\u2014INPG"},{"issue":"2","key":"494_CR7","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 120(2):347\u2013380","journal-title":"Math Program"},{"key":"494_CR8","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/978-0-387-77778-8_1","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"R Baldacci","year":"2008","unstructured":"Baldacci R, Battarra M, Vigo D (2008) Routing a heterogeneous fleet of vehicles. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 3\u201327"},{"issue":"3","key":"494_CR9","doi-asserted-by":"crossref","first-page":"820","DOI":"10.1016\/j.ejor.2013.07.038","volume":"236","author":"T Bekta\u015f","year":"2014","unstructured":"Bekta\u015f T, Gouveia L (2014) Requiem for the Miller\u2013Tucker\u2013Zemlin subtour elimination constraints? Eur J Oper Res 236(3):820\u2013832","journal-title":"Eur J Oper Res"},{"issue":"5","key":"494_CR10","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.trc.2010.07.008","volume":"19","author":"A Bettinelli","year":"2011","unstructured":"Bettinelli A, Ceselli A, Righini G (2011) A branch-and-cut-and-price algorithm for the multi-depot heterogeneous vehicle routing problem with time windows. Transp Res Part C Emerg Technol 19(5):723\u2013740","journal-title":"Transp Res Part C Emerg Technol"},{"key":"494_CR11","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/0-387-28356-0_3","volume-title":"Search methodologies","author":"R Bosch","year":"2005","unstructured":"Bosch R, Trick M (2005) Integer programming. In: Burke EK, Kendall G (eds) Search methodologies. Springer, London, pp 69\u201395"},{"issue":"1","key":"494_CR12","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1016\/0377-2217(91)90337-U","volume":"52","author":"V Campos","year":"1991","unstructured":"Campos V, Corberan A, Mota E (1991) Polyhedral results for a vehicle routing problem. Eur J Oper Res 52(1):75\u201385","journal-title":"Eur J Oper Res"},{"issue":"5","key":"494_CR13","doi-asserted-by":"crossref","first-page":"531","DOI":"10.1002\/net.3230190505","volume":"19","author":"G Carpaneto","year":"1989","unstructured":"Carpaneto G, Dell\u2019Amico M, Fischetti M, Toth P (1989) A branch and bound algorithm for the multiple depot vehicle scheduling problem. Networks 19(5):531\u2013548","journal-title":"Networks"},{"issue":"3\u20134","key":"494_CR14","first-page":"371","volume":"13","author":"IM Chao","year":"1993","unstructured":"Chao IM, Golden BL, Wasil EA (1993) A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions. Am J Math Manage Sci 13(3\u20134):371\u2013406","journal-title":"Am J Math Manage Sci"},{"issue":"2","key":"494_CR15","doi-asserted-by":"crossref","first-page":"558","DOI":"10.1016\/j.cor.2012.08.012","volume":"40","author":"LC Coelho","year":"2013","unstructured":"Coelho LC, Laporte G (2013) The exact solution of several classes of inventory-routing problems. Comput Oper Res 40(2):558\u2013565","journal-title":"Comput Oper Res"},{"key":"494_CR16","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/j.ijpe.2013.11.019","volume":"155","author":"LC Coelho","year":"2014","unstructured":"Coelho LC, Laporte G (2014) Improved solutions for inventory-routing problems through valid inequalities and input ordering. Int J Prod Econ 155:391\u2013397","journal-title":"Int J Prod Econ"},{"issue":"2","key":"494_CR17","first-page":"79","volume":"54","author":"LC Coelho","year":"2016","unstructured":"Coelho LC, Renaud J, Laporte G (2016) Road-based goods transportation: a survey of real-world applications from 2000 to 2015. Inf Syst Oper Res 54(2):79\u201396","journal-title":"Inf Syst Oper Res"},{"key":"494_CR18","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discrete Optim 12:129\u2013146","journal-title":"Discrete Optim"},{"issue":"1","key":"494_CR19","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1287\/ijoc.2013.0549","volume":"26","author":"C Contardo","year":"2013","unstructured":"Contardo C, Cordeau JF, Gendron B (2013) An exact algorithm based on cut-and-column generation for the capacitated location-routing problem. INFORMS J Comput 26(1):88\u2013102","journal-title":"INFORMS J Comput"},{"issue":"1\u20133","key":"494_CR20","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/BF01580599","volume":"60","author":"G Cornu\u00e9jols","year":"1993","unstructured":"Cornu\u00e9jols G, Harche F (1993) Polyhedral study of the capacitated vehicle routing problem. Math Program 60(1\u20133):21\u201352","journal-title":"Math Program"},{"key":"494_CR21","first-page":"393","volume":"2","author":"G Dantzig","year":"1954","unstructured":"Dantzig G, Fulkerson R, Johnson S (1954) Solution of a large-scale traveling-salesman problem. J Oper Res Soc Am 2:393\u2013410","journal-title":"J Oper Res Soc Am"},{"issue":"4","key":"494_CR22","doi-asserted-by":"crossref","first-page":"885","DOI":"10.1007\/s00291-010-0194-3","volume":"33","author":"U Derigs","year":"2011","unstructured":"Derigs U, Gottlieb J, Kalkoff J, Piesche M, Rothlauf F, Vogel U (2011) Vehicle routing with compartments: applications, modeling and heuristics. OR Spectr 33(4):885\u2013914","journal-title":"OR Spectr"},{"issue":"1","key":"494_CR23","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s12159-010-0028-3","volume":"2","author":"J Euchi","year":"2010","unstructured":"Euchi J, Chabchoub H (2010) A hybrid tabu search to solve the heterogeneous fixed fleet vehicle routing problem. Logist Res 2(1):3\u201311","journal-title":"Logist Res"},{"issue":"4","key":"494_CR24","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1287\/mnsc.3.4.407","volume":"3","author":"WM Garvin","year":"1957","unstructured":"Garvin WM, Crandall HW, John JB, Spellman RA (1957) Applications of linear programming in the oil industry. Manage Sci 3(4):407\u2013430","journal-title":"Manage Sci"},{"key":"494_CR25","volume-title":"Scheduling and routing in transportation and distribution systems: formulations and new relaxations","author":"B Gavish","year":"1982","unstructured":"Gavish B, Graves S (1982) Scheduling and routing in transportation and distribution systems: formulations and new relaxations. Graduate School of Management, University of Rochester, Rochester"},{"issue":"4","key":"494_CR26","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.45.4.568","volume":"45","author":"M Gendreau","year":"1997","unstructured":"Gendreau M, Laporte G, Semet F (1997) The covering tour problem. Oper Res 45(4):568\u2013576","journal-title":"Oper Res"},{"key":"494_CR27","unstructured":"Gendron B, Crainic TG (1994) Relaxations for multicommodity capacitated network design problems. Technical Report CRT-965, Centre de Recherche sur les Transports, Montreal"},{"issue":"4","key":"494_CR28","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1007\/BF01720070","volume":"6","author":"F Gheysens","year":"1984","unstructured":"Gheysens F, Golden B, Assad A (1984) A comparison of techniques for solving the fleet size and mix vehicle routing problem. OR Spectr 6(4):207\u2013216","journal-title":"OR Spectr"},{"issue":"6","key":"494_CR29","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","volume":"4","author":"BE Gillett","year":"1976","unstructured":"Gillett BE, Johnson JG (1976) Multi-terminal vehicle-dispatch algorithm. Omega 4(6):711\u2013718","journal-title":"Omega"},{"issue":"2","key":"494_CR30","doi-asserted-by":"crossref","first-page":"350","DOI":"10.1016\/j.disopt.2007.05.001","volume":"5","author":"MT Godinho","year":"2008","unstructured":"Godinho MT, Gouveia L, Magnanti TL (2008) Combined route capacity and route length models for unit demand vehicle routing problems. Discrete Optim 5(2):350\u2013372","journal-title":"Discrete Optim"},{"issue":"2","key":"494_CR31","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1002\/net.3230070203","volume":"7","author":"B Golden","year":"1977","unstructured":"Golden B, Magnanti T, Nguyen H (1977) Implementing vehicle routing algorithms. Networks 7(2):113\u2013148","journal-title":"Networks"},{"issue":"1","key":"494_CR32","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0305-0548(84)90007-8","volume":"11","author":"B Golden","year":"1984","unstructured":"Golden B, Assad A, Levy L, Gheysens F (1984) The fleet size and mix vehicle routing problem. Comput Oper Res 11(1):49\u201366","journal-title":"Comput Oper Res"},{"issue":"1","key":"494_CR33","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1287\/opre.43.1.130","volume":"43","author":"L Gouveia","year":"1995","unstructured":"Gouveia L (1995a) A 2n constraint formulation for the capacitated minimal spanning tree problem. Oper Res 43(1):130\u2013141","journal-title":"Oper Res"},{"issue":"3","key":"494_CR34","doi-asserted-by":"crossref","first-page":"610","DOI":"10.1016\/0377-2217(94)00025-8","volume":"85","author":"L Gouveia","year":"1995","unstructured":"Gouveia L (1995b) A result on projection for the vehicle routing problem. Eur J Oper Res 85(3):610\u2013624","journal-title":"Eur J Oper Res"},{"issue":"3","key":"494_CR35","doi-asserted-by":"crossref","first-page":"294","DOI":"10.1016\/j.orl.2013.03.001","volume":"41","author":"L Gouveia","year":"2013","unstructured":"Gouveia L, Salazar-Gonz\u00e1lez JJ (2013) Polynomial-time separation of enhanced reverse multistar inequalities. Oper Res Lett 41(3):294\u2013297","journal-title":"Oper Res Lett"},{"issue":"4","key":"494_CR36","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1002\/net.21481","volume":"61","author":"L Gouveia","year":"2013","unstructured":"Gouveia L, Riera-Ledesma J, Salazar-Gonz\u00e1lez JJ (2013) Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route. Networks 61(4):309\u2013321","journal-title":"Networks"},{"key":"494_CR37","series-title":"MOS-SIAM series on optimization","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1137\/1.9781611973594.ch9","volume-title":"Vehicle routing: problems, methods, and applications","author":"S Irnich","year":"2014","unstructured":"Irnich S, Schneider M, Vigo D (2014a) Four variants of the vehicle routing problem. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia, pp 241\u2013260"},{"key":"494_CR38","series-title":"MOS-SIAM series on optimization","first-page":"1","volume-title":"Vehicle routing: problems, methods, and applications","author":"S Irnich","year":"2014","unstructured":"Irnich S, Toth P, Vigo D (2014b) The family of vehicle routing problems. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia, pp 1\u201323"},{"issue":"3","key":"494_CR39","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1287\/trsc.2014.0575","volume":"49","author":"SD Jena","year":"2015","unstructured":"Jena SD, Cordeau JF, Gendron B (2015a) Dynamic facility location with generalized modular capacities. Transp Sci 49(3):484\u2013499","journal-title":"Transp Sci"},{"issue":"1","key":"494_CR40","first-page":"151","volume":"232","author":"SD Jena","year":"2015","unstructured":"Jena SD, Cordeau JF, Gendron B (2015b) Modeling and solving a logging camp location problem. Ann Oper Res 232(1):151\u2013177","journal-title":"Ann Oper Res"},{"key":"494_CR41","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1016\/j.asoc.2014.03.012","volume":"21","author":"A Juan","year":"2014","unstructured":"Juan A, Goentzel J, Bekta\u015f T (2014) Routing fleets with multiple driving ranges: is it possible to use greener fleet configurations? Appl Soft Comput 21:84\u201394","journal-title":"Appl Soft Comput"},{"key":"494_CR42","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","volume":"27","author":"S Karakati\u010d","year":"2015","unstructured":"Karakati\u010d S, Podgorelec V (2015) A survey of genetic algorithms for solving multi depot vehicle routing problem. Appl Soft Comput 27:519\u2013532","journal-title":"Appl Soft Comput"},{"issue":"4","key":"494_CR43","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1016\/j.omega.2011.09.002","volume":"40","author":"I Karaoglan","year":"2012","unstructured":"Karaoglan I, Altiparmak F, Kara I, Dengiz B (2012) The location-routing problem with simultaneous pickup and delivery: formulations and a heuristic approach. Omega 40(4):465\u2013477","journal-title":"Omega"},{"key":"494_CR44","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/j.cor.2015.05.004","volume":"64","author":"\u00c7 Ko\u00e7","year":"2015","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2015) A hybrid evolutionary algorithm for heterogeneous fleet vehicle routing problems with time windows. Comput Oper Res 64:11\u201327","journal-title":"Comput Oper Res"},{"issue":"1","key":"494_CR45","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1016\/j.ejor.2015.06.082","volume":"248","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2016a) The fleet size and mix location-routing problem with time windows: formulations and a heuristic algorithm. Eur J Oper Res 248(1):33\u201351","journal-title":"Eur J Oper Res"},{"issue":"1","key":"494_CR46","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2015.07.020","volume":"249","author":"\u00c7 Ko\u00e7","year":"2016","unstructured":"Ko\u00e7 \u00c7, Bekta\u015f T, Jabali O, Laporte G (2016b) Thirty years of heterogeneous vehicle routing. Eur J Oper Res 249(1):1\u201321","journal-title":"Eur J Oper Res"},{"issue":"1","key":"494_CR47","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/0377-2217(85)90284-X","volume":"20","author":"R Kulkami","year":"1985","unstructured":"Kulkami R, Bhave P (1985) Integer programming formulations of vehicle routing problems. Eur J Oper Res 20(1):58\u201367","journal-title":"Eur J Oper Res"},{"key":"494_CR48","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.omega.2014.08.007","volume":"51","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Coelho LC, Khemakhem M, Laporte G, Semet F (2015a) A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia. Omega 51:1\u201310","journal-title":"Omega"},{"issue":"1","key":"494_CR49","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.07.048","volume":"241","author":"R Lahyani","year":"2015","unstructured":"Lahyani R, Khemakhem M, Semet F (2015b) Rich vehicle routing problems: from a taxonomy to a definition. Eur J Oper Res 241(1):1\u201314","journal-title":"Eur J Oper Res"},{"issue":"1","key":"494_CR50","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1007\/s00291-015-0408-9","volume":"38","author":"E Lalla-Ruiz","year":"2015","unstructured":"Lalla-Ruiz E, Exp\u00f3sito-Izquierdo C, Taheripour S, Vo\u00df S (2015) An improved formulation for the multi-depot open vehicle routing problem. OR Spectr 38(1):175\u2013187","journal-title":"OR Spectr"},{"issue":"5","key":"494_CR51","doi-asserted-by":"crossref","first-page":"509","DOI":"10.1057\/jors.1986.86","volume":"37","author":"G Laporte","year":"1986","unstructured":"Laporte G (1986) Generalized subtour elimination constraints and connectivity constraints. J Oper Res Soc 37(5):509\u2013514","journal-title":"J Oper Res Soc"},{"issue":"4","key":"494_CR52","doi-asserted-by":"crossref","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G Laporte","year":"2009","unstructured":"Laporte G (2009) Fifty years of vehicle routing. Transp Sci 43(4):408\u2013416","journal-title":"Transp Sci"},{"key":"494_CR53","first-page":"271","volume":"51","author":"G Laporte","year":"1984","unstructured":"Laporte G, Nobert Y (1984) Comb inequalities for the vehicle routing problem. Methods OR 51:271\u2013276","journal-title":"Methods OR"},{"key":"494_CR54","series-title":"North-Holland, North-Holland mathematics studies","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/S0304-0208(08)73235-3","volume-title":"Surveys in combinatorial optimization","author":"G Laporte","year":"1987","unstructured":"Laporte G, Nobert Y (1987) Exact algorithms for the vehicle routing problem. In: Martello S, Laporte G, Minoux M, Ribeiro C (eds) Surveys in combinatorial optimization. North-Holland, North-Holland mathematics studies. Elsevier, Amsterdam, pp 147\u2013184"},{"issue":"2\u20133","key":"494_CR55","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1007\/s10107-005-0652-x","volume":"105","author":"AN Letchford","year":"2006","unstructured":"Letchford AN, Salazar-Gonz\u00e1lez JJ (2006) Projection results for vehicle routing. Math Program 105(2\u20133):251\u2013274","journal-title":"Math Program"},{"issue":"1","key":"494_CR56","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1007\/s10107-002-0336-8","volume":"94","author":"AN Letchford","year":"2002","unstructured":"Letchford AN, Eglese RW, Lysgaard J (2002) Multistars, partial multistars and the capacitated vehicle routing problem. Math Program 94(1):21\u201340","journal-title":"Math Program"},{"key":"494_CR57","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/j.tre.2013.03.010","volume":"54","author":"S Liu","year":"2013","unstructured":"Liu S (2013) A hybrid population heuristic for the heterogeneous vehicle routing problems. Transp Res Part E Logist Transp Rev 54:67\u201378","journal-title":"Transp Res Part E Logist Transp Rev"},{"issue":"2","key":"494_CR58","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1007\/s00291-012-0289-0","volume":"36","author":"R Liu","year":"2014","unstructured":"Liu R, Jiang Z, Geng N (2014) A hybrid genetic algorithm for the multi-depot open vehicle routing problem. OR Spectr 36(2):401\u2013421","journal-title":"OR Spectr"},{"issue":"2","key":"494_CR59","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(2):423\u2013445","journal-title":"Math Program"},{"key":"494_CR60","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.trc.2015.06.016","volume":"70","author":"S Mancini","year":"2016","unstructured":"Mancini S (2016) A real-life multi depot multi period vehicle routing problem with a heterogeneous fleet: formulation and adaptive large neighborhood search based matheuristic. Transp Res Part C Emerg Technol 70:100\u2013112","journal-title":"Transp Res Part C Emerg Technol"},{"issue":"4","key":"494_CR61","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller CE, Tucker AW, Zemlin RA (1960) Integer programming formulation of traveling salesman problems. J Assoc Comput Mach 7(4):326\u2013329","journal-title":"J Assoc Comput Mach"},{"key":"494_CR62","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","volume":"79","author":"JR Montoya-Torres","year":"2015","unstructured":"Montoya-Torres JR, Franco JL, Isaza SN, Jim\u00e9nez HF, Herazo-Padilla N (2015) A literature review on the vehicle routing problem with multiple depots. Comput Ind Eng 79:115\u2013129","journal-title":"Comput Ind Eng"},{"key":"494_CR63","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1137\/1.9780898718515.ch3","volume-title":"The vehicle routing problem","author":"D Naddef","year":"2002","unstructured":"Naddef D, Rinaldi G (2002) Branch-and-cut algorithms for the capacitated vehicle routing problem. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia, pp 53\u201384"},{"issue":"1","key":"494_CR64","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1137\/1033004","volume":"33","author":"MW Padberg","year":"1991","unstructured":"Padberg MW, Rinaldi G (1991) A branch-and-cut algorithm for the resolution of large-scale symmetric traveling salesman problems. SIAM Rev 33(1):60\u2013100","journal-title":"SIAM Rev"},{"issue":"5","key":"494_CR65","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0191-2615(85)90052-9","volume":"19","author":"J Perl","year":"1985","unstructured":"Perl J, Daskin MS (1985) A warehouse location-routing problem. Transp Res Part B Methodol 19(5):381\u2013396","journal-title":"Transp Res Part B Methodol"},{"key":"494_CR66","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1007\/978-0-387-77778-8_14","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"A Pessoa","year":"2008","unstructured":"Pessoa A, Poggi de Arag\u00e3o MVS, Uchoa E (2008) Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden BL, Raghavan S, Wasil EA (eds) The vehicle routing problem: latest advances and new challenges. Springer, New York, pp 297\u2013325"},{"issue":"4","key":"494_CR67","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1002\/net.20330","volume":"54","author":"A Pessoa","year":"2009","unstructured":"Pessoa A, Uchoa E, Poggi de Arag\u00e3o MVS (2009) A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Networks 54(4):167\u2013177","journal-title":"Networks"},{"key":"494_CR68","doi-asserted-by":"crossref","unstructured":"Pessoa A, Poggi de Arag\u00e3o MVS, Uchoa E (2007) A robust branch-cut-and-price algorithm for the heterogeneous fleet vehicle routing problem. Lecture Notes in Computer Science, vol. 4525, pp. 150\u2013160","DOI":"10.1007\/978-3-540-72845-0_12"},{"issue":"1","key":"494_CR69","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"JC Picard","year":"1978","unstructured":"Picard JC, Queyranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86\u2013110","journal-title":"Oper Res"},{"issue":"8","key":"494_CR70","doi-asserted-by":"crossref","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger D, Ropke S (2007) A general heuristic for the vehicle routing problem. Comput Oper Res 34(8):2403\u20132435","journal-title":"Comput Oper Res"},{"key":"494_CR71","series-title":"MOS-SIAM series on optimization","first-page":"59","volume-title":"Vehicle routing: problems, methods, and applications","author":"MVS Poggi de Arag\u00e3o","year":"2014","unstructured":"Poggi de Arag\u00e3o MVS, Uchoa E (2014) New exact algorithms for the capacitated vehicle routing problem. In: Toth P, Vigo D (eds) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia, pp 59\u201386"},{"issue":"6","key":"494_CR72","doi-asserted-by":"crossref","first-page":"916","DOI":"10.1016\/j.engappai.2008.10.006","volume":"22","author":"C Prins","year":"2009","unstructured":"Prins C (2009) Two memetic algorithms for heterogeneous fleet vehicle routing problems. Eng Appl Artif Intell 22(6):916\u2013928","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"494_CR73","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.ejor.2014.01.005","volume":"238","author":"C Prodhon","year":"2014","unstructured":"Prodhon C, Prins C (2014) A survey of recent research on location-routing problems. Eur J Oper Res 238(1):1\u201317","journal-title":"Eur J Oper Res"},{"issue":"2","key":"494_CR74","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/trsc.2014.0524","volume":"49","author":"Y Qu","year":"2014","unstructured":"Qu Y, Bard J (2014) A branch-and-price-and-cut algorithm for heterogeneous pickup and delivery problems with configurable vehicle capacity. Transp Sci 49(2):254\u2013270","journal-title":"Transp Sci"},{"key":"494_CR75","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1016\/j.cor.2014.07.004","volume":"53","author":"A Rahimi-Vahed","year":"2015","unstructured":"Rahimi-Vahed A, Crainic TG, Gendreau M, Rei W (2015) Fleet-sizing for multi-depot and periodic vehicle routing problems using a modular heuristic algorithm. Comput Oper Res 53:9\u201323","journal-title":"Comput Oper Res"},{"issue":"2","key":"494_CR76","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1007\/s00291-016-0464-9","volume":"39","author":"O Saka","year":"2017","unstructured":"Saka O, G\u00fcrel S, Van Woensel T (2017) Using cost change estimates in a local search heuristic for the pollution routing problem. OR Spectr 39(2):557\u2013587","journal-title":"OR Spectr"},{"issue":"3","key":"494_CR77","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1016\/0377-2217(93)90220-H","volume":"66","author":"S Salhi","year":"1993","unstructured":"Salhi S, Rand GK (1993) Incorporating vehicle routing into the vehicle fleet composition problem. Eur J Oper Res 66(3):313\u2013330","journal-title":"Eur J Oper Res"},{"issue":"1","key":"494_CR78","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0377-2217(96)00253-6","volume":"103","author":"S Salhi","year":"1997","unstructured":"Salhi S, Sari M (1997) A multi-level composite heuristic for the multi-depot vehicle fleet mix problem. Eur J Oper Res 103(1):95\u2013112","journal-title":"Eur J Oper Res"},{"key":"494_CR79","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/j.cor.2013.05.011","volume":"52","author":"S Salhi","year":"2014","unstructured":"Salhi S, Imran A, Wassan NA (2014) The multi-depot vehicle routing problem with heterogeneous vehicle fleet: formulation and a variable neighborhood search implementation. Comput Oper Res 52:315\u2013325","journal-title":"Comput Oper Res"},{"issue":"10","key":"494_CR80","doi-asserted-by":"crossref","first-page":"1396","DOI":"10.1287\/mnsc.47.10.1396.10265","volume":"47","author":"HD Sherali","year":"2001","unstructured":"Sherali HD, Smith JC (2001) Improving discrete model representations via symmetry considerations. Manage Sci 47(10):1396\u20131407","journal-title":"Manage Sci"},{"issue":"4","key":"494_CR81","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/08839510151087293","volume":"15","author":"S Thangiah","year":"2001","unstructured":"Thangiah S, Salhi S (2001) Genetic clustering: an adaptive heuristic for the multidepot vehicle routing problem. Appl Artif Intell 15(4):361\u2013383","journal-title":"Appl Artif Intell"},{"key":"494_CR82","series-title":"SIAM monographs on discrete mathematics and applications","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1137\/1.9780898718515","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) An overview of vehicle routing problems. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM monographs on discrete mathematics and applications. SIAM, Philadelphia, pp 1\u201326"},{"key":"494_CR83","series-title":"MOS-SIAM series on optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973594","volume-title":"Vehicle routing: problems, methods, and applications","author":"P Toth","year":"2014","unstructured":"Toth P, Vigo D (2014) Vehicle routing: problems, methods, and applications. MOS-SIAM series on optimization. SIAM, Philadelphia"},{"issue":"3","key":"494_CR84","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","volume":"60","author":"T Vidal","year":"2012","unstructured":"Vidal T, Crainic T, Gendreau M, Lahrichi N, Rei W (2012) A hybrid genetic algorithm for multidepot and periodic vehicle routing problems. Oper Res 60(3):611\u2013624","journal-title":"Oper Res"},{"issue":"1","key":"494_CR85","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ejor.2013.12.044","volume":"237","author":"T Vidal","year":"2014","unstructured":"Vidal T, Crainic TG, Gendreau M, Prins C (2014) Implicit depot assignments and rotations in vehicle routing heuristics. Eur J Oper Res 237(1):15\u201328","journal-title":"Eur J Oper Res"},{"issue":"3","key":"494_CR86","doi-asserted-by":"crossref","first-page":"299","DOI":"10.14257\/ijca.2014.7.3.29","volume":"7","author":"Y Xu","year":"2014","unstructured":"Xu Y, Jiang W (2014) An improved variable neighborhood search algorithm for multi depot heterogeneous vehicle routing problem based on hybrid operators. Int J Control Autom 7(3):299\u2013316","journal-title":"Int J Control Autom"},{"issue":"2","key":"494_CR87","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H Yaman","year":"2006","unstructured":"Yaman H (2006) Formulations and valid inequalities for the heterogeneous vehicle routing problem. Math Program 106(2):365\u2013390","journal-title":"Math Program"}],"container-title":["OR Spectrum"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00291-017-0494-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-017-0494-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00291-017-0494-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,25]],"date-time":"2018-01-25T11:56:27Z","timestamp":1516881387000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00291-017-0494-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,12]]},"references-count":87,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2018,1]]}},"alternative-id":["494"],"URL":"https:\/\/doi.org\/10.1007\/s00291-017-0494-y","relation":{},"ISSN":["0171-6468","1436-6304"],"issn-type":[{"value":"0171-6468","type":"print"},{"value":"1436-6304","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,11,12]]}}}