{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:54Z","timestamp":1778300994545,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540434320","type":"print"},{"value":"9783540460046","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-46004-7_2","type":"book-chapter","created":{"date-parts":[[2007,7,2]],"date-time":"2007-07-02T21:43:59Z","timestamp":1183412639000},"page":"11-20","source":"Crossref","is-referenced-by-count":27,"title":["SavingsAnts for the Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Karl","family":"Doerner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred","family":"Gronalt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard F.","family":"Hartl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Reimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christine","family":"Strauss","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Stummer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,3,14]]},"reference":[{"key":"2_CR1","volume-title":"Computers and Intractability: A Guide to the Theory of NP Completeness","author":"M. R. Garey","year":"1979","unstructured":"Garey, M. R. and Johnson, D. S.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman & Co., NewY ork (1979)"},{"key":"2_CR2","unstructured":"Colorni, A., Dorigo, M. and Maniezzo, V.: Distributed Optimization by Ant Colonies. In: Varela, F. and Bourgine, P. (Eds.): Proc. Europ. Conf. Artificial Life. Elsevier, Amsterdam (1991)"},{"issue":"3","key":"2_CR3","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1057\/palgrave.jors.2600357","volume":"48","author":"D. Costa","year":"1997","unstructured":"Costa, D. and Hertz, A.: Ants can colour graphs. Journal of the Operational Research Society 48(3) (1997) 295\u2013305","journal-title":"Journal of the Operational Research Society"},{"key":"2_CR4","volume-title":"NewIdeas in Optimization","author":"T. St\u00fctzle","year":"1999","unstructured":"St\u00fctzle, T. and Dorigo, M.: ACO Algorithms for the Quadratic Assignment Problem. In: Corne, D., Dorigo, M. and Glover, F. (Eds.): NewIdeas in Optimization. Mc Graw-Hill, London (1999)"},{"issue":"1","key":"2_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M. and Gambardella, L. M.: Ant Colony System: A cooperative learning approach to the Travelling Salesman Problem. IEEE Transactions on Evolutionary Computation 1(1) (1997) 53\u201366","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"2_CR6","first-page":"25","volume":"7","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: A newrank based version of the ant system: a computational study. Central European Journal of Operations Research 7(1) (1999) 25\u201338","journal-title":"Central European Journal of Operations Research"},{"key":"2_CR7","doi-asserted-by":"crossref","unstructured":"Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: Applying the ant system to the vehicle routing problem. In: Voss, S., Martello, S., Osman, I. H. and Roucairol, C. (Eds.): Meta-Heuristics: Advances and Trends in Local Search Paradigms for Optimization. Kluwer, Boston (1999)","DOI":"10.1007\/978-1-4615-5775-3_20"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1018940026670","volume":"89","author":"B. Bullnheimer","year":"1999","unstructured":"Bullnheimer, B., Hartl, R. F. and Strauss, Ch.: An improved ant system algorithm for the vehicle routing problem. Annals of Operations Research 89 (1999) 319\u2013328","journal-title":"Annals of Operations Research"},{"key":"2_CR9","volume-title":"NewIdeas in Optimization","author":"L. M. Gambardella","year":"1999","unstructured":"Gambardella, L. M., Taillard, E. and Agazzi, G.: MACS-VRPTW: A Multiple Ant Colony System for Vehicle Routing Problems with Time Windows. In: Corne, D., Dorigo, M. and Glover, F. (Eds.): NewIdeas in Optimization. McGraw-Hill, London (1999)"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","volume":"16","author":"W. J. Gutjahr","year":"2000","unstructured":"Gutjahr, W. J.: A graph-based Ant System and its convergence. Future Generation Computing Systems. 16 (2000) 873\u2013888","journal-title":"Future Generation Computing Systems."},{"key":"2_CR11","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G. and Wright, J. W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research 12 (1964) 568\u2013581","journal-title":"Operations Research"},{"key":"2_CR12","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G. A. Croes","year":"1958","unstructured":"Croes, G. A.: A method for solving Traveling Salesman Problems. Operations Research 6 (1958) 791\u2013801","journal-title":"Operations Research"},{"key":"2_CR13","unstructured":"Christofides, N., Mingozzi, A. and Toth, P.: The vehicle routing problem. In: Christofides, N., Mingozzi, A., Toth, P. and Sandi, C. (Eds.): Combinatorial Optimization. Wiley, Chicester (1979)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. D. Taillard","year":"1993","unstructured":"Taillard, E. D.: Parallel iterative search methods for vehicle routing problems. Networks 23 (1993) 661\u2013673","journal-title":"Networks"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y. and Taillard, E. D.: Probabilistic Diversification and Intensification in Local Search for Vehicle Routing. Journal of Heuristics 1 (1995) 147\u2013167","journal-title":"Journal of Heuristics"},{"key":"2_CR16","volume-title":"Meta-Heuristics:Theory and Applications","author":"C. Rego","year":"1996","unstructured":"Rego, C. and Roucairol, C.: A parallel tabu search algorithm using ejection chains for the vehicle routing problem. In: Osman, I. H. and Kelly, J. (Eds.): Meta-Heuristics:Theory and Applications. Kluwer, Boston (1996)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A. and Laporte, G.:A tabu search heuristic for the vehicle routing problem. Management Science 40 (1994) 1276\u20131290","journal-title":"Management Science"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I. H. Osman","year":"1993","unstructured":"Osman, I. H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Annals of Operations Research 41 (1993) 421\u2013451","journal-title":"Annals of Operations Research"},{"key":"2_CR19","unstructured":"Doerner, K. F., Hartl, R.F., and Reimann, M.: Are CompetANTS competent for problem solving-the case of a transportation problem. POM Working Paper 01\/2001"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46004-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T11:35:23Z","timestamp":1550403323000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46004-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540434320","9783540460046"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-46004-7_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}