{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,4,2]],"date-time":"2023-04-02T15:52:17Z","timestamp":1680450737866},"reference-count":38,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Artif. Intell. Tools"],"published-print":{"date-parts":[[2003,6]]},"abstract":"<jats:p> This paper presents a new evolutionary metaheuristic for the vehicle routing problem with time windows. Ideas on multi-start local search, ejection chains, simulated annealing and evolutionary computation are combined in a heuristic that is both robust and efficient. The proposed method produces results that are on par with the current best solutions, at a fraction of the computation time needed by previous best approaches. Given the significantly lower time consumption over methods proposed previously in the literature, we consider our approach especially useful in dynamic routing problems, where decisions must be made in real-time. <\/jats:p>","DOI":"10.1142\/s0218213003001162","type":"journal-article","created":{"date-parts":[[2003,8,18]],"date-time":"2003-08-18T10:07:36Z","timestamp":1061201256000},"page":"153-172","source":"Crossref","is-referenced-by-count":15,"title":["A Fast Evolutionary Metaheuristic for the Vehicle Routing Problem with Time Windows"],"prefix":"10.1142","volume":"12","author":[{"given":"Olli","family":"Br\u00e4ysy","sequence":"first","affiliation":[{"name":"SINTEF Applied Mathematics, Department of Optimisation, P. O. Box 124 Blindern, N-0314 Oslo, Norway"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wout","family":"Dullaert","sequence":"additional","affiliation":[{"name":"Ufsia-Ruca Faculty of Applied Economics, University of Antwerp, Prinsstraat 13, 2000 Antwerp, Belgium"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,21]]},"reference":[{"key":"rf1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230110211"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601163"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.33.1.101"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1287\/opre.34.5.803"},{"key":"rf8","unstructured":"M.\u00a0Desrochers, Vehicle Routing: Methods and Studies, eds. B.\u00a0Golden and A.\u00a0Assad (Elsevier Science Publishers (North-Holland), Amsterdam, 1988)\u00a0pp. 65\u201384."},{"key":"rf9","volume-title":"Vehicle Routing: Methods and Studies","author":"Golden B.","year":"1988"},{"key":"rf10","unstructured":"M.\u00a0Solomon, E.\u00a0Baker and J.\u00a0Schaffer, Vehicle Routing: Methods and Studies, eds. B.\u00a0Golden and A.\u00a0Assad (Elsevier Science Publishers (North-Holland), Amsterdam, 1988)\u00a0pp. 85\u2013105."},{"key":"rf11","doi-asserted-by":"crossref","unstructured":"J.\u00a0Desrosiers, Handbooks in Operations Research and Management Science 8: Network Routing, eds. M.\u00a0Ball (Elsevier, Amsterdam, 1995)\u00a0pp. 35\u2013139.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"rf12","author":"Br\u00e4ysy O.","journal-title":"Transp. Sci."},{"key":"rf13","author":"Br\u00e4ysy O.","journal-title":"Transp. Sci."},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.2.254"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1287\/opre.44.3.501"},{"key":"rf18","doi-asserted-by":"publisher","DOI":"10.1057\/palgrave.jors.2601113"},{"key":"rf19","doi-asserted-by":"publisher","DOI":"10.1287\/opre.41.5.935"},{"key":"rf20","first-page":"1433","volume":"50","author":"Potvin J.-Y.","journal-title":"J. Oper. Res. Soc."},{"key":"rf21","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.29.2.156"},{"key":"rf24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011301019184"},{"key":"rf25","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009661600931"},{"key":"rf26","volume-title":"Genetic Algorithms in Search, Optimization and Machine Learning","author":"Goldberg D.","year":"1989"},{"key":"rf27","volume-title":"Evolutionary Algorithms in Engineering and Computer Science","author":"Miettinen K.","year":"1999"},{"key":"rf28","doi-asserted-by":"publisher","DOI":"10.1007\/BF02430370"},{"key":"rf29","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.31.2.170"},{"key":"rf30","unstructured":"L.\u00a0Gambardella, E.\u00a0Taillard and G.\u00a0Agazzi, New Ideas in Optimization, eds. D.\u00a0Corne, M.\u00a0Dorigo and F.\u00a0Glover (McGraw-Hill, London, 1999)\u00a0pp. 63\u201376."},{"key":"rf31","first-page":"297","volume":"37","author":"Homberger J.","journal-title":"INFOR"},{"key":"rf32","first-page":"35","volume":"18","author":"Gehring H.","journal-title":"Asia Pac. J. Oper. Res."},{"key":"rf33","author":"Li H.","journal-title":"Eur. J. Oper. Res."},{"key":"rf34","author":"Berger J.","journal-title":"INFOR"},{"key":"rf37","author":"Yagiura M.","journal-title":"Syst. Comput. Jpn."},{"key":"rf39","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.7.1.10"},{"key":"rf42","unstructured":"F.\u00a0Glover, Computer Science and Operations Research: New Developments in Their Interfaces, eds. O.\u00a0Balchi, S.\u00a0Ramesh and S. A.\u00a0Zenios (Pergamon Press, Oxford, 1992)\u00a0pp. 449\u2013509."},{"key":"rf43","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.44.10.1447"},{"key":"rf44","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(00)00102-2"},{"key":"rf45","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013661617536"},{"key":"rf47","doi-asserted-by":"publisher","DOI":"10.1287\/ijoc.8.2.165"},{"key":"rf48","doi-asserted-by":"publisher","DOI":"10.1063\/1.1699114"},{"key":"rf49","unstructured":"J.\u00a0Aarts, H.\u00a0Korst and P.\u00a0Van Laarhaven, Local Search in Combinatorial Optimization, eds. E.\u00a0Aarts and J.\u00a0Lenstra (John Wiley & Sons, Chichester, 1997)\u00a0pp. 91\u2013120."},{"key":"rf52","doi-asserted-by":"publisher","DOI":"10.1016\/S0377-2217(98)00315-4"}],"container-title":["International Journal on Artificial Intelligence Tools"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0218213003001162","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T03:13:47Z","timestamp":1565147627000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218213003001162"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":38,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,21]]},"published-print":{"date-parts":[[2003,6]]}},"alternative-id":["10.1142\/S0218213003001162"],"URL":"https:\/\/doi.org\/10.1142\/s0218213003001162","relation":{},"ISSN":["0218-2130","1793-6349"],"issn-type":[{"value":"0218-2130","type":"print"},{"value":"1793-6349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}