{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T10:03:05Z","timestamp":1766311385970},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2005,12,13]],"date-time":"2005-12-13T00:00:00Z","timestamp":1134432000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Math Model Algor"],"published-print":{"date-parts":[[2006,4]]},"DOI":"10.1007\/s10852-005-9033-y","type":"journal-article","created":{"date-parts":[[2005,12,12]],"date-time":"2005-12-12T11:58:56Z","timestamp":1134388736000},"page":"91-110","source":"Crossref","is-referenced-by-count":93,"title":["Hybrid Metaheuristics for the Vehicle Routing Problem with Stochastic Demands"],"prefix":"10.1007","volume":"5","author":[{"given":"Leonora","family":"Bianchi","sequence":"first","affiliation":[]},{"given":"Mauro","family":"Birattari","sequence":"additional","affiliation":[]},{"given":"Marco","family":"Chiarandini","sequence":"additional","affiliation":[]},{"given":"Max","family":"Manfrin","sequence":"additional","affiliation":[]},{"given":"Monaldo","family":"Mastrolilli","sequence":"additional","affiliation":[]},{"given":"Luis","family":"Paquete","sequence":"additional","affiliation":[]},{"given":"Olivia","family":"Rossi-Doria","sequence":"additional","affiliation":[]},{"given":"Tommaso","family":"Schiavinotto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,12,13]]},"reference":[{"key":"9033_CR1","volume-title":"Evolutionary Computation 1: Basic Algorithms and Operators","year":"2000","unstructured":"Baeck, T., Fogel, D. and Michalewicz Z. (eds.): Evolutionary Computation 1: Basic Algorithms and Operators, Institute of Physics, Bristol, UK, 2000."},{"issue":"3","key":"9033_CR2","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1287\/opre.40.3.574","volume":"40","author":"D. J. Bertsimas","year":"1992","unstructured":"Bertsimas, D. J.: A vehicle routing problem with stochastic demand, Oper. Res. 40(3) (1992), 574\u2013585.","journal-title":"Oper. Res."},{"issue":"4","key":"9033_CR3","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/trsc.29.4.342","volume":"29","author":"D. J. Bertsimas","year":"1995","unstructured":"Bertsimas, D. J., Chervi, P. and Peterson, M.: Computational approaches to stochastic vehicle routing problems, Trans. Sci. 29(4) (1995), 342\u2013352.","journal-title":"Trans. Sci."},{"issue":"2","key":"9033_CR4","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"D. J. Bertsimas","year":"1996","unstructured":"Bertsimas, D. J. and Simchi-Levi, D.: A new generation of vehicle routing research: Robust algorithms, addressing uncertainty, Oper. Res. 44(2) (1996), 216\u2013304.","journal-title":"Oper. Res."},{"key":"9033_CR5","doi-asserted-by":"crossref","unstructured":"Bianchi, L., Birattari, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O. and Schiavinotto, T.: Research on the vehicle routing problem with stochastic demand. Technical Report IDSIA-07-04, IDSIA, March 2004.","DOI":"10.1007\/978-3-540-30217-9_46"},{"key":"9033_CR6","unstructured":"Birattari, M.: On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs? Technical Report TR\/IRIDIA\/2004-01.2, IRIDIA, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium, 2004."},{"key":"9033_CR7","unstructured":"Birattari, M.: The Problem of Tuning Metaheuristics, as seen from a machine learning perspective, PhD thesis, Universit\u00e9 Libre de Bruxelles, Brussels, Belgium, 2004."},{"key":"9033_CR8","volume-title":"Practical Nonparametric Statistics","author":"W. J. Conover","year":"1999","unstructured":"Conover, W. J.: Practical Nonparametric Statistics, John Wiley & Sons, New York, New York, 1999."},{"key":"9033_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/b97673","volume-title":"Design and Analysis of experiments","author":"A. Dean","year":"1999","unstructured":"Dean, A. and Voss, D.: Design and Analysis of Experiments, Springer, Berlin Heidelberg New York, 1999."},{"key":"9033_CR10","doi-asserted-by":"crossref","unstructured":"Dorigo, M. and St\u00fctzle, T.: Ant Colony Optimization, MIT, 2004.","DOI":"10.7551\/mitpress\/1290.001.0001"},{"issue":"2","key":"9033_CR11","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1287\/trsc.29.2.143","volume":"29","author":"M. Gendreau","year":"1995","unstructured":"Gendreau, M., Laporte, G. and S\u00e9guin, R.: An exact algorithm for the vehicle routing problem with stochastic demands and customers, Trans. Sci. 29(2) (1995), 143\u2013155.","journal-title":"Trans. Sci."},{"key":"9033_CR12","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G. and S\u00e9guin, R.: Stochastic vehicle routing, Eur. J. Oper. Res. 88 (1996), 3\u201312.","journal-title":"Eur. J. Oper. Res."},{"key":"9033_CR13","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Laporte, G. and S\u00e9guin, R.: A tabu search heuristic for the vehicle routing problem with stochastic demands and customers, Oper. Res. 44(3) (1996).","DOI":"10.1287\/opre.44.3.469"},{"issue":"3","key":"9033_CR14","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search \u2013 Part I, ORSA J. Comput. 1(3) (1989), 190\u2013206.","journal-title":"ORSA J. Comput."},{"key":"9033_CR15","first-page":"238","volume-title":"Proceedings of ANTS 2004 \u2013 Ant Colony Optimization and Swarm Intelligence, volume 3172 of Lecture Notes in Computer Science","author":"W. Gutjahr","year":"2004","unstructured":"Gutjahr, W.: S-ACO: An ant-based approach to combinatorial optimization under uncertainty, in Proceedings of ANTS 2004 \u2013 Ant Colony Optimization and Swarm Intelligence, volume 3172 of Lecture Notes in Computer Science, Springer, Berlin Heidelberg New York, 2004, pp. 238\u2013249."},{"key":"9033_CR16","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1287\/moor.10.4.527","volume":"10","author":"M. Haimovitch","year":"1985","unstructured":"Haimovitch, M. and Rinnooy Kan, A.: Bounds and heuristics for capacitated routing problems, Math. Oper. Res. 10 (1985), 527\u2013542.","journal-title":"Math. Oper. Res."},{"key":"9033_CR17","unstructured":"Jaillet, P.: Probabilistic Traveling Salesman Problems, PhD thesis, MIT, Cambridge, Massachusetts, 1985."},{"issue":"6","key":"9033_CR18","doi-asserted-by":"crossref","first-page":"929","DOI":"10.1287\/opre.36.6.929","volume":"36","author":"P. Jaillet","year":"1988","unstructured":"Jaillet, P.: A priori solution of a travelling salesman problem in which a random subset of the customers are visited, Oper. Res. 36(6) (1988), 929\u2013936.","journal-title":"Oper. Res."},{"key":"9033_CR19","volume-title":"Vehicle Routing: Methods and Studies, chapter The probabilistic vehicle routing problems","author":"P. Jaillet","year":"1988","unstructured":"Jaillet, P. and Odoni, A.: in B. L. Golden and A. A. Assad (eds.), Vehicle Routing: Methods and Studies, chapter The probabilistic vehicle routing problems, Elsevier, Amsterdam, The Netherlands, 1988."},{"key":"9033_CR20","first-page":"215","volume-title":"Local Search in Combinatorial Optimization","author":"D. S. Johnson","year":"1997","unstructured":"Johnson, D. S. and McGeoch, L. A.: The travelling salesman problem: A case study in local optimization, in E. H. L. Aarts and J. K. Lenstra (eds.), Local Search in Combinatorial Optimization, Wiley, New York, USA, 1997, pp. 215\u2013310."},{"key":"9033_CR21","first-page":"369","volume-title":"The Traveling Salesman Problem and its Variations","author":"D. S. Johnson","year":"2002","unstructured":"Johnson, D. S. and McGeoch, L. A.: Experimental analysis of heuristics for the STSP, in G. Gutin and A. Punnen (eds.), The Traveling Salesman Problem and its Variations, Kluwer, Dordrecht, The Netherlands, 2002, pp. 369\u2013443."},{"key":"9033_CR22","first-page":"277","volume":"9","author":"A. Kenyon","year":"2002","unstructured":"Kenyon, A. and Morton, D. P.: A survey on stochastic location and routing problems, Cent. Eur. J. Oper. Res. 9 (2002), 277\u2013328.","journal-title":"Cent. Eur. J. Oper. Res."},{"key":"9033_CR23","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, S., Gelatt, C. D. and Vecchi, M. P.: Optimization by simulated annealing, Science (4598) (1983), 671\u2013680.","DOI":"10.1126\/science.220.4598.671"},{"key":"9033_CR24","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1016\/0167-6377(93)90002-X","volume":"33","author":"G. Laporte","year":"1993","unstructured":"Laporte, G. and Louveaux, F.: The integer l-shaped method for stochastic integer programs with complete recourse, Oper. Res. Lett. 33 (1993), 133\u2013142.","journal-title":"Oper. Res. Lett."},{"key":"9033_CR25","first-page":"321","volume-title":"Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management, chapter Iterated Local Search","author":"H. R. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H. R., Martin, O. and St\u00fctzle, T.: in F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, volume 57 of International Series in Operations Research & Management, chapter Iterated Local Search, Kluwer, Boston, USA, 2002, pp. 321\u2013353."},{"key":"9033_CR26","unstructured":"Or, I.: Traveling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood Banking, PhD thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL, 1976."},{"issue":"5","key":"9033_CR27","first-page":"1171","volume":"27","author":"N. Secomandi","year":"2000","unstructured":"Secomandi, N.: Comparing neuro-dynamic programming algorithms for the vehicle routing problem with stochastic demands, Comput. Oper. Res. 27(5) (2000), 1171\u20131200.","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9033_CR28","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) (2001), 796\u2013802.","journal-title":"Oper. Res."},{"key":"9033_CR29","unstructured":"Sheskin, D. J.: Handbook of Parametric and Nonparametric Statistical Procedures, 2nd edn., Chapman & Hall, 2000."},{"key":"9033_CR30","first-page":"589","volume-title":"Essays and Surveys on Metaheuristics, chapter Analyzing the Run-time Behaviour of Iterated Local Search for the TSP","author":"T. St\u00fctzle","year":"2002","unstructured":"St\u00fctzle, T. and Hoos, H.: in P. Hansen and C. Ribeiro (eds.), Essays and Surveys on Metaheuristics, chapter Analyzing the Run-time Behaviour of Iterated Local Search for the TSP, Kluwer Academic, Boston, USA, 2002, pp. 589\u2013612."},{"key":"9033_CR31","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/03081069208717490","volume":"16","author":"D. Teodorovi\u0107","year":"1992","unstructured":"Teodorovi\u0107, D. and Pavkovi\u0107, G.: A simulated annealing technique approach to the vehicle routing problem in the case of stochastic demand, Trans. Plan. Tech. 16 (1992), 261\u2013273.","journal-title":"Trans. Plan. Tech."},{"key":"9033_CR32","first-page":"350","volume-title":"Handbook of Genetic Algorithms","author":"D. Whitley","year":"1991","unstructured":"Whitley, D., Starkweather, T. and Shaner, D.: The travelling salesman and sequence scheduling: Quality solutions using genetic edge recombination, in L. Davis (ed.), Handbook of Genetic Algorithms, Van Nostrand Reinhold, New York, USA, 1991, pp. 350\u2013372."},{"issue":"1","key":"9033_CR33","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","volume":"34","author":"W. Yang","year":"2000","unstructured":"Yang, W., Mathur, K. and Ballou, R. H.: Stochastic vehicle routing problem with restocking, Trans. Sci. 34(1) (2000), 99\u2013112.","journal-title":"Trans. Sci."}],"container-title":["Journal of Mathematical Modelling and Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9033-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10852-005-9033-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10852-005-9033-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T14:14:11Z","timestamp":1586614451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10852-005-9033-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12,13]]},"references-count":33,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2006,4]]}},"alternative-id":["9033"],"URL":"https:\/\/doi.org\/10.1007\/s10852-005-9033-y","relation":{},"ISSN":["1570-1166","1572-9214"],"issn-type":[{"value":"1570-1166","type":"print"},{"value":"1572-9214","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12,13]]}}}