{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,20]],"date-time":"2026-03-20T15:38:13Z","timestamp":1774021093405,"version":"3.50.1"},"reference-count":25,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2001,7,1]],"date-time":"2001-07-01T00:00:00Z","timestamp":993945600000},"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":["Artificial Intelligence in Engineering"],"published-print":{"date-parts":[[2001,7]]},"DOI":"10.1016\/s0954-1810(01)00005-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T08:02:33Z","timestamp":1027584153000},"page":"281-295","source":"Crossref","is-referenced-by-count":206,"title":["Heuristic methods for vehicle routing problem with time windows"],"prefix":"10.1016","volume":"15","author":[{"given":"K.C","family":"Tan","sequence":"first","affiliation":[]},{"given":"L.H","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Q.L","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"K","family":"Ou","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0954-1810(01)00005-X_BIB1","unstructured":"Blanton Jr JL, Wainwright RL. Multiple vehicle routing with time and capacity constraints using genetic algorithms. In: Proceedings of the Fifth International Conference on Genetic Algorithms, 1993."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB2","series-title":"Distribution management: mathematical modeling and practical analysis","author":"Eilon","year":"1971"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB3","unstructured":"Fisher ML, Jornsten KO, Madsen OBG. Vehicle routing with time windows. Working Paper, 1992."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB4","doi-asserted-by":"crossref","unstructured":"Fisher ML. Vehicle routing, Handbooks in operations research and management science, vol. 8. Amsterdam, New York: Elsevier, 1995","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB5","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":"Mgmt Sci"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB6","series-title":"Manuel laguna, Tabu search","author":"Glover","year":"1997"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB7","series-title":"Adaptation in natural and artificial systems","author":"Holland","year":"1975"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB8","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"20","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB9","unstructured":"Kohl N, Madson O. An optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation. Working Paper, 1995."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB10","doi-asserted-by":"crossref","unstructured":"Kolen AWJ, Kan A.H.G.R., Trienekens HWJM. Vehicle routing with time windows Oper Res 1987;35:266\u2013274.","DOI":"10.1287\/opre.35.2.266"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB11","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equations of state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J Chem Phys"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB12","unstructured":"Oliver IM, Smith DJ, Holland JRC. A study of permutation crossover operations on the traveling salesman problem. In: Proceedings of the Fourth International Conference on Genetic Algorithms, 1991."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB13","unstructured":"Osman IH, Christofides N. Simulated annealing and descent algorithms for capacitated clustering problem. Research Report. Imperial College, University of London, 1989."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB14","first-page":"777","article-title":"Meta-strategy simulated annealing and Tabu search algorithms for the vehicle routing problem","volume":"41","author":"Osman","year":"1993","journal-title":"Annu Oper Res"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","article-title":"The vehicle routing problem with time windows. Part I. Tabu search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS J Comput"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB16","doi-asserted-by":"crossref","unstructured":"Prinetto P, Rebaudengo M, Sonza Reorda M. Hybrid genetic algorithms for the traveling salesman problem. In: Proceedings of the Fifth International Conference on Genetic Algorithms, 1993.","DOI":"10.1007\/978-3-7091-7533-0_81"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB17","doi-asserted-by":"crossref","unstructured":"Shaw P. Using constraint programming and local search methods to solve vehicle routing problems. Working Paper, 1998.","DOI":"10.1007\/3-540-49481-2_30"},{"issue":"2","key":"10.1016\/S0954-1810(01)00005-X_BIB18","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Oper Res"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB19","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\/S0954-1810(01)00005-X_BIB20","unstructured":"Thangiah SR, Osman IH, Sun T. Algorithms for the vehicle routing problems with time deadlines. Working Paper, 1992."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB21","unstructured":"Thangiah SR, Osman IH, Sun T. Hybrid genetic algorithm, simulated annealing and Tabu search methods for vehicle routing problems with time windows. Technical Report SRU-CpSc-TR-94-27. Computer Science Department, Slippery Rock University, 1994."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB22","doi-asserted-by":"crossref","unstructured":"Thangiah SR. An adaptive clustering method using a geometric shape for vehicle routing problems with time windows. In: Proceedings of the Sixth International Conference on Genetic Algorithms, 1995.","DOI":"10.1201\/9781420050073.ch11"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB23","doi-asserted-by":"crossref","unstructured":"Thangiah SR. Vehicle routing with time windows using genetic algorithms. Working Paper, 1995.","DOI":"10.1201\/9781420050073.ch11"},{"key":"10.1016\/S0954-1810(01)00005-X_BIB24","unstructured":"Willard JAG. Vehicle routing using R-optimal Tabu search. MSc Thesis. London: Management School, Imperial College, 1989."},{"key":"10.1016\/S0954-1810(01)00005-X_BIB25","doi-asserted-by":"crossref","unstructured":"Desrochers M, Desrosier J, Solomon M. A new optimization algorithm for vehicle routing problems with time windows. Oper Res 1992;40:342\u2013355","DOI":"10.1287\/opre.40.2.342"}],"container-title":["Artificial Intelligence in Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095418100100005X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095418100100005X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T04:08:52Z","timestamp":1578456532000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095418100100005X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,7]]},"references-count":25,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,7]]}},"alternative-id":["S095418100100005X"],"URL":"https:\/\/doi.org\/10.1016\/s0954-1810(01)00005-x","relation":{},"ISSN":["0954-1810"],"issn-type":[{"value":"0954-1810","type":"print"}],"subject":[],"published":{"date-parts":[[2001,7]]}}}