{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T09:32:03Z","timestamp":1773653523202,"version":"3.50.1"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2007,1,27]],"date-time":"2007-01-27T00:00:00Z","timestamp":1169856000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2007,6,18]]},"DOI":"10.1007\/s10489-006-0033-z","type":"journal-article","created":{"date-parts":[[2007,1,26]],"date-time":"2007-01-26T20:36:37Z","timestamp":1169843797000},"page":"89-99","source":"Crossref","is-referenced-by-count":129,"title":["Dynamic vehicle routing using genetic algorithms"],"prefix":"10.1007","volume":"27","author":[{"given":"Franklin T.","family":"Hanshar","sequence":"first","affiliation":[]},{"given":"Beatrice M.","family":"Ombuki-Berman","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,1,27]]},"reference":[{"key":"33_CR1","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) A new algorithm for a dynamic vehicle routing problem based on Ant colony system. J Comb Optim 10:327\u2013343","journal-title":"J Comb Optim"},{"issue":"4","key":"33_CR2","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1287\/trsc.1030.0074","volume":"38","author":"B Fleischmann","year":"2004","unstructured":"Fleischmann B, Gnutzmann S, Sandvob E (2004) Dynamic vehicle routing based on online traffic information. Trans Sci 38(4):420\u2013433","journal-title":"Trans Sci"},{"key":"33_CR3","unstructured":"Bianchi L (2000) Notes on dynamic vehicle routing\u2014the state of the art. Technical Report IDSIA-05-01 Istituto Dalle Molle di Studi sull\u2019Intelligenza Artificiale"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Gendreau M, Potvin J-Y (1998) Dynamic vehicle routing and dispatching. In: Crainic TG, Lapoorte G (eds) Fleet management and logistics, pp 115\u2013226","DOI":"10.1007\/978-1-4615-5755-5_5"},{"issue":"3","key":"33_CR5","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/j.trc.2006.03.002","volume":"14","author":"M Gendreau","year":"2006","unstructured":"Gendreau M, Guertin F, Potvin J-Y, Seguin R (2006) Neighborhood search heuristics for a dynamic vehicle dispatching problem with pick-ups and deliveries. Trans Res, Part C 14(3):157\u2013174","journal-title":"Trans Res, Part C"},{"key":"33_CR6","unstructured":"Bent R, Hentenryck P (2003) Van dynamic vehicle routing with stochastic requests. In: Proceedings of the eighteenth international joint conference on artificial intelligence (IJCAI-2003). Acapulco, Mexico, pp 1362\u20131363"},{"key":"33_CR7","unstructured":"Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Technical Report APES-0-1998, University of Strathclyde"},{"issue":"4","key":"33_CR8","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Geurtin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Trans Sci 33(4):381\u2013390","journal-title":"Trans Sci"},{"issue":"4","key":"33_CR9","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/trsc.34.4.426.12325","volume":"34","author":"S Ichoua","year":"2000","unstructured":"Ichoua S, Gendreau M, Potvin J-Y (2000) Diversion issues in real-time vehicle dispatching. Trans Sci 34(4):426\u2013438","journal-title":"Trans Sci"},{"key":"33_CR10","doi-asserted-by":"crossref","unstructured":"Ichoua S, Gendreau M, Potvin JY (2005) Exploiting knowledge about future demands for real-time vehicle dispatching. Forthcoming in Trans Sci","DOI":"10.1287\/trsc.1050.0114"},{"key":"33_CR11","unstructured":"Zhu K, Ong K (2000) A reactive method for real time dynamic vehicle routing problems. In: 12th ICTAI 2000. Vancouver, Canada"},{"issue":"3","key":"33_CR12","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1016\/j.ejor.2005.02.038","volume":"175","author":"L Coslovich","year":"2006","unstructured":"Coslovich L, Pesenti R, Ukovich W (2006) A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem. Eur J Oper Res 175(3):1605\u20131615","journal-title":"Eur J Oper Res"},{"key":"33_CR13","unstructured":"Caramia M, Italiano GF, Oriolo G, Pacifici A, Perugia A (2001) Routing a fleet of vehicles for dynamic combined pick-up and deliveries services. In: Symposium on operations research, Duisburg, Germany, 3\u20135 Sept. 2001. Springer-Verlag, Berlin, pp 3\u20138"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Krumke SO, Rambau J, Torres LM (2002) Real-time dispatching of guided and unguided automobile service units with soft time windows. In: M\u00f6hring R et al. (eds) Appeared in: Algorithms\u2014ESA 2002. Proceedings of the 10th european symposium on algorithms, Rome, Italy, September 17\u201321, 2002. Springer, Berlin 2002. LNCS 2461, pp 637\u2013648","DOI":"10.1007\/3-540-45749-6_56"},{"key":"33_CR15","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"MWP Savelsbergh","year":"1998","unstructured":"Savelsbergh MWP, Sol M (1998) DRIVE: dynamic routing of independent vehicles georgia institute of technology. Oper Res 46:474\u2013490","journal-title":"Oper Res"},{"key":"33_CR16","unstructured":"Larsen A (2003) The a-priori dynamic traveling salesman problem with time windows. In: ODYSEUS 2003\u2014second international workshop on freight transportation and logistics. Palermo, Italien, pp 27\u201330"},{"key":"33_CR17","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2002) Applying population based ACO to dynamic optimization problems. In: Dorigo et al (eds), ANTS 2002, Lecture Notes in Computer Science 2463, pp 111\u2013122","DOI":"10.1007\/3-540-45724-0_10"},{"key":"33_CR18","unstructured":"Psaraftis H (1988) Dynamic vehicle routing problems. In: Golden BL, Assad AA (eds) Vehicle routing: methods and studies, pp 223\u2013248"},{"key":"33_CR19","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H Psaraftis","year":"1995","unstructured":"Psaraftis H (1995) Dynamic vehicle routing: status and prospects. Ann Oper Res 61:143\u2013164","journal-title":"Ann Oper Res"},{"key":"33_CR20","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logisitics","author":"BL Golden","year":"1998","unstructured":"Golden BL, Wasil EA, Kelly JP, Chao IM (1998) The impact of metaheuristics on the solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Fleet management and logisitics, Kluwer, Dordrecht pp 33\u201356"},{"key":"33_CR21","unstructured":"Toth P, Vigo D (2003) The granular Tabu search and its application to the VRP. Research Report OR-98\u20139, DEIS, University of Bologna, 1998, to appear in INFORMS Journal of Computing. ACM"},{"key":"33_CR22","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability, a guide to the theory of NP-completeness. W. H. Freeman and Company"},{"key":"33_CR23","unstructured":"Holland JH (1992) Adaptation in natural and artificial systems university of michigan press Second Edition. MIT Press"},{"key":"33_CR24","doi-asserted-by":"crossref","unstructured":"Branke J (2002) Evolutionary optimization in dynamic environments. Kluwer Academic Publishers","DOI":"10.1007\/978-1-4615-0911-0"},{"issue":"1","key":"33_CR25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki B, Ross BJ, Hanshar F (2006) Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl Intell 24(1):17\u201330","journal-title":"Appl Intell"},{"key":"33_CR26","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1080\/08839510151087293","volume":"15","author":"SR Thangiah","year":"2001","unstructured":"Thangiah SR, Salhi S (2001) Genetic clustering: an adaptive heuristic for the multi-depot vehicle routing problem. Appl Artif Intell 15:361\u2013383","journal-title":"Appl Artif Intell"},{"key":"33_CR27","unstructured":"Ombuki B, Nakamura M, Maeda O (2002) A hybrid search based on genetic algorithms and Tabu search for vehicle routing. In: Banff AB, Leung H (eds) 6th IASTED intl. conf. on artificial intelligence and soft computing (ASC 2002). ACTA Press, pp 176\u2013181"},{"key":"33_CR28","unstructured":"Whitley D, Starkweather T, Shaner D (1989) Scheduling problems and traveling salesman: the genetic edge recombination. In: Proceedings of the 3rd international conference on genetic algorithms, pp 133\u2013140"},{"key":"33_CR29","unstructured":"Ombuki B, Hanshar F (2004) An effective genetic algorithm for the multi-depot vehicle routing problem. submitted, Preliminary version at Brock COSC TR CS-04-10"},{"key":"33_CR30","doi-asserted-by":"crossref","unstructured":"Mitchell M (1996) An introduction to genetic algorithms. MIT Press","DOI":"10.7551\/mitpress\/3927.001.0001"},{"issue":"8","key":"33_CR31","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9D Taillard","year":"1994","unstructured":"Taillard \u00c9D (1994) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"key":"33_CR32","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N Christophides","year":"1984","unstructured":"Christophides N, Beasley J (1984) The period routing problem. Networks 14:237\u2013256","journal-title":"Networks"},{"key":"33_CR33","doi-asserted-by":"crossref","unstructured":"Fisher ML (1995) Vehicle routing. Handbooks Oper Res Manage Sci 8","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"33_CR34","doi-asserted-by":"crossref","unstructured":"Glover F (1990)Tabu search\u2014part II. ORSA J Comput 2(1), Winter 4\u201332","DOI":"10.1287\/ijoc.2.1.4"},{"key":"33_CR35","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard ED (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147\u2013167","journal-title":"J Heuristics"},{"key":"33_CR36","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"W Nanry","year":"2000","unstructured":"Nanry W, Barnes J (2000) Solving the pickup and delivery problem with time windows using Tabu search. Trans Res Part B 34:107\u2013121","journal-title":"Trans Res Part B"},{"issue":"3","key":"33_CR37","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/j.parco.2003.12.001","volume":"30","author":"A Attanassio","year":"2004","unstructured":"Attanassio A, Cordeau JF, Ghiani G, Laporte G (2004) Parallel Tabu search heuristics for the dynamic multi-vehicle dial-a-ride problem. Parallel Comput 30(3):377\u2013387","journal-title":"Parallel Comput"},{"key":"33_CR38","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"OH Ibrahim","year":"1993","unstructured":"Ibrahim OH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Ann Opera Res 41:421\u2013451","journal-title":"Ann Opera Res"},{"key":"33_CR39","unstructured":"Larsen A (2000) The dynamic vehicle routing problem. Ph.D. Thesis, Technical University of Denmark"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0033-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-006-0033-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-006-0033-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T06:30:13Z","timestamp":1736749813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-006-0033-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,1,27]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2007,6,18]]}},"alternative-id":["33"],"URL":"https:\/\/doi.org\/10.1007\/s10489-006-0033-z","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,1,27]]}}}