{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,7]],"date-time":"2026-04-07T22:00:23Z","timestamp":1775599223858,"version":"3.50.1"},"reference-count":28,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"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,10]]},"DOI":"10.1016\/s0305-0548(03)00158-8","type":"journal-article","created":{"date-parts":[[2003,6,2]],"date-time":"2003-06-02T19:15:45Z","timestamp":1054581345000},"page":"1985-2002","source":"Crossref","is-referenced-by-count":828,"title":["A simple and effective evolutionary algorithm for the vehicle routing problem"],"prefix":"10.1016","volume":"31","author":[{"given":"Christian","family":"Prins","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0305-0548(03)00158-8_BIB1","series-title":"Introduction to algorithms","author":"Cormen","year":"1990"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB2","series-title":"Fleet management and logistics","first-page":"p1","article-title":"Exact solution of the vehicle routing problem","author":"Toth","year":"1998"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB3","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","article-title":"Classical and modern heuristics for the vehicle routing problem","volume":"7","author":"Laporte","year":"2000","journal-title":"International Transactions in Operational Research"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB4","series-title":"Combinatorial optimization","first-page":"p315","article-title":"The vehicle routing problem","author":"Christofides","year":"1979"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB5","unstructured":"Gendreau M, Laporte G, Potvin J-Y. Metaheuristics for the vehicle routing problem. GERAD research report G-98-52, Montr\u00e9al, Canada, 1998."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB6","series-title":"Fleet management and logistics","first-page":"p33","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)00158-8_BIB7","unstructured":"Van Breedam A. An analysis of the effect of local improvement operators in GA and SA for the vehicle routing problem. RUCA working paper 96\/14, University of Antwerp, Belgium, 1996."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB8","unstructured":"Goldberg DE, Lingle R. Alleles, loci and the traveling salesman problem. In: Grefenstette JJ. editor. Proceedings of the First International Conference on Genetic Algorithms, Hillsdale, NJ: Lawrence Erlbaum, 1985. p. 154\u20139."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB9","unstructured":"Schmitt LJ. An empirical study computational study of genetic algorithms to solve order problems: an emphasis on TSP and VRPTC. PhD dissertation, University of Memphis, 1994."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB10","unstructured":"Schmitt LJ. An evaluation of a genetic algorithmic approach to the VRP. Working paper, Department of Information Technology Management, Christian Brothers University, Memphis, 1995."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB11","unstructured":"Oliver IM, Smith DJ, Holland JRC. A study of permutation crossover operators on the traveling salesman problem. In: Grefenstette JJ. editor. Proceedings of the Second International Conference on Genetic Algorithms. Hillsdale, NJ: Lawrence Erlbaum, 1987. p. 224\u201330."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF02125403","article-title":"Genetic algorithms for the traveling salesman problem","volume":"63","author":"Potvin","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB13","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows\u2014Part II","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB14","unstructured":"Thangiah SR. Vehicle routing with time windows using genetic algorithms. Report SRU-CpSc-TR-93-23, Slippery Rock University, Slippery Rock, 1993."},{"issue":"3","key":"10.1016\/S0305-0548(03)00158-8_BIB15","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/s001860000090","article-title":"Competitive genetic algorithms for the open-shop scheduling problem","volume":"52","author":"Prins","year":"2000","journal-title":"Mathematical Methods of Operations Research"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB16","series-title":"Applications of evolutionary computing","first-page":"p473","article-title":"A genetic algorithm for the Capacitated Arc Routing Problem and its extensions","volume":"vol. 2037","author":"Lacomme","year":"2001"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB17","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1016\/0305-0483(83)90033-6","article-title":"Route-first cluster-second methods for vehicle routing","volume":"11","author":"Beasley","year":"1983","journal-title":"Omega"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB18","unstructured":"Jaumard B, Semet F, Vovor T. A two-phase resource constrained shortest path algorithm for acyclic graphs. GERAD research report G-96-48, Montr\u00e9al, Canada, 1996."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB19","series-title":"New ideas in optimization","first-page":"p219","article-title":"Memetic algorithms: a short introduction","author":"Moscato","year":"1999"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB20","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)00158-8_BIB21","doi-asserted-by":"crossref","first-page":"503","DOI":"10.1057\/jors.1976.95","article-title":"A sequential route-building algorithm employing a generalized savings criterion","volume":"27","author":"Mole","year":"1976","journal-title":"Operational Research Quaterly"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB22","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"},{"issue":"5\u20136","key":"10.1016\/S0305-0548(03)00158-8_BIB23","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1023\/A:1012248319870","article-title":"High performing evolutionary techniques for solving complex location problems in industrial system design","volume":"12","author":"Cheung","year":"2001","journal-title":"Journal of Intelligent Manufacturing"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB24","unstructured":"The OR Library. http:\/\/mscmga.ms.ic.ac.uk\/jeb\/orlib."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB25","unstructured":"Large VRPs. http:\/\/www-bus.colorado.edu\/publications\/workingpapers\/kelly."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB26","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.30.4.379","article-title":"A network flow-based tabu search heuristic for the vehicle routing problem","volume":"30","author":"Xu","year":"1996","journal-title":"Transportation Science"},{"key":"10.1016\/S0305-0548(03)00158-8_BIB27","unstructured":"Toth P, Vigo D. The granular tabu search and its application to the VRP. Research Report OR-98-9, DEIS, University of Bologna, 1998, To appear in INFORMS Journal of Computing."},{"key":"10.1016\/S0305-0548(03)00158-8_BIB28","series-title":"Advances in evolutionary computing: theory and applications","article-title":"Scatter search","author":"Glover","year":"2002"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001588?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001588?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,20]],"date-time":"2019-03-20T21:24:43Z","timestamp":1553117083000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001588"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":28,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["S0305054803001588"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00158-8","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}