{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,6]],"date-time":"2026-03-06T04:29:07Z","timestamp":1772771347072,"version":"3.50.1"},"reference-count":34,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2004,4,1]],"date-time":"2004-04-01T00:00:00Z","timestamp":1080777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1016\/s0305-0548(03)00014-5","type":"journal-article","created":{"date-parts":[[2003,4,5]],"date-time":"2003-04-05T00:18:15Z","timestamp":1049501895000},"page":"563-591","source":"Crossref","is-referenced-by-count":288,"title":["D-Ants: Savings Based Ants divide and conquer the vehicle routing problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Marc","family":"Reimann","sequence":"first","affiliation":[]},{"given":"Karl","family":"Doerner","sequence":"additional","affiliation":[]},{"given":"Richard F","family":"Hartl","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00014-5_BIB1","series-title":"The traveling salesman problem","article-title":"Vehicle routing","author":"Christofides","year":"1985"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB2","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D, editors. The vehicle routing problem. Philadelphia: Siam, 2002.","DOI":"10.1137\/1.9780898718515"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB3","series-title":"Computers and intractability: a guide to the theory of NP completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB4","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","article-title":"Scheduling of vehicles from a central depot to a number of delivery points","volume":"12","author":"Clarke","year":"1964","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB5","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1287\/opre.6.6.791","article-title":"A method for solving traveling salesman problems","volume":"6","author":"Croes","year":"1958","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB6","unstructured":"Reimann M, Stummer M, Doerner K. A savings based ant system for the vehicle routing problem. In: Langdon WB et al., editors. Proceedings of the Genetic and Evolutionary Computation Conference (GECCO 2002). San Francisco: Morgan Kaufmann, 2002."},{"key":"10.1016\/S0305-0548(03)00014-5_BIB7","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","article-title":"Parallel iterative search methods for vehicle routing problems","volume":"23","author":"Taillard","year":"1993","journal-title":"Networks"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB8","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D. The granular tabu search and its application to the vehicle routing problem. INFORMS Journal on Computing, 2002, in press.","DOI":"10.1287\/ijoc.15.4.333.24890"},{"issue":"5","key":"10.1016\/S0305-0548(03)00014-5_BIB9","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","article-title":"A guide to vehicle routing heuristics","volume":"53","author":"Cordeau","year":"2002","journal-title":"Journal of Operational Research Society"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB10","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","article-title":"A heuristic algorithm for the vehicle dispatch problem","volume":"22","author":"Gillett","year":"1974","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB11","series-title":"Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB12","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","article-title":"Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB13","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","article-title":"A tabu search heuristic for the vehicle routing problem","volume":"40","author":"Gendreau","year":"1994","journal-title":"Management Science"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB14","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB15","series-title":"Meta-heuristics: theory and applications","article-title":"A parallel tabu search algorithm using ejection chains for the vehicle routing problem","author":"Rego","year":"1996"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB16","unstructured":"Cordeau JF, Laporte G. Tabu search heuristics for the vehicle routing problem. GERAD Technical report G-2002-15, University of Montreal, Canada, 2002."},{"key":"10.1016\/S0305-0548(03)00014-5_BIB17","series-title":"Applications of evolutionary computing","article-title":"Savings Ants for the vehicle routing problem","author":"Doerner","year":"2002"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB18","unstructured":"Colorni A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies. In: Varela F, Bourgine P, editors. Proceedings of the European Conference on Artificial Life. Amsterdam: Elsevier, 1991."},{"key":"10.1016\/S0305-0548(03)00014-5_BIB19","doi-asserted-by":"crossref","first-page":"873","DOI":"10.1016\/S0167-739X(00)00044-3","article-title":"A graph-based ant system and its convergence","volume":"16","author":"Gutjahr","year":"2000","journal-title":"Future Generation Computing Systems"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB20","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0020-0190(01)00258-7","article-title":"ACO algorithms with guaranteed convergence to the optimal solution","volume":"82","author":"Gutjahr","year":"2002","journal-title":"Information Processing Letters"},{"issue":"4","key":"10.1016\/S0305-0548(03)00014-5_BIB21","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1109\/TEVC.2002.802444","article-title":"A short convergence proof for a class of ACO algorithms","volume":"6","author":"Stuetzle","year":"2002","journal-title":"IEEE Transactions on Evolutionary Computation"},{"issue":"1","key":"10.1016\/S0305-0548(03)00014-5_BIB22","first-page":"25","article-title":"A new rank based version of the ant system","volume":"7","author":"Bullnheimer","year":"1999","journal-title":"Central European Journal of Operations Research"},{"issue":"1","key":"10.1016\/S0305-0548(03)00014-5_BIB23","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","article-title":"Any colony system","volume":"1","author":"Dorigo","year":"1997","journal-title":"IEEE Transactions on Evolutionary computation"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB24","series-title":"New ideas in optimization","article-title":"The ant colony optimization meta-heuristic","author":"Dorigo","year":"1999"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB25","doi-asserted-by":"crossref","unstructured":"Stuetzle T, Hoos H. Improvements on the ant system: introducing the max\u2013min ant system. In: Smith GD et al., editors. Proceedings of Artificial Neural Nets and Genetic Algorithms 1997. Wien: Springer, 1998.","DOI":"10.1007\/978-3-7091-6492-1_54"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB26","series-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","article-title":"The max\u2013min ant system and local search for combinatorial optimization problems","author":"Stuetzle","year":"1998"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB27","series-title":"Swarm intelligence","author":"Bonabeau","year":"1999"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB28","series-title":"Meta-heuristics: advances and trends in local search paradigms for optimization","article-title":"Applying the ant system to the vehicle routing problem","author":"Bullnheimer","year":"1999"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB29","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1023\/A:1018940026670","article-title":"An improved ant system algorithm for the vehicle routing problem","volume":"89","author":"Bullnheimer","year":"1999","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB30","series-title":"Cluster-Analyse-Algorithmen zur Objektklassifizierung und Datenreduktion","author":"Spaeth","year":"1977"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB31","series-title":"Combinatorial optimization","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB32","series-title":"Fleet management and logistics","article-title":"The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results","author":"Golden","year":"1998"},{"key":"10.1016\/S0305-0548(03)00014-5_BIB33","unstructured":"Prins C. A simple and effective evolutionary algorithm for the vehicle routing problem. Research Report, University of Technology of Troyes, France, 2001."},{"key":"10.1016\/S0305-0548(03)00014-5_BIB34","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","article-title":"A subpath ejection method for the vehicle routing problem","volume":"44","author":"Rego","year":"1998","journal-title":"Management Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000145?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803000145?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,18]],"date-time":"2020-03-18T09:34:10Z","timestamp":1584524050000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803000145"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["S0305054803000145"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00014-5","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}