{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T10:10:07Z","timestamp":1743934207297,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":81,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306709"},{"type":"electronic","value":"9783642306716"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30671-6_2","type":"book-chapter","created":{"date-parts":[[2012,7,31]],"date-time":"2012-07-31T09:07:24Z","timestamp":1343725644000},"page":"77-95","source":"Crossref","is-referenced-by-count":10,"title":["Hybrid Metaheuristics for Dynamic and Stochastic Vehicle Routing"],"prefix":"10.1007","author":[{"given":"Ulrike","family":"Ritzinger","sequence":"first","affiliation":[]},{"given":"Jakob","family":"Puchinger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Alvarenga, G., de Abreu Silva, R., Mateus, G.: A hybrid approach for the dynamic vehicle routing problem with time windows. In: Fifth International Conference on Hybrid Intelligent Systems (HIS 2005), 7 pages (November 2005)","DOI":"10.1109\/ICHIS.2005.8"},{"key":"2_CR2","doi-asserted-by":"crossref","unstructured":"Alvarenga, G., Mateus, G., de Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Computers & Operations Research\u00a034(6), 1561\u20131584 (2007); Part Special Issue: Odysseus 2003 Second International Workshop on Freight Transportation Logistics","DOI":"10.1016\/j.cor.2005.07.025"},{"key":"2_CR3","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/978-0-387-71722-7_10","volume-title":"Dynamic Fleet Management","author":"A. Attanasio","year":"2007","unstructured":"Attanasio, A., Bregman, J., Ghiani, G., Manni, E.: Real-time fleet management at ecourier ltd. In: Sharda, R., Voss, S., Zeimpekis, V., Tarantilis, C.D., Giaglis, G.M., Minis, I. (eds.) Dynamic Fleet Management. Operations Research\/Computer Science Interfaces Series, vol.\u00a038, pp. 219\u2013238. Springer, US (2007)"},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A. Attanasio","year":"2004","unstructured":"Attanasio, A., Cordeau, J.-F., Ghiani, G., Laporte, G.: Parallel tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput.\u00a030, 377\u2013387 (2004)","journal-title":"Parallel Comput."},{"issue":"4","key":"2_CR5","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","volume":"11","author":"J. Beasley","year":"1983","unstructured":"Beasley, J.: Route first\u2013cluster second methods for vehicle routing. Omega\u00a011(4), 403\u2013408 (1983)","journal-title":"Omega"},{"key":"2_CR6","unstructured":"Bent, R.W., Van Hentenryck, P.: Dynamic vehicle routing with stochastic requests. In: International Joint Conference On Artificial Intelligence, vol.\u00a018, pp. 1362\u20131363 (2003)"},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"R.W. Bent","year":"2004","unstructured":"Bent, R.W., Van Hentenryck, P.: Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper. Res.\u00a052, 977\u2013987 (2004)","journal-title":"Oper. Res."},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Berbeglia, G., Cordeau, J.-F., Laporte, G.: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem. INFORMS Journal on Computing (2011)","DOI":"10.1287\/ijoc.1110.0454"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1287\/trsc.1100.0336","volume":"45","author":"G. Berbeglia","year":"2011","unstructured":"Berbeglia, G., Pesant, G., Rousseau, L.-M.: Checking the feasibility of dial-a-ride instances using constraint programming. Transportation Science\u00a045, 399\u2013412 (2011)","journal-title":"Transportation Science"},{"key":"2_CR10","doi-asserted-by":"publisher","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.\u00a040, 574\u2013585 (1992)","journal-title":"Oper. Res."},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10852-005-9033-y","volume":"5","author":"L. Bianchi","year":"2006","unstructured":"Bianchi, L., Birattari, M., Chiarandini, M., Manfrin, M., Mastrolilli, M., Paquete, L., Rossi-Doria, O., Schiavinotto, T.: Hybrid metaheuristics for the vehicle routing problem with stochastic demands. Journal of Mathematical Modelling and Algorithms\u00a05, 91\u2013110 (2006), doi:10.1007\/s10852-005-9033-y","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"2_CR12","unstructured":"Birge, J.R., Louveaux, F.: Introduction to Stochastic Programming. Springer (1997)"},{"issue":"6","key":"2_CR13","doi-asserted-by":"publisher","first-page":"4135","DOI":"10.1016\/j.asoc.2011.02.032","volume":"11","author":"C. Blum","year":"2011","unstructured":"Blum, C., Puchinger, J., Raidl, G.R., Roli, A.: Hybrid metaheuristics in combinatorial optimization: A survey. Applied Soft Computing\u00a011(6), 4135\u20134151 (2011)","journal-title":"Applied Soft Computing"},{"issue":"3","key":"2_CR14","doi-asserted-by":"publisher","first-page":"733","DOI":"10.1016\/j.ejor.2009.01.046","volume":"200","author":"S. Bock","year":"2010","unstructured":"Bock, S.: Real-time control of freight forwarder transportation networks by integrating multimodal transport chains. European Journal of Operational Research\u00a0200(3), 733\u2013746 (2010)","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"2_CR15","doi-asserted-by":"publisher","first-page":"2955","DOI":"10.1016\/j.cor.2009.01.014","volume":"36","author":"R.M. Branchini","year":"2009","unstructured":"Branchini, R.M., Armentano, V.A., L\u00f8kketangen, A.: Adaptive granular local search heuristic for a dynamic vehicle routing problem. Computers and Operations Research\u00a036(11), 2955\u20132968 (2009)","journal-title":"Computers and Operations Research"},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Caramia, M., Italiano, G., Oriolo, G., Pacifici, A., Perugia, A.: Routing a fleet of vehicles for dynamic, combined pickup and delivery services. In: Proceedings of the Symposium on Operation Research 2001, pp. 3\u20138. Springer (2001)","DOI":"10.1007\/978-3-642-50282-8_1"},{"issue":"5","key":"2_CR17","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1016\/j.tre.2005.01.003","volume":"42","author":"H.-K. Chen","year":"2006","unstructured":"Chen, H.-K., Hsueh, C.-F., Chang, M.-S.: The real-time time-dependent vehicle routing problem. Transportation Research Part E: Logistics and Transportation Review\u00a042(5), 383\u2013408 (2006)","journal-title":"Transportation Research Part E: Logistics and Transportation Review"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"Z.-L. Chen","year":"2006","unstructured":"Chen, Z.-L., Xu, H.: Dynamic column generation for dynamic vehicle routing with time windows. Transportation Science\u00a040, 74\u201388 (2006)","journal-title":"Transportation Science"},{"key":"2_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10479-007-0170-8","volume":"153","author":"J.-F. Cordeau","year":"2007","unstructured":"Cordeau, J.-F., Laporte, G.: The dial-a-ride problem: models and algorithms. Annals of Operations Research\u00a0153, 29\u201346 (2007)","journal-title":"Annals of Operations Research"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Cordeau, J.-F., Laporte, G., Savelsbergh, M.W., Vigo, D.: Vehicle routing. In: Barnhart, C., Laporte, G. (eds.) Transportation. Handbooks in Operations Research and Management Science, vol.\u00a014, ch. 6, pp. 367\u2013428. Elsevier (2007)","DOI":"10.1016\/S0927-0507(06)14006-2"},{"key":"2_CR21","unstructured":"Crainic, T.G.: Parallel solution methods for vehicle routing problems. In: Golden, et al. (eds.), [35], p. 589 (2008)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Cr\u00e9put, J.-C., Hajjam, A., Koukam, A., Kuhn, O.: Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem. Journal of Combinatorial Optimization, 1\u201322 (2011)","DOI":"10.1007\/s10878-011-9400-8"},{"issue":"3","key":"2_CR23","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1287\/trsc.23.3.166","volume":"23","author":"M. Dror","year":"1989","unstructured":"Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with stochastic demands: Properties and solution frameworks. Transportation Science\u00a023(3), 166\u2013176 (1989)","journal-title":"Transportation Science"},{"issue":"4","key":"2_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","volume":"40","author":"A. Fabri","year":"2006","unstructured":"Fabri, A., Recht, P.: On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Research Part B: Methodological\u00a040(4), 335\u2013350 (2006)","journal-title":"Transportation Research Part B: Methodological"},{"key":"2_CR25","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M. Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Mathematical Programming\u00a098, 23\u201347 (2003)","journal-title":"Mathematical Programming"},{"key":"2_CR26","doi-asserted-by":"crossref","unstructured":"Flatberg, T., Hasle, G., Kloster, O., Nilssen, E.J., Riise, A.: Dynamic and stochastic vehicle routing in practice. In: Sharda, R., Voss, S., Zeimpekis, V., Tarantilis, C.D., Giaglis, G.M., Minis, I. (eds.) Dynamic Fleet Management. Operations Research\/Computer Science Interfaces Series, vol.\u00a038, pp. 41\u201363. Springer, US (2007), doi:10.1007\/978-0-387-71722-7_3","DOI":"10.1007\/978-0-387-71722-7_3"},{"key":"2_CR27","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1287\/trsc.1030.0074","volume":"38","author":"B. Fleischmann","year":"2004","unstructured":"Fleischmann, B., Gnutzmann, S., Sandvoss, E.: Dynamic vehicle routing based on online traffic information. Transportation Science\u00a038, 420\u2013433 (2004)","journal-title":"Transportation Science"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"420","DOI":"10.1287\/trsc.1030.0074","volume":"38","author":"B. Fleischmann","year":"2004","unstructured":"Fleischmann, B., Gnutzmann, S., Sandvoss, E.: Dynamic vehicle routing based on online traffic information. Transportation Science\u00a038, 420\u2013433 (2004)","journal-title":"Transportation Science"},{"issue":"7","key":"2_CR29","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1016\/S0191-2615(98)00016-2","volume":"32","author":"L. Fu","year":"1998","unstructured":"Fu, L., Rilett, L.R.: Expected shortest paths in dynamic and stochastic traffic networks. Transportation Research Part B: Methodological\u00a032(7), 499\u2013516 (1998)","journal-title":"Transportation Research Part B: Methodological"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M. Gendreau","year":"1999","unstructured":"Gendreau, M., Guertin, F., Potvin, J.-Y., Taillard, E.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science\u00a033, 381\u2013390 (1999)","journal-title":"Transportation Science"},{"issue":"1","key":"2_CR31","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M. Gendreau","year":"1996","unstructured":"Gendreau, M., Laporte, G., S\u00e9guin, R.: Stochastic vehicle routing. European Journal of Operational Research\u00a088(1), 3\u201312 (1996)","journal-title":"European Journal of Operational Research"},{"key":"2_CR32","doi-asserted-by":"crossref","unstructured":"Gendreau, M., Potvin, J.-Y., Br\u00e4umlaysy, O., Hasle, G., L\u00f8kketangen, A.: Metaheuristics for the vehicle routing problem and its extensions: A categorized bibliography. In: Golden, et al. (eds.) [35], pp. 143\u2013169 (2008)","DOI":"10.1007\/978-0-387-77778-8_7"},{"key":"2_CR33","unstructured":"Goel, A.: Fleet Telematics. Operations Research\/Computer Science Interfaces Series, vol.\u00a040. Springer, US (2008)"},{"issue":"1","key":"2_CR34","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0305-0548(83)90026-6","volume":"10","author":"B. Golden","year":"1983","unstructured":"Golden, B., Dearmon, J., Baker, E.: Computational experiments with algorithms for a class of routing problems. Computers & Operations Research\u00a010(1), 47\u201359 (1983)","journal-title":"Computers & Operations Research"},{"key":"2_CR35","doi-asserted-by":"crossref","unstructured":"Golden, B., Raghavan, S., Wasil, E. (eds.): The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces Series, vol.\u00a043. Springer (2008)","DOI":"10.1007\/978-0-387-77778-8"},{"key":"2_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-540-74871-7_9","volume-title":"Stochastic Algorithms: Foundations and Applications","author":"W.J. Gutjahr","year":"2007","unstructured":"Gutjahr, W.J., Katzensteiner, S., Reiter, P.: A VNS Algorithm for Noisy Problems and its Application to Project Portfolio Analysis. In: Hromkovi\u010d, J., Kr\u00e1lovi\u010d, R., Nunkesser, M., Widmayer, P. (eds.) SAGA 2007. LNCS, vol.\u00a04665, pp. 93\u2013104. Springer, Heidelberg (2007), doi:10.1007\/978-3-540-74871-7_9"},{"key":"2_CR37","doi-asserted-by":"publisher","first-page":"2959","DOI":"10.1016\/j.cor.2004.04.013","volume":"32","author":"A. Haghani","year":"2005","unstructured":"Haghani, A., Jung, S.: A dynamic vehicle routing problem with time-dependent travel times. Comput. Oper. Res.\u00a032, 2959\u20132986 (2005)","journal-title":"Comput. Oper. Res."},{"key":"2_CR38","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10732-008-9076-0","volume":"15","author":"L. Hvattum","year":"2009","unstructured":"Hvattum, L., L\u00f8kketangen, A.: Using scenario trees and progressive hedging for stochastic inventory routing problems. Journal of Heuristics\u00a015, 527\u2013557 (2009)","journal-title":"Journal of Heuristics"},{"issue":"4","key":"2_CR39","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1287\/trsc.1060.0166","volume":"40","author":"L.M. Hvattum","year":"2006","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Laporte, G.: Solving a dynamic and stochastic vehicle routing problem with a sample scenario hedging heuristic. Transportation Science\u00a040(4), 421\u2013438 (2006)","journal-title":"Transportation Science"},{"issue":"4","key":"2_CR40","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1002\/net.20182","volume":"49","author":"L.M. Hvattum","year":"2007","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Laporte, G.: A branch-and-regret heuristic for stochastic and dynamic vehicle routing problems. Networks\u00a049(4), 330\u2013340 (2007)","journal-title":"Networks"},{"issue":"2","key":"2_CR41","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1287\/ijoc.1080.0291","volume":"21","author":"L.M. Hvattum","year":"2009","unstructured":"Hvattum, L.M., L\u00f8kketangen, A., Laporte, G.: Scenario tree-based heuristics for stochastic inventory-routing problems. INFORMS Journal on Computing\u00a021(2), 268\u2013285 (2009)","journal-title":"INFORMS Journal on Computing"},{"issue":"2","key":"2_CR42","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1287\/trsc.1050.0114","volume":"40","author":"S. Ichoua","year":"2006","unstructured":"Ichoua, S., Gendreau, M., Potvin, J.-Y.: Exploiting knowledge about future demands for real-time vehicle dispatching. Transportation Science\u00a040(2), 211\u2013225 (2006)","journal-title":"Transportation Science"},{"key":"2_CR43","unstructured":"Jaillet, P.: Probabilistic Traveling Salesman Problems. PhD thesis. Operations Research Center, MIT (February 1985)"},{"key":"2_CR44","doi-asserted-by":"crossref","unstructured":"Jih, W.-R., Yung-Jen Hsu, J.: Dynamic vehicle routing using hybrid genetic algorithms. In: Proceedings of 1999 IEEE International Conference on Robotics and Automation, vol.\u00a01, pp. 453\u2013458 (1999)","DOI":"10.1109\/ROBOT.1999.770019"},{"key":"2_CR45","doi-asserted-by":"crossref","unstructured":"Johnson, D., McGeoch, L.: Experimental analysis of heuristics for the stsp. In: Gutin, G., Punnen, A., Du, D.-Z., Pardalos, P.M. (eds.) The Traveling Salesman Problem and Its Variations. Combinatorial Optimization, vol.\u00a012, pp. 369\u2013443. Springer, US (2004), doi:10.1007\/0-306-48213-4_9","DOI":"10.1007\/0-306-48213-4_9"},{"key":"2_CR46","doi-asserted-by":"crossref","unstructured":"Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neural Networks, vol.\u00a04, pp. 1942\u20131948 (November 1995)","DOI":"10.1109\/ICNN.1995.488968"},{"issue":"1","key":"2_CR47","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1287\/trsc.37.1.69.12820","volume":"37","author":"A.S. Kenyon","year":"2003","unstructured":"Kenyon, A.S., Morton, D.P.: Stochastic vehicle routing with random travel times. Transportation Science\u00a037(1), 69\u201382 (2003)","journal-title":"Transportation Science"},{"key":"2_CR48","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-642-15461-4_20","volume-title":"Swarm Intelligence","author":"M.R. Khouadjia","year":"2010","unstructured":"Khouadjia, M.R., Alba, E., Jourdan, L., Talbi, E.-G.: Multi-Swarm Optimization for Dynamic Combinatorial Problems: A Case Study on Dynamic Vehicle Routing Problem. In: Dorigo, M., Birattari, M., Di Caro, G.A., Doursat, R., Engelbrecht, A.P., Floreano, D., Gambardella, L.M., Gro\u00df, R., \u015eahin, E., Sayama, H., St\u00fctzle, T. (eds.) ANTS 2010. LNCS, vol.\u00a06234, pp. 227\u2013238. Springer, Heidelberg (2010)"},{"issue":"3","key":"2_CR49","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: An overview of exact and approximate algorithms. European Journal of Operational Research\u00a059(3), 345\u2013358 (1992)","journal-title":"European Journal of Operational Research"},{"key":"2_CR50","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1287\/trsc.1090.0301","volume":"43","author":"G. Laporte","year":"2009","unstructured":"Laporte, G.: Fifty years of vehicle routing. Transportation Science\u00a043, 408\u2013416 (2009)","journal-title":"Transportation Science"},{"issue":"1","key":"2_CR51","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/trsc.1090.0290","volume":"44","author":"G. Laporte","year":"2010","unstructured":"Laporte, G., Musmanno, R., Vocaturo, F.: An adaptive large neighbourhood search heuristic for the capacitated arc-routing problem with stochastic demands. Transportation Science\u00a044(1), 125\u2013135 (2010)","journal-title":"Transportation Science"},{"key":"2_CR52","unstructured":"Larsen, A.: The Dynamic Vehicle Routing Problem. PhD thesis. Technical University of Denmark, Kongens, Lyngby, Denmark (2000)"},{"key":"2_CR53","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1057\/palgrave.jors.2601352","volume":"53","author":"A. Larsen","year":"2002","unstructured":"Larsen, A., Madsen, O., Solomon, M.: Partially dynamic vehicle routing - models and algorithms. Journal of the Operational Research Society\u00a053, 637\u2013646 (2002)","journal-title":"Journal of the Operational Research Society"},{"key":"2_CR54","unstructured":"Larsen, A., Madsen, O.B., Solomon, M.M.: Classification of dynamic vehicle routing systems. In: Sharda, R., Voss, S., Zeimpekis, V., Tarantilis, C.D., Giaglis, G.M., Minis, I. (eds.) Dynamic Fleet Management. Operations Research\/Computer Science Interfaces Series, vol.\u00a038, pp. 19\u201340. Springer, US (2007)"},{"key":"2_CR55","doi-asserted-by":"crossref","unstructured":"Larsen, A., Madsen, O.B., Solomon, M.M.: Recent developments in dynamic vehicle routing systems. In: Sharda, R., Voss, S., Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces Series, vol.\u00a043, pp. 199\u2013218. Springer, US (2008) doi:10.1007\/978-0-387-77778-8_9","DOI":"10.1007\/978-0-387-77778-8_9"},{"issue":"1","key":"2_CR56","doi-asserted-by":"publisher","first-page":"140","DOI":"10.3141\/1882-17","volume":"1882","author":"T.-Y. Liao","year":"2004","unstructured":"Liao, T.-Y.: Tabu search algorithm for dynamic vehicle routing problems under real-time information. Transportation Research Record: Journal of the Transportation Research Board\u00a01882(1), 140\u2013149 (2004)","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"10","key":"2_CR57","doi-asserted-by":"publisher","first-page":"12548","DOI":"10.1016\/j.eswa.2011.04.041","volume":"38","author":"T.-Y. Liao","year":"2011","unstructured":"Liao, T.-Y., Hu, T.-Y.: An object-oriented evaluation framework for dynamic vehicle routing problems under real-time information. Expert Systems with Applications\u00a038(10), 12548\u201312558 (2011)","journal-title":"Expert Systems with Applications"},{"key":"2_CR58","doi-asserted-by":"publisher","first-page":"432","DOI":"10.1016\/j.cor.2009.03.004","volume":"37","author":"Y. Marinakis","year":"2010","unstructured":"Marinakis, Y., Marinaki, M.: A hybrid multi-swarm particle swarm optimization algorithm for the probabilistic traveling salesman problem. Comput. Oper. Res.\u00a037, 432\u2013442 (2010)","journal-title":"Comput. Oper. Res."},{"key":"2_CR59","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10589-005-4798-5","volume":"32","author":"Y. Marinakis","year":"2005","unstructured":"Marinakis, Y., Migdalas, A., Pardalos, P.: Expanding neighborhood grasp for the traveling salesman problem. Computational Optimization and Applications\u00a032, 231\u2013257 (2005), doi:10.1007\/s10589-005-4798-5","journal-title":"Computational Optimization and Applications"},{"issue":"11","key":"2_CR60","doi-asserted-by":"publisher","first-page":"1886","DOI":"10.1016\/j.cor.2009.06.015","volume":"37","author":"J.E. 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. Computers & Operations Research\u00a037(11), 1886\u20131898 (2010)","journal-title":"Computers & Operations Research"},{"issue":"11","key":"2_CR61","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N., Hansen, P.: Variable neighborhood search. Computers & Operations Research\u00a024(11), 1097\u20131100 (1997)","journal-title":"Computers & Operations Research"},{"key":"2_CR62","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L., Rizzoli, A., Donati, A.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization\u00a010, 327\u2013343 (2005), doi:10.1007\/s10878-005-4922-6","journal-title":"Journal of Combinatorial Optimization"},{"key":"2_CR63","unstructured":"Parragh, S.N.: Ambulance Routing Problems with Rich Constraints and Multiple Objectives. PhD thesis. University of Vienna, Department of Business Administration (2009)"},{"key":"2_CR64","doi-asserted-by":"publisher","first-page":"1129","DOI":"10.1016\/j.cor.2009.10.003","volume":"37","author":"S.N. Parragh","year":"2010","unstructured":"Parragh, S.N., Doerner, K.F., Hartl, R.F.: Variable neighborhood search for the dial-a-ride problem. Comput. Oper. Res.\u00a037, 1129\u20131138 (2010)","journal-title":"Comput. Oper. Res."},{"key":"2_CR65","doi-asserted-by":"crossref","unstructured":"Pessoa, A., de Arago, M.P., Uchoa, E.: Robust branch-cut-and-price algorithms for vehicle routing problems. In: Golden, et al. (eds.) [35], pp. 297\u2013325 (2008)","DOI":"10.1007\/978-0-387-77778-8_14"},{"key":"2_CR66","unstructured":"Pillac, V., Gendreau, M., Gu\u00e9ret, C., Medaglia, A.: A review of dynamic vehicle routing problems. Technical Report CIRRELT-2011-62. Centre interuniversitaire de recherche sur les reseaux denterprise, la logistique et le transport (CIRRELT), Montreal, Canada (2011)"},{"issue":"4","key":"2_CR67","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1016\/j.cor.2004.09.015","volume":"33","author":"J.-Y. Potvin","year":"2006","unstructured":"Potvin, J.-Y., Xu, Y., Benyahia, I.: Vehicle routing and scheduling with dynamic travel times. Computers and Operations Research\u00a033(4), 1129\u20131137 (2006), Part Special Issue: Optimization Days 2003","journal-title":"Computers and Operations Research"},{"key":"2_CR68","doi-asserted-by":"crossref","unstructured":"Powell, W.B.: Approximate Dynamic Programming: Solving the Curses of Dimensionality. Wiley (2007)","DOI":"10.1002\/9780470182963"},{"key":"2_CR69","doi-asserted-by":"crossref","unstructured":"Powell, W.B., Topaloglu, H.: Stochastic programming in transportation and logistics. In: Ruszczynski, A., Shapiro, A. (eds.) Stochastic Programming. Handbooks in Operations Research and Management Science, vol.\u00a010, pp. 555\u2013635. Elsevier (2003)","DOI":"10.1016\/S0927-0507(03)10009-6"},{"issue":"1","key":"2_CR70","doi-asserted-by":"publisher","first-page":"176","DOI":"10.3141\/1645-22","volume":"1645","author":"A.C. Regan","year":"1998","unstructured":"Regan, A.C., Mahmassani, H.S., Jaillet, P.: Evaluation of dynamic fleet management systems: Simulation framework. Transportation Research Record: Journal of the Transportation Research Board\u00a01645(1), 176\u2013184 (1998)","journal-title":"Transportation Research Record: Journal of the Transportation Research Board"},{"issue":"1","key":"2_CR71","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1287\/trsc.1090.0295","volume":"44","author":"W. Rei","year":"2010","unstructured":"Rei, W., Gendreau, M., Soriano, P.: A hybrid monte carlo local branching algorithm for the single vehicle routing problem with stochastic demands. Transportation Science\u00a044(1), 136\u2013146 (2010)","journal-title":"Transportation Science"},{"key":"2_CR72","series-title":"International Series in Operations Research & Management Science","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/0-306-48056-5\\_8","volume-title":"Handbook of Metaheuristics","author":"M. Resende","year":"2003","unstructured":"Resende, M., Ribeiro, C.: Greedy randomized adaptive search procedures. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics. International Series in Operations Research & Management Science, vol.\u00a057, pp. 219\u2013249. Springer, New York (2003), doi:10.1007\/0-306-48056-5_8"},{"issue":"1","key":"2_CR73","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1287\/moor.16.1.119","volume":"16","author":"R.T. Rockafellar","year":"1991","unstructured":"Rockafellar, R.T., Wets, R.J.-B.: Scenarios and policy aggregation in optimization under uncertainty. Mathematics of Operations Research\u00a016(1), 119\u2013147 (1991)","journal-title":"Mathematics of Operations Research"},{"issue":"12","key":"2_CR74","doi-asserted-by":"publisher","first-page":"1719","DOI":"10.1016\/j.cor.2011.02.006","volume":"38","author":"M. Schilde","year":"2011","unstructured":"Schilde, M., Doerner, K., Hartl, R.: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports. Computers & Operations Research\u00a038(12), 1719\u20131730 (2011)","journal-title":"Computers & Operations Research"},{"key":"2_CR75","unstructured":"Schorpp, S.: Dynamic Fleet Management for International Truck Transportation focusing on Occasional Transportation Tasks. PhD thesis. University of Augsburg, Faculty of Economics and Business Administration (2010)"},{"issue":"2","key":"2_CR76","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1287\/trsc.1080.0238","volume":"43","author":"H.P. Sim\u00e3o","year":"2009","unstructured":"Sim\u00e3o, H.P., Day, J., George, A.P., Gifford, T., Nienow, J., Powell, W.B.: An approximate dynamic programming algorithm for large-scale fleet management: A case application. Transportation Science\u00a043(2), 178\u2013197 (2009)","journal-title":"Transportation Science"},{"key":"2_CR77","unstructured":"St\u00fctzle, T., Hoos, H.H.: Analyzing the run-time behaviour of iterated local search for the tsp. In: III Metaheuristics International Conference. Kluwer Academic Publishers (1999)"},{"issue":"4","key":"2_CR78","doi-asserted-by":"publisher","first-page":"473","DOI":"10.1287\/trsc.1030.0071","volume":"38","author":"B.W. Thomas","year":"2004","unstructured":"Thomas, B.W., White, I.: Chelsea\u00a0C. Anticipatory route selection. Transportation Science\u00a038(4), 473\u2013487 (2004)","journal-title":"Transportation Science"},{"key":"2_CR79","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D. (eds.): The vehicle routing problem. Society for Industrial and Applied Mathematics (2001)","DOI":"10.1137\/1.9780898718515"},{"volume-title":"Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization","year":"1999","key":"2_CR80","unstructured":"Voss, S., Osman, I.H., Roucairol, C. (eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer Academic Publishers, Norwell (1999)"},{"key":"2_CR81","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1287\/trsc.34.1.99.12278","volume":"34","author":"W.-H. Yang","year":"2000","unstructured":"Yang, W.-H., Mathur, K., Ballou, R.H.: Stochastic vehicle routing problem with restocking. Transportation Science\u00a034, 99\u2013112 (2000)","journal-title":"Transportation Science"}],"container-title":["Studies in Computational Intelligence","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30671-6_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,6]],"date-time":"2025-04-06T09:40:09Z","timestamp":1743932409000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30671-6_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642306709","9783642306716"],"references-count":81,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30671-6_2","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}