{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T14:48:02Z","timestamp":1783608482709,"version":"3.55.0"},"reference-count":53,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2004,12,1]],"date-time":"2004-12-01T00:00:00Z","timestamp":1101859200000},"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":["European Journal of Operational Research"],"published-print":{"date-parts":[[2004,12]]},"DOI":"10.1016\/s0377-2217(03)00435-1","type":"journal-article","created":{"date-parts":[[2003,10,15]],"date-time":"2003-10-15T09:17:29Z","timestamp":1066209449000},"page":"586-605","source":"Crossref","is-referenced-by-count":85,"title":["A multi-start local search algorithm for the vehicle routing problem with time windows"],"prefix":"10.1016","volume":"159","author":[{"given":"Olli","family":"Br\u00e4ysy","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Geir","family":"Hasle","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Wout","family":"Dullaert","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(03)00435-1_BIB1","series-title":"Local Search in Combinatorial Optimization","first-page":"91","article-title":"Simulated annealing","author":"Aarts","year":"1997"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB2","unstructured":"Bent, R., Van Hentenryck, P., in press. A two-stage hybrid local search for the vehicle routing problem with time windows. Transportation Science, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB3","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1080\/03155986.2003.11732675","article-title":"A route-directed hybrid genetic approach for the vehicle routing problem with time windows","volume":"41","author":"Berger","year":"2003","journal-title":"Information Systems and Operations Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.44.3.501","article-title":"Probabilistic analyses and practical algorithms for the vehicle routing problem with time windows","volume":"44","author":"Bramel","year":"1996","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB5","unstructured":"Br\u00e4ysy, O., 2001. Local search and variable neighborhood search algorithms for the vehicle routing problem with time windows. Doctoral thesis. Department of Mathematics and Statistics, University of Vaasa, Finland"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB6","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1142\/S0218213003001162","article-title":"A fast evolutionary metaheuristic for the vehicle routing problem with time windows","volume":"12","author":"Br\u00e4ysy","year":"2003","journal-title":"International Journal on Artificial Intelligence Tools"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB7","unstructured":"Br\u00e4ysy, O., Gendreau, M., in press a. Vehicle routing problem with time windows, Part I: Route construction and local search algorithms. Transportation Science, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB8","unstructured":"Br\u00e4ysy, O., Gendreau, M., in press b. Vehicle routing problem with time windows, Part II: Metaheuristics. Transportation Science, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB9","unstructured":"Br\u00e4ysy, O., Berger, J., Barkaoui, M., Dullaert, W., in press. A threshold accepting metaheuristic for the vehicle routing problem with time windows. Central European Journal of Operations Research, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB10","series-title":"Principles and Practice of Constraint Programming\u2013\u2013CP'99","first-page":"144","article-title":"A meta-heuristic factory for vehicle routing problems","author":"Caseau","year":"1999"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB11","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","article-title":"Simulated annealing metaheuristics for the vehicle routing problem with time windows","volume":"63","author":"Chiang","year":"1996","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB12","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","article-title":"A reactive tabu search metaheuristic for the vehicle routing problem with time windows","volume":"9","author":"Chiang","year":"1997","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB13","unstructured":"Cook, W., Rich, J., 1999. A parallel cutting-plane algorithm for the vehicle routing problems with time windows. Technical report, Department of Computational and Applied Mathematics, Rice University, Houston. Available from http:\/\/www.caam.rice.edu\/caam\/tr99.html"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB14","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB15","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1023\/A:1011301019184","article-title":"A heuristic for the vehicle routing problem with time windows","volume":"7","author":"Cordone","year":"2001","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB16","doi-asserted-by":"crossref","unstructured":"Czech, Z., Czarnas, P. 2002. Parallel simulated annealing for the vehicle routing problem with time windows. In: Proceedings of 10th Euromicro Workshop on Parallel, Distributed and Network-Based Processing, Canary Islands, Spain, pp. 376\u2013383","DOI":"10.1109\/EMPDP.2002.994313"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB17","unstructured":"Dongarra, J., 1998. Performance of various computers using standard linear equations software. Technical report CS-89-85, Department of Computer Science, University of Tennessee, Knoxville, TN"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB18","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0021-9991(90)90201-B","article-title":"Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing","volume":"90","author":"Dueck","year":"1990","journal-title":"Journal of Computational Physics"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB19","first-page":"42","article-title":"Toleranzschwelle und sintflut: Neue ideen zur optimierung","volume":"3","author":"Dueck","year":"1993","journal-title":"Spektrum der Wissenschaft"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB20","unstructured":"Dullaert, W., Br\u00e4ysy, O., in press. Routing relatively few customers per route. TOP, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB21","series-title":"New Ideas in Optimization","first-page":"63","article-title":"MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows","author":"Gambardella","year":"1999"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB22","unstructured":"Gehring, H., Homberger, J., 1999. A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Miettinen, K., M\u00e4kel\u00e4, M., Toivanen, J. (Eds.), Proceedings of EUROGEN99, University of Jyv\u00e4skyl\u00e4, Jyv\u00e4skyl\u00e4, Finland, pp. 57\u201364"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB23","first-page":"35","article-title":"Parallelization of a two-phase metaheuristic for routing problems with time windows","volume":"18","author":"Gehring","year":"2001","journal-title":"Asia-Pacific Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB24","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the travelling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB25","unstructured":"Glover, F., 1991. Multilevel tabu search and embedded search neighborhoods for the travelling salesman problem. Technical report, College of Business & Administration, University of Colorado, Boulder, CO"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB26","series-title":"Computer Science and Operations Research: New Developments in Their Interfaces","first-page":"449","article-title":"New ejection chain and alternating path methods for traveling salesman problems","author":"Glover","year":"1992"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB27","doi-asserted-by":"crossref","first-page":"297","DOI":"10.1080\/03155986.1999.11732386","article-title":"Two evolutionary metaheuristics for the vehicle routing problem with time windows","volume":"37","author":"Homberger","year":"1999","journal-title":"Information Systems and Operational Research\u2013\u2013Special issue: Metaheuristics for Location and Routing Problems"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB28","doi-asserted-by":"crossref","unstructured":"Homberger, J., Gehring, H. A two phase hybrid metaheuristic for the vehicle routing problem with time windows. European Journal of Operational Research, in press","DOI":"10.1016\/j.ejor.2004.01.027"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB29","unstructured":"Ibaraki, T., Kubo, T., Uno, T., Yagiura, M., in press. Effective local search algorithms for the vehicle routing problem with general time windows. Transportation Science, in press"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB30","doi-asserted-by":"crossref","first-page":"523","DOI":"10.1057\/palgrave.jors.2601113","article-title":"A greedy look-ahead heuristic for the vehicle routing problem with time windows","volume":"52","author":"Ioannou","year":"2001","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB31","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB32","unstructured":"Kohl, N., 1995. Exact methods for time constrained routing and related scheduling problems. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB33","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1287\/trsc.33.1.101","article-title":"2-path cuts on the vehicle routing problem with time windows","volume":"33","author":"Kohl","year":"1999","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB34","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","article-title":"A GRASP for the vehicle routing problem with time windows","volume":"7","author":"Kontoravdis","year":"1995","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB35","unstructured":"Larsen, J., 1999. Parallelization of the vehicle routing problem with time windows. PhD thesis, Institute of Mathematical Modelling, Technical University of Denmark, Lyngby, Denmark"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB36","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB37","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0377-2217(02)00486-1","article-title":"Local search with annealing-like restarts to solve the VRPTW","volume":"150","author":"Li","year":"2003","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB38","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","article-title":"A route-neighborhood-based metaheuristic for vehicle routing problem with time windows","volume":"118","author":"Liu","year":"1999","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB39","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of the state calculations by fast computing machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"Journal of Chemical Physics"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB40","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithm for the vehicle routing and scheduling problem with time windows","volume":"66","author":"Potvin","year":"1993","journal-title":"European Journal of Operational Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB41","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","article-title":"An exchange heuristic for routing problems with time windows","volume":"50","author":"Potvin","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB42","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"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB43","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/S0167-8191(00)00102-2","article-title":"Node ejection chains for the vehicle routing problem: Sequential and parallel algorithms","volume":"27","author":"Rego","year":"2001","journal-title":"Parallel Computing"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB44","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\/S0377-2217(03)00435-1_BIB45","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","article-title":"Using constraint-based operators to solve the vehicle routing problem with time windows","volume":"8","author":"Rousseau","year":"2002","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB46","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","article-title":"Hybrid heuristics for the vehicle routing problem with time windows","volume":"29","author":"Russell","year":"1995","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB47","unstructured":"Shaw, P., 1997. A new local search algorithm providing high quality solutions to vehicle routing problems. Working Paper, Department of Computer Science, University of Strathclyde, Glasgow, Scotland"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB48","series-title":"Principles and Practice of Constraint Programming\u2013\u2013CP98","first-page":"417","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB49","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problem with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB50","series-title":"Vehicle Routing: Methods and Studies","first-page":"85","article-title":"Vehicle routing and scheduling problems with time window constraints: Efficient implementations of solution improvement procedures","author":"Solomon","year":"1988"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB51","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB52","first-page":"323","article-title":"Algorithms for vehicle routing problems with time deadlines","volume":"13","author":"Thangiah","year":"1994","journal-title":"American Journal of Mathematical and Management Science"},{"key":"10.1016\/S0377-2217(03)00435-1_BIB53","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","article-title":"Cyclic transfer algorithms for multivehicle routing and scheduling problems","volume":"41","author":"Thompson","year":"1993","journal-title":"Operations Research"}],"container-title":["European Journal of Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703004351?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221703004351?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,19]],"date-time":"2019-02-19T14:24:16Z","timestamp":1550586256000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221703004351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,12]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2004,12]]}},"alternative-id":["S0377221703004351"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(03)00435-1","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[2004,12]]}}}