{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,27]],"date-time":"2025-10-27T20:29:40Z","timestamp":1761596980238,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540372776"},{"type":"electronic","value":"9783540372820"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11816102_4","type":"book-chapter","created":{"date-parts":[[2006,8,31]],"date-time":"2006-08-31T16:43:03Z","timestamp":1157042583000},"page":"33-38","source":"Crossref","is-referenced-by-count":15,"title":["Ant Colony System for Optimizing Vehicle Routing Problem with Time Windows (VRPTW)"],"prefix":"10.1007","author":[{"given":"Xuan","family":"Tan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaolan","family":"Zhuo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jun","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Arbelaitz, O., Rodriguez, C., Zamakola, I.: Low Cost Parallel Solutions for the VRPTW Optimization Problem. In: Parallel Processing Workshops, pp. 176\u2013181 (2001)","DOI":"10.1109\/ICPPW.2001.951932"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Boudali, I., Fki, W., Ghedira, K.: How to Deal with the VRPTW by Using Multi-Agent Coalitions. In: Hybrid Intelligent Systems. Proceedings, pp. 416\u2013421 (2004)","DOI":"10.1109\/ICHIS.2004.54"},{"key":"4_CR3","unstructured":"Lim, A., Wang, F.: A Smoothed Dynamic Tabu Search Embedded GRASP for m-VRPTW. In: Tools with Artificial Intelligence. ICTAI 2004, pp. 704\u2013708 (2004)"},{"key":"4_CR4","unstructured":"Gambardella., L.M., Taillard., E., Agazzi., G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. New Ideas in Optimization, 63\u201376 (1999)"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1109\/TNN.2004.824424","volume":"15","author":"D.S. Huang","year":"2004","unstructured":"Huang, D.S.: A Constructive Approach for Finding Arbitrary Roots of Polynomials by Neural Networks. IEEE Transactions on Neural Networks\u00a015, 477\u2013491 (2004)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TNN.2005.844912","volume":"16","author":"D.S. Huang","year":"2005","unstructured":"Huang, D.S., Horace, H.K., Chi, Z.: Zeroing Polynomials Using Modified Constrained Neural Network Approach. IEEE Trans On Neural Networks\u00a016, 721\u2013732 (2005)","journal-title":"IEEE Trans On Neural Networks"},{"key":"4_CR7","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 Trans. on evolutionary computation\u00a01, 53\u201366 (1997)","journal-title":"IEEE Trans. on evolutionary computation"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. Solomon","year":"1987","unstructured":"Solomon, M.: Algorithms for the Vehicle Routing and Scheduling Problem with Time Window Constraints. Operations Research\u00a035, 254\u2013265 (1987)","journal-title":"Operations Research"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics\u00a01, 147\u2013167 (1995)","journal-title":"Journal of Heuristics"},{"key":"4_CR10","doi-asserted-by":"crossref","unstructured":"Kohl, N., Desrosiers, J., Madsen, O.B.G., Solomon, M.M., Soumis, F.: 2-Path Cuts for the Vehicle Routing Problem with Time Windows. Transportation Science, 101\u2013116 (1999)","DOI":"10.1287\/trsc.33.1.101"},{"key":"4_CR11","unstructured":"Li, H., Lim, A., Huang, J.: Local Search with Annealing-like Restarts to Solve the VRPTW. Working Paper, Department of Computer Science, National University of Singapore (2001)"},{"key":"4_CR12","unstructured":"Irnich, S., Villeneuve, D.: The Shortest Path Problem with K-cycle Elimination (k \u2265 3): Improving a Branch-and-Price Algorithm for the VRPTW. INFORMS Journal of Computing"},{"key":"4_CR13","unstructured":"Cook, W., Rich, J.L.: A Parallel Cutting Plane Algorithm for the VRPTW. Working Paper, Computational and Applied Mathematics, Rice University, Houston, TX (1999)"},{"key":"4_CR14","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.G.: Lagrangean Duality and Non-Differentiable Optimization Applied on Routing with Time Windows - Experimental Results. Internal report IMM-REP-2000-8, Technical University of Denmark, Lyngby, Denmark (2000)"}],"container-title":["Lecture Notes in Computer Science","Computational Intelligence and Bioinformatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11816102_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,10]],"date-time":"2025-01-10T18:44:07Z","timestamp":1736534647000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11816102_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540372776","9783540372820"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/11816102_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}