{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T16:09:12Z","timestamp":1778861352013,"version":"3.51.4"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2012,9,19]],"date-time":"2012-09-19T00:00:00Z","timestamp":1348012800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s11590-012-0555-8","type":"journal-article","created":{"date-parts":[[2012,9,18]],"date-time":"2012-09-18T10:46:20Z","timestamp":1347965180000},"page":"1503-1516","source":"Crossref","is-referenced-by-count":44,"title":["A multi-space sampling heuristic for the vehicle routing problem with stochastic demands"],"prefix":"10.1007","volume":"7","author":[{"given":"Jorge E.","family":"Mendoza","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Juan G.","family":"Villegas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,9,19]]},"reference":[{"issue":"2","key":"555_CR1","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1287\/trsc.1060.0180","volume":"41","author":"A Ak","year":"2007","unstructured":"Ak, A., Erera, A.: A paired-vehicle recourse strategy for the vehicle-routing problem with stochastic demands. Transp. Sci. 41(2), 222\u2013237 (2007)","journal-title":"Transp. Sci."},{"key":"555_CR2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"JE Beasley","year":"1983","unstructured":"Beasley, J.E.: Route-first cluster-second methods for vehicle routing. Omega 11, 403\u2013408 (1983)","journal-title":"Omega"},{"key":"555_CR3","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JB Bentley","year":"1992","unstructured":"Bentley, J.B.: Fast algorithms for geometric traveling salesman problems. INFORMS J. Comput. 4, 387\u2013411 (1992)","journal-title":"INFORMS J. Comput."},{"issue":"3","key":"555_CR4","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D Bertsimas","year":"1992","unstructured":"Bertsimas, D.: A vehicle routing problem with stochastic demand. Oper. Res. 40(3), 574\u2013585 (1992)","journal-title":"Oper. Res."},{"issue":"4","key":"555_CR5","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/S0305-0548(99)00058-1","volume":"27","author":"FF Boctor","year":"2000","unstructured":"Boctor, F.F., Renaud, J.: The column-circular, subsets-selection problem: Complexity and solutions. Comput. Oper. Res. 27(4), 383\u2013398 (2000)","journal-title":"Comput. Oper. Res."},{"issue":"6","key":"555_CR6","doi-asserted-by":"crossref","first-page":"773","DOI":"10.1016\/j.orl.2006.12.009","volume":"35","author":"C Christiansen","year":"2007","unstructured":"Christiansen, C., Lysgaard, J.: A branch-and-price algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. Lett. 35(6), 773\u2013781 (2007)","journal-title":"Oper. Res. Lett."},{"issue":"5","key":"555_CR7","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"JF Cordeau","year":"2002","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G., Potvin, J.Y., Semet, F.: A guide to vehicle routing heuristics. J. Oper. Res. Soc. 53(5), 512\u2013522 (2002)","journal-title":"J. Oper. Res. Soc."},{"issue":"4","key":"555_CR8","doi-asserted-by":"crossref","first-page":"723","DOI":"10.1016\/j.cor.2010.09.010","volume":"38","author":"C Duhamel","year":"2011","unstructured":"Duhamel, C., Lacomme, P., Prodhon, C.: Efficient frameworks for greedy split and new depth first search split procedures for routing problems. Comput. Oper. Res. 38(4), 723\u2013739 (2011)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"555_CR9","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1002\/net.20338","volume":"54","author":"A Erera","year":"2009","unstructured":"Erera, A., Savelsbergh, M., Uyar, E.: Fixed routes with backup vehicles for stochastic vehicle routing problems with time constraints. Networks 54(4), 270\u2013283 (2009)","journal-title":"Networks"},{"issue":"2","key":"555_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1057\/jors.1976.63","volume":"27","author":"BA Foster","year":"1976","unstructured":"Foster, B.A., Ryan, D.M.: An integer programming approach to the vehicle scheduling problem. Oper. Res. Q. 27(2), 367\u2013384 (1976)","journal-title":"Oper. Res. Q."},{"issue":"3","key":"555_CR11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper. Res. 44(3), 469\u2013477 (1996)","journal-title":"Oper. Res."},{"issue":"2","key":"555_CR12","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Oper. Res. 22(2), 340\u2013349 (1974)","journal-title":"Oper. Res."},{"issue":"2","key":"555_CR13","doi-asserted-by":"crossref","first-page":"312","DOI":"10.1016\/j.ejor.2011.09.023","volume":"217","author":"JC Goodson","year":"2012","unstructured":"Goodson, J.C., Ohlmann, J.W., Thomas, B.W.: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. Euro. J. Oper. Res. 217(2), 312\u2013323 (2012)","journal-title":"Euro. J. Oper. Res."},{"key":"555_CR14","unstructured":"Kelly, J.P., Xu, J.: A set-partitioning-based heuristic for the vehicle routing problem. INFORMS J. Comput. 11(2), 161\u2013172 (1999)"},{"issue":"3","key":"555_CR15","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1287\/opre.50.3.415.7751","volume":"50","author":"G Laporte","year":"2002","unstructured":"Laporte, G., Louveaux, F., Van Hamme, L.: An integer L-shaped algorithm for the capacitated vehicle routing problem with stochastic demands. Oper. Res. 50(3), 415\u2013423 (2002)","journal-title":"Oper. Res."},{"issue":"11","key":"555_CR16","doi-asserted-by":"crossref","first-page":"1886","DOI":"10.1016\/j.cor.2009.06.015","volume":"37","author":"JE Mendoza","year":"2010","unstructured":"Mendoza, J.E., Castanier, B., Gu\u00e9ret, C., Medaglia, A.L., Velasco, N.: A memetic algorithm for the multi-compartment vehicle routing problem with stochastic demands. Comput. Oper. Res. 37(11), 1886\u20131898 (2010)","journal-title":"Comput. Oper. Res."},{"issue":"3","key":"555_CR17","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1287\/trsc.1100.0353","volume":"45","author":"JE Mendoza","year":"2011","unstructured":"Mendoza, J.E., Castanier, B., Gu\u00e9ret, C., Medaglia, A.L., Velasco, N.: Constructive heuristics for the multicompartment vehicle routing problem with stochastic demands. Transp. Sci. 45(3), 335\u2013345 (2011)","journal-title":"Transp. Sci."},{"issue":"12","key":"555_CR18","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Comput. Oper. Res. 31(12), 1985\u20132002 (2004)","journal-title":"Comput. Oper. Res."},{"key":"555_CR19","unstructured":"Reinelt, G.: Construction heuristics. In: The traveling salesman, lecture notes in computer science, vol. 840, pp. 73\u201399. Springer, Berlin (1994)"},{"key":"555_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"issue":"3","key":"555_CR21","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1057\/jors.1993.54","volume":"44","author":"DM Ryan","year":"1993","unstructured":"Ryan, D.M., Hjorring, C., Glover, F.: Extensions of the petal method for vehicle routeing. J. Oper. Res. Soc. 44(3), 289\u2013296 (1993)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"555_CR22","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1287\/opre.49.5.796.10608","volume":"49","author":"N Secomandi","year":"2001","unstructured":"Secomandi, N.: A rollout policy for the vehicle routing problem with stochastic demands. Oper. Res. 49(5), 796\u2013804 (2001)","journal-title":"Oper. Res."},{"issue":"4","key":"555_CR23","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1023\/A:1025605803490","volume":"9","author":"N Secomandi","year":"2003","unstructured":"Secomandi, N.: Analysis of a rollout approach to sequencing problems with stochastic routing applications. J. Heuristics 9(4), 321\u2013352 (2003)","journal-title":"J. Heuristics"},{"issue":"1","key":"555_CR24","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1287\/opre.1080.0520","volume":"57","author":"N Secomandi","year":"2009","unstructured":"Secomandi, N., Margot, F.: Reoptimization approaches for the vehicle-routing problem with stochastic demands. Oper. Res. 57(1), 214\u2013230 (2009)","journal-title":"Oper. Res."},{"issue":"4","key":"555_CR25","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/03081069208717490","volume":"16","author":"D Teodorovi\u0107","year":"1992","unstructured":"Teodorovi\u0107, D., Pavkovi\u0107, G.: A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demands. Transp. Plan. Technol. 16(4), 261\u2013273 (1992)","journal-title":"Transp. Plan. Technol."},{"key":"555_CR26","unstructured":"Villegas, J.G., Prins, C., Prodhon, C., Medaglia, A.L., Velasco, N.: A matheuristic for the truck and trailer routing problem. Department of Industrial Engineering, Universidad de Antioquia, Technical report (2011)"},{"issue":"1","key":"555_CR27","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","volume":"34","author":"WH Yang","year":"2000","unstructured":"Yang, W.H., Mathur, K., Ballou, R.: Stochastic vehicle routing with restocking. Transp. Sci. 34(1), 99\u2013112 (2000)","journal-title":"Transp. Sci."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0555-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-012-0555-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-012-0555-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T17:11:34Z","timestamp":1559409094000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-012-0555-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,19]]},"references-count":27,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["555"],"URL":"https:\/\/doi.org\/10.1007\/s11590-012-0555-8","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,19]]}}}