{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,21]],"date-time":"2026-06-21T05:37:57Z","timestamp":1782020277266,"version":"3.54.5"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T00:00:00Z","timestamp":1133395200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2005,12]]},"DOI":"10.1007\/s10878-005-4922-6","type":"journal-article","created":{"date-parts":[[2005,11,16]],"date-time":"2005-11-16T10:33:08Z","timestamp":1132137188000},"page":"327-343","source":"Crossref","is-referenced-by-count":332,"title":["Ant Colony System for a Dynamic Vehicle Routing Problem"],"prefix":"10.1007","volume":"10","author":[{"given":"R.","family":"Montemanni","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"L. M.","family":"Gambardella","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. E.","family":"Rizzoli","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"A. V.","family":"Donati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"4922_CR1","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1038\/35017500","volume":"406","author":"E. Bonabeau","year":"2000","unstructured":"E. Bonabeau, M. Dorigo, and G. Theraulaz, \u201cInspiration for optimization from social insect behaviour,\u201d Nature, vol. 406, pp. 39\u201342, 2000.","journal-title":"Nature"},{"key":"4922_CR2","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"N. Christofides and J. Beasley, \u201cThe period routing problem,\u201d Networks, vol. 14, pp. 237\u2013256, 1984.","journal-title":"Networks"},{"key":"4922_CR3","unstructured":"A. Colorni, M. Dorigo, and V. Maniezzo, \u201cDistributed optimization by ant colonies,\u201d in Elsevier Publishing (eds.), European Conference on Artificial Life 1991 (ECAL91), 1991, pp. 134\u2013142."},{"key":"4922_CR4","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1162\/106454699568728","volume":"5","author":"M. Dorigo","year":"1999","unstructured":"M. Dorigo, G. Di Caro, and L.M. Gambardella, \u201cAnt algorithms for discrete optimization,\u201d Artificial Life, vol. 5, pp. 137\u2013172, 1999.","journal-title":"Artificial Life"},{"key":"4922_CR5","doi-asserted-by":"crossref","unstructured":"M. Dorigo, V. Maniezzo, and A. Colorni, \u201cThe ant system: optimization by a colony of cooperating agents,\u201d IEEE Transactions on Systems, Man and Cybernetics\u2014Part B: Cybernetics, vol. 26, no. 1, 29\u201341, 1996.","DOI":"10.1109\/3477.484436"},{"key":"4922_CR6","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M. Fisher","year":"1981","unstructured":"M. Fisher, R. Jakumar, and L. van Wassenhove, \u201cA generalized assignment heuristic for vehicle routing,\u201d Networks, vol. 11, pp. 109\u2013124, 1981.","journal-title":"Networks"},{"key":"4922_CR7","doi-asserted-by":"crossref","unstructured":"L.M. Gambardella and M. Dorigo, \u201cSolving symmetric and asymmetric TSPs by ant colonies,\u201d in IEEE Conference on Evolutionary Computation (ICEC96), 1996, pp. 622\u2013627.","DOI":"10.1109\/ICEC.1996.542672"},{"key":"4922_CR8","unstructured":"L.M. Gambardella, \u00c9. Taillard, and G. Agazzi, \u201cMACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows,\u201d in D. Corne et al. (eds.), New Ideas in Optimization, pp. 63\u201376, 1999."},{"key":"4922_CR9","doi-asserted-by":"crossref","unstructured":"M. Gendreau, F. Guertin, J.-Y. Potvin, and \u00c9. Taillard, \u201cParallel tabu search for real-time vehicle routing and dispatching,\u201d Transportation Science, vol. 33, no. 4, pp. 381\u2013390, 1999.","DOI":"10.1287\/trsc.33.4.381"},{"key":"4922_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/0377-2217(95)00050-X","volume":"88","author":"M. Gendreau","year":"1996a","unstructured":"M. Gendreau, G. Laporte, and R. S\u00e9guin, \u201cStochastic vehicle routing,\u201d European Journal of Operational Research, vol. 88, pp. 3\u201312, 1996a.","journal-title":"European Journal of Operational Research"},{"key":"4922_CR11","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M. Gendreau","year":"1996b","unstructured":"M. Gendreau, G. Laporte, and R. S\u00e9guin, \u201cA tabu search heuristic for the vehicle routing problem with stochastic demands and customers,\u201d Operations Research, vol. 44, pp. 469\u2013477, 1996b.","journal-title":"Operations Research"},{"key":"4922_CR12","doi-asserted-by":"crossref","unstructured":"M. Gendreau and J.-Y. Potvin, \u201cDynamic vehicle routing and dispatching,\u201d in T.G. Crainic and G. Laporte (eds.), Fleet Management and Logistic, pp. 115\u2013226, 1998.","DOI":"10.1007\/978-1-4615-5755-5_5"},{"key":"4922_CR13","doi-asserted-by":"crossref","unstructured":"M. Guntsch and M. Middendorf, \u201cPheromone modification strategies for ant algorithms applied to dynamic TSP,\u201d in E.J.W. Boers et al. (eds.), Application of evolutionary computing: Proceedings of EcoWorkshops 2001, volume Lecture Notes in Computer Science 2037, 2001, pp. 213\u2013222.","DOI":"10.1007\/3-540-45365-2_22"},{"key":"4922_CR14","doi-asserted-by":"crossref","unstructured":"M. Guntsch and M. Middendorf, \u201cApplying population based ACO to dynamic optimization problems,\u201d in M. Dorigo et al. (eds.), ANTS 2002, volume Lecture Notes in Computer Science 2463, 2002, pp. 111\u2013122.","DOI":"10.1007\/3-540-45724-0_10"},{"key":"4922_CR15","unstructured":"L.M. Hvattum, A. Lokketangen, and G. Laporte, \u201cA heuristic solution method to a stochastic vehicle routing problem,\u201d in Proceedings of TRISTAN V\u2014The Fifth Triennial Symposium on Transportation Analysis, 2004."},{"key":"4922_CR16","doi-asserted-by":"crossref","unstructured":"S. Ichoua, M. Gendreau, and J.-Y. Potvin, \u201cDiversion issues in real-time vehicle dispatching,\u201d Transportation Science, vol. 34, no. 4, pp. 426\u2013438, November 2000.","DOI":"10.1287\/trsc.34.4.426.12325"},{"key":"4922_CR17","unstructured":"P. Kilby, P. Prosser, and P. Shaw, \u201cDynamic VRPs: A study of scenarios,\u201d Technical Report APES-06-1998, University of Strathclyde, U.K., 1998."},{"key":"4922_CR18","doi-asserted-by":"crossref","unstructured":"G. Kontoravdis and J.F. Brand, \u201cA GRASP for the vehicle routing problem with time windows,\u201d ORSA Journal on Computing, vol. 7, no. 1, pp. 10\u201323, 1995.","DOI":"10.1287\/ijoc.7.1.10"},{"key":"4922_CR19","unstructured":"H. Psaraftis, \u201cDynamic vehicle routing problems,\u201d in B.L. Golden and A.A. Assad (eds.), Vehicle Routing: methods and Studies, 1988, pp. 223\u2013248."},{"key":"4922_CR20","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H. Psaraftis","year":"1995","unstructured":"H. Psaraftis, \u201cDynamic vehicle routing: status and prospects,\u201d Annals of Operations Research, vol. 61, pp. 143\u2013164, 1995.","journal-title":"Annals of Operations Research"},{"key":"4922_CR21","doi-asserted-by":"crossref","unstructured":"M.G.C. Resende and C.C. Ribeiro, \u201cGreedy Randomized Adaptive search procedures,\u201d in F. Glover and G. Kochenberger (eds.), Handbook of Metaheuristics, 2003, pp. 219\u2013249.","DOI":"10.1007\/0-306-48056-5_8"},{"key":"4922_CR22","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1287\/opre.46.4.474","volume":"46","author":"M.W.P. Savelsbergh","year":"1998","unstructured":"M.W.P. Savelsbergh and M. Sol, \u201cDRIVE: Dynamic routing of independent VEhicles,\u201d Operations Research, vol. 46, pp. 474\u2013490, 1998.","journal-title":"Operations Research"},{"key":"4922_CR23","unstructured":"M. Sol, Column generation techniques for pickup and delivery problems. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1994."},{"key":"4922_CR24","doi-asserted-by":"crossref","unstructured":"\u00c9. Taillard, \u201cParallel iterative search methods for vehicle-routing problems,\u201d Networks, vol. 23, no. 8, pp. 661\u2013673, 1994.","DOI":"10.1002\/net.3230230804"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4922-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-005-4922-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-005-4922-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:09Z","timestamp":1559261889000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-005-4922-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,12]]},"references-count":24,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2005,12]]}},"alternative-id":["4922"],"URL":"https:\/\/doi.org\/10.1007\/s10878-005-4922-6","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,12]]}}}