{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,29]],"date-time":"2026-03-29T17:05:57Z","timestamp":1774803957528,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T00:00:00Z","timestamp":1513382400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001807","name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001807","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10100-017-0511-x","type":"journal-article","created":{"date-parts":[[2017,12,16]],"date-time":"2017-12-16T04:42:10Z","timestamp":1513399330000},"page":"905-936","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["Robust optimization for the vehicle routing problem with multiple deliverymen"],"prefix":"10.1007","volume":"27","author":[{"given":"Jonathan","family":"De La Vega","sequence":"first","affiliation":[]},{"given":"Pedro","family":"Munari","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3948-305X","authenticated-orcid":false,"given":"Reinaldo","family":"Morabito","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,12,16]]},"reference":[{"issue":"2","key":"511_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1590\/0104-530x2359-15","volume":"23","author":"A \u00c1lvarez","year":"2016","unstructured":"\u00c1lvarez A, Munari P (2016) Metaheuristic approaches for the vehicle routing problem with time windows and multiple deliverymen. Gest Prod 23(2):279\u2013293","journal-title":"Gest Prod"},{"key":"511_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cor.2017.02.001","volume":"83","author":"A \u00c1lvarez","year":"2017","unstructured":"\u00c1lvarez A, Munari P (2017) An exact hybrid method for the vehicle routing problem with time windows and multiple deliverymen. Comput Oper Res 83:1\u201312","journal-title":"Comput Oper Res"},{"issue":"4","key":"511_CR3","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10100-007-0036-9","volume":"15","author":"PP Belfiore","year":"2007","unstructured":"Belfiore PP, F\u00e1vero LPL (2007) Scatter search for the fleet size and mix vehicle routing problem with time windows. Cent Eur J Oper Res 15(4):351\u2013368","journal-title":"Cent Eur J Oper Res"},{"key":"511_CR4","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1007\/PL00011380","volume":"88","author":"A Ben-Tal","year":"2000","unstructured":"Ben-Tal A, Nemirovski A (2000) Robust solutions of linear programming problems contaminated with uncertain data. Math Program Ser A 88:411\u2013424","journal-title":"Math Program Ser A"},{"issue":"2","key":"511_CR5","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/s10107-003-0454-y","volume":"99","author":"A Ben-Tal","year":"2004","unstructured":"Ben-Tal A, Goryashko A, Guslitzer E, Nemirovski A (2004) Adjustable robust solutions of uncertain linear programs. Math Program 99(2):351\u2013376","journal-title":"Math Program"},{"key":"511_CR6","volume-title":"Robust optimization. Princeton series in applied mathematics","author":"A Ben-Tal","year":"2009","unstructured":"Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton series in applied mathematics. Princeton University Press, Princeton"},{"issue":"3","key":"511_CR7","doi-asserted-by":"publisher","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D Bertsimas","year":"1992","unstructured":"Bertsimas D (1992) A vehicle routing problem with stochastic demand. Oper Res 40(3):574\u2013585. https:\/\/doi.org\/10.1287\/opre.40.3.574","journal-title":"Oper Res"},{"issue":"2","key":"511_CR8","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-011-0444-4","volume":"134","author":"D Bertsimas","year":"2012","unstructured":"Bertsimas D, Goyal V (2012) On the power and limitations of affine policies in two-stage adaptive optimization. Math Program 134(2):491\u2013531","journal-title":"Math Program"},{"issue":"1","key":"511_CR9","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1287\/opre.1030.0065","volume":"52","author":"D Bertsimas","year":"2004","unstructured":"Bertsimas D, Sim M (2004) The price of robustness. Oper Res 52(1):35\u201353","journal-title":"Oper Res"},{"issue":"3","key":"511_CR10","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1137\/080734510","volume":"53","author":"D Bertsimas","year":"2011","unstructured":"Bertsimas D, Brown DB, Caramanis C (2011) Theory and applications of robust optimization. SIAM Rev 53(3):464\u2013501. https:\/\/doi.org\/10.1137\/080734510","journal-title":"SIAM Rev"},{"issue":"2","key":"511_CR11","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/s10107-014-0768-y","volume":"150","author":"D Bertsimas","year":"2015","unstructured":"Bertsimas D, Goyal V, Lu B (2015) A tight characterization of the performance of static solutions in two-stage adjustable robust linear optimization. Math Program 150(2):281\u2013319","journal-title":"Math Program"},{"key":"511_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-0237-4","volume-title":"Introduction to stochastic programming","author":"JR Birge","year":"2011","unstructured":"Birge JR, Louveaux F (2011) Introduction to stochastic programming. Springer, New York"},{"issue":"6","key":"511_CR13","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1016\/j.orl.2006.12.009","volume":"35","author":"CH Christiansen","year":"2007","unstructured":"Christiansen CH, Lysgaard J (2007) A branch-and-price algorithm for the capacited vehicle routig problem with stochastic demands. Oper Res Lett 35(6):773\u2013781","journal-title":"Oper Res Lett"},{"issue":"8","key":"511_CR14","doi-asserted-by":"publisher","first-page":"2742","DOI":"10.1109\/TLA.2015.7332158","volume":"13","author":"J Vega De\u00a0La","year":"2015","unstructured":"De\u00a0La Vega J, Alem D (2015) Energy rationalization in water supply networks via stochastic programming. Lat Am Trans, IEEE (Revista IEEE America Latina) 13(8):2742\u20132756. https:\/\/doi.org\/10.1109\/TLA.2015.7332158","journal-title":"Lat Am Trans, IEEE (Revista IEEE America Latina)"},{"key":"511_CR15","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1590\/S0101-74382012005000016","volume":"32","author":"V Ferreira","year":"2012","unstructured":"Ferreira V, Pureza V (2012) Some experiments with a savings heuristic and a tabu search approach for the vehicle routing problem with multiple deliverymen. Pesq Oper 32:443\u2013463","journal-title":"Pesq Oper"},{"key":"511_CR16","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/j.cor.2014.03.028","volume":"50","author":"C Gauvin","year":"2014","unstructured":"Gauvin C, Desaulniers G, Gendreau M (2014) A branch-cut-and-price algorithm for the vehicle routing problem with stochastic demands. Comput Oper Res 50:141\u2013153","journal-title":"Comput Oper Res"},{"issue":"3","key":"511_CR17","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1287\/opre.1120.1136","volume":"61","author":"CE Gounaris","year":"2013","unstructured":"Gounaris CE, Wiesemann W, Floudas CA (2013) The robust capacitated vehicle routing problem under demand uncertainty. Oper Res 61(3):677\u2013693","journal-title":"Oper Res"},{"issue":"4","key":"511_CR18","doi-asserted-by":"publisher","first-page":"877","DOI":"10.1287\/opre.2015.1392","volume":"63","author":"GA Hanasusanto","year":"2015","unstructured":"Hanasusanto GA, Kuhn D, Wiesemann W (2015) K-adaptability in two-stage robust binary programming. Oper Res 63(4):877\u2013891. https:\/\/doi.org\/10.1287\/opre.2015.1392","journal-title":"Oper Res"},{"key":"511_CR19","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/j.dam.2014.05.040","volume":"177","author":"O Jabali","year":"2014","unstructured":"Jabali O, Rei W, Gendreau M, Laporte G (2014) Partial-route inequalities for the multi-vehicle routing problem with stochastic demands. Discrete Appl Math 177:121\u2013136","journal-title":"Discrete Appl Math"},{"issue":"3","key":"511_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","volume":"50","author":"G Laporte","year":"2002","unstructured":"Laporte G, Louveaux F, Hamme L (2002) An integer L-shaped algorithm for the capacited vehicle routing problem with sotchastic demands. Oper Res 50(3):415\u2013423","journal-title":"Oper Res"},{"issue":"9","key":"511_CR21","doi-asserted-by":"publisher","first-page":"1294","DOI":"10.1057\/jors.2011.136","volume":"63","author":"C Lee","year":"2012","unstructured":"Lee C, Lee K, Park S (2012) Robust vehicle routing problem with deadlines and travel time\/demand uncertainty. J Oper Res Soc 63(9):1294\u20131306","journal-title":"J Oper Res Soc"},{"key":"511_CR22","unstructured":"Munari P, Morabito R (2016) A branch-price-and-cut for the vehicle routing problem with time windows and multiple deliverymen. Tech. rep., Production Engineering Dept., Federal University of S\u00e3o Carlos, Brazil"},{"key":"511_CR23","doi-asserted-by":"crossref","unstructured":"Ord\u00f3\u00f1ez F (2010) Robust vehicle routing. INFORMS Tutorials in Operations Research, chap 7:153\u2013178","DOI":"10.1287\/educ.1100.0078"},{"key":"511_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/978-94-017-3087-7","volume-title":"Stochastic programming","author":"A Pr\u00e9kopa","year":"1995","unstructured":"Pr\u00e9kopa A (1995) Stochastic programming, vol 324. Springer, Netherlands"},{"issue":"3","key":"511_CR25","doi-asserted-by":"publisher","first-page":"636","DOI":"10.1016\/j.ejor.2011.12.005","volume":"218","author":"V Pureza","year":"2012","unstructured":"Pureza V, Morabito R, Reimann M (2012) Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW. Eur J Oper Res 218(3):636\u2013647","journal-title":"Eur J Oper Res"},{"issue":"9","key":"511_CR26","first-page":"1143","volume":"21","author":"G Senarclens de Grancy","year":"2015","unstructured":"Senarclens de Grancy G (2015) An adaptive metaheuristic for vehicle routing problems with time windows and multiple service workers. J Univer Comput Sci 21(9):1143\u20131167","journal-title":"J Univer Comput Sci"},{"issue":"2","key":"511_CR27","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1007\/s10100-014-0373-4","volume":"23","author":"G Senarclens de Grancy","year":"2015","unstructured":"Senarclens de Grancy G, Reimann M (2015) Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers. CEJOR 23(2):479\u2013500","journal-title":"CEJOR"},{"issue":"1","key":"511_CR28","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10100-014-0341-z","volume":"24","author":"G Senarclens de Grancy","year":"2016","unstructured":"Senarclens de Grancy G, Reimann M (2016) Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP. CEJOR 24(1):29\u201348","journal-title":"CEJOR"},{"key":"511_CR29","series-title":"MOS-SIAM series on optimization","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611973433","volume-title":"Lectures on stochastic programming: modeling and theory","author":"A Shapiro","year":"2014","unstructured":"Shapiro A, Dentcheva D, Ruszczynski A (2014) Lectures on stochastic programming: modeling and theory, 2nd edn. MOS-SIAM series on optimization. SIAM, Philadelphia","edition":"2"},{"issue":"2","key":"511_CR30","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"issue":"5","key":"511_CR31","doi-asserted-by":"publisher","first-page":"1154","DOI":"10.1287\/opre.21.5.1154","volume":"21","author":"AL Soyster","year":"1973","unstructured":"Soyster AL (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154\u20131157","journal-title":"Oper Res"},{"key":"511_CR32","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1080\/07408170701745378","volume":"40","author":"I Sungur","year":"2008","unstructured":"Sungur I, Ord\u00f3\u00f1ez F, Dessouky M (2008) A robust optimization approach for the capacited vehicle routing problem with demand uncertainty. IIE Trans 40:509\u2013523","journal-title":"IIE Trans"},{"key":"511_CR33","unstructured":"Thiele A, Terry T, Epelman M (2009) Robust linear optimization with recourse. Technical report pp 4\u201337"},{"issue":"5","key":"511_CR34","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1016\/j.orl.2013.05.003","volume":"41","author":"B Zeng","year":"2013","unstructured":"Zeng B, Zhao L (2013) Solving two-stage robust optimization problems using a column-and-constraint generation method. Oper Res Lett 41(5):457\u2013461","journal-title":"Oper Res Lett"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0511-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-017-0511-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-017-0511-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,24]],"date-time":"2020-10-24T10:48:04Z","timestamp":1603536484000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-017-0511-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,12,16]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["511"],"URL":"https:\/\/doi.org\/10.1007\/s10100-017-0511-x","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,12,16]]},"assertion":[{"value":"16 December 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}