{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T04:14:15Z","timestamp":1759032855893},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642386213"},{"type":"electronic","value":"9783642386220"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38622-0_1","type":"book-chapter","created":{"date-parts":[[2013,6,2]],"date-time":"2013-06-02T21:36:08Z","timestamp":1370208968000},"page":"1-10","source":"Crossref","is-referenced-by-count":14,"title":["Ant Colony Algorithms for the Dynamic Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Barry","family":"van Veen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Emmerich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Thomas","family":"B\u00e4ck","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joost","family":"Kok","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"1_CR1","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.aei.2004.07.001","volume":"18","author":"J.E. Bell","year":"2004","unstructured":"Bell, J.E., McMullen, P.R.: Ant colony optimization techniques for the vehicle routing problem. Advanced Engineering Informatics\u00a018(1), 41\u201348 (2004)","journal-title":"Advanced Engineering Informatics"},{"issue":"4","key":"1_CR2","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012(4), 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"1_CR3","unstructured":"Colorni, A., Dorigo, M., Maniezzo, V.: Distributed optimization by ant colonies. In: Varela, F., Bourgine, P. (eds.) Proceedings of the First European Conference on Artificial Life, Paris, France, pp. 134\u2013142. Elsevier (1991)"},{"issue":"1","key":"1_CR4","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.M.: Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1007\/3-540-45724-0_8","volume-title":"ANTS 2002","author":"C.J. Eyckelhof","year":"2002","unstructured":"Eyckelhof, C.J., Snoek, M.: Ant systems for a dynamic TSP. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol.\u00a02463, pp. 88\u201399. Springer, Heidelberg (2002)"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/opre.4.1.61","volume":"4","author":"M.M. Flood","year":"1956","unstructured":"Flood, M.M.: The traveling-salesman problem. Operations Research\u00a04(1), 61 (1956)","journal-title":"Operations Research"},{"key":"1_CR7","unstructured":"Gambardella, L.M., Taillard, \u00c9., Agazzi, G.: MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, ch. 5, pp. 63\u201376. McGraw-Hill (1999)"},{"issue":"4","key":"1_CR8","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, \u00c9.: Parallel tabu search for real-time vehicle routing and dispatching. Transportation Science\u00a033(4), 381 (1999)","journal-title":"Transportation Science"},{"key":"1_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45724-0_10","volume-title":"Ant Algorithms","author":"M. Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: Applying population based ACO to dynamic optimization problems. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) ANTS 2002. LNCS, vol.\u00a02463, pp. 111\u2013122. Springer, Heidelberg (2002)"},{"key":"1_CR10","unstructured":"Kilby, P., Prosser, P., Shaw, P.: Dynamic VRPs: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde (September 1998)"},{"key":"1_CR11","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.M., Rizzoli, A.E., Donati, A.V.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization\u00a010, 327\u2013343 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"1_CR12","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H.N. Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Annals of Operations Research\u00a061, 143\u2013164 (1995)","journal-title":"Annals of Operations Research"},{"issue":"2","key":"1_CR13","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Operations Research\u00a035(2), 254\u2013265 (1987)","journal-title":"Operations Research"},{"key":"1_CR14","unstructured":"St\u00fctzle, T., Hoos, H.: Max-min ant system and local search for the traveling salesman problem. In: IEEE International Conference on Evolutionary Computation, pp. 309\u2013314 (April 1997)"},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9. Taillard","year":"1997","unstructured":"Taillard, \u00c9., Badeau, P., Gendreau, M., Guertin, F., Potvin, J.-Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science\u00a031(2), 170 (1997)","journal-title":"Transportation Science"}],"container-title":["Lecture Notes in Computer Science","Natural and Artificial Computation in Engineering and Medical Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38622-0_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:21:20Z","timestamp":1557750080000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38622-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642386213","9783642386220"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38622-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}