{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T12:08:41Z","timestamp":1751285321544},"reference-count":33,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1999,11,1]],"date-time":"1999-11-01T00:00:00Z","timestamp":941414400000},"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":[[1999,11]]},"DOI":"10.1016\/s0377-2217(98)00315-4","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:03:23Z","timestamp":1027609403000},"page":"485-504","source":"Crossref","is-referenced-by-count":61,"title":["A route-neighborhood-based metaheuristic for vehicle routing problem with time windows"],"prefix":"10.1016","volume":"118","author":[{"given":"Fuh-Hwa Franklin","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng-Yuan","family":"Shen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0377-2217(98)00315-4_BIB1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/01966324.1986.10737197","article-title":"Solution improvement heuristics for the vehicle routing problem with time window constraints","volume":"6","author":"Baker","year":"1988","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB2","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/0167-6377(82)90012-8","article-title":"An O(N log N) planar tavelling salesman heuristic based on spacefilling curve","volume":"1","author":"Barthodi","year":"1982","journal-title":"Operations Research Letters"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB3","first-page":"62","article-title":"Routing and scheduling of vehicles and crews: The state of the art","volume":"10","author":"Bodin","year":"1983","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB4","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1287\/opre.44.3.501","article-title":"Probabilistic analysis 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(98)00315-4_BIB5","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1287\/opre.45.2.295","article-title":"On the effectiveness of set covering formulations for the vehicle routing problem with time windows","volume":"45","author":"Bramel","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB6","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF02601637","article-title":"Simulated annealing methaheuristics 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(98)00315-4_BIB7","unstructured":"W. Chiang, R. Russell, A reactive tabu search methaheuristic for the vehicle routing problem with time windows, Transportation Science (forthcoming)"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB8","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","article-title":"A new optimization algorithm for the vehicle routing problem with time windows","volume":"40","author":"Desrochers","year":"1992","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB9","unstructured":"M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh, F. Soumis, Vehicle routing with time windows: Optimization and approximation, in: B.L. Golden, A.A. Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, 1988, pp. 65\u201384"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB10","unstructured":"J. Desrosiers, Y. Dumas, M. Solomon, F. Soumis, Time constrained routing and scheduling, in: M. Ball, T. Magnanti, M. Monma, G. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, vol. 8: Network Routing, North-Holland, Amsterdam, 1995, pp. 35\u2013139"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB11","doi-asserted-by":"crossref","unstructured":"M. Fisher, Vehicle routing, in: M. Ball, T. Magnanti, M. Monma, G. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, vol. 8: Network Routing, North-Holland, Amsterdam, 1995, pp. 1\u201333","DOI":"10.1016\/S0927-0507(05)80105-7"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB12","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","article-title":"A generalized assignment heuristic for the vehicle routing problem","volume":"11","author":"Fisher","year":"1981","journal-title":"Networks"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB13","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","article-title":"Vehicle routing with time windows: two optimization algorithms","volume":"45","author":"Fisher","year":"1997","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB14","doi-asserted-by":"crossref","first-page":"1025","DOI":"10.1016\/0305-0548(94)90073-6","article-title":"A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints","volume":"21","author":"Garcia","year":"1994","journal-title":"Computers & Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB15","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\/S0377-2217(98)00315-4_BIB16","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","article-title":"An optimization algorithm for the vehicle routing problem with time windows based on lagrangian relaxation","volume":"45","author":"Kohl","year":"1997","journal-title":"Operations Reseach"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB17","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","article-title":"Vehicle routing with time windows","volume":"35","author":"Kolen","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB18","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":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB19","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1287\/trsc.26.2.69","article-title":"An optimization-based heuristic for vehicle routing and scheduling with soft time window constraints","volume":"26","author":"Konskosidis","year":"1992","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB20","unstructured":"F.-H.F. Liu, S.Y. Shen, An approach for solving large-scale and complex vehicle routing problems, Working paper, National Chiao Tung University, Hsinchu, Taiwan, 1997"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB21","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\/S0377-2217(98)00315-4_BIB22","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","article-title":"The vehicle routing problem with time windows: Part II: Genetic search","volume":"8","author":"Potvin","year":"1996","journal-title":"INFORMS Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB23","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 Journal on Computing"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB24","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","article-title":"A parallel route building algorithms 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(98)00315-4_BIB25","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","article-title":"An exchange heuristic for routeing problems with time windows","volume":"46","author":"Potvin","year":"1995","journal-title":"Journal of the Operational Research Society"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB26","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(98)00315-4_BIB27","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(98)00315-4_BIB28","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","article-title":"Local search in routing problems with time windows","volume":"4","author":"Savelsbergh","year":"1985","journal-title":"Annals of Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB29","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","article-title":"The vehicle routing problems with time windows: minimizing route duration","volume":"4","author":"Savelsbergh","year":"1992","journal-title":"ORSA Journal of Computing"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB30","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling with time window constraints","volume":"15","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB31","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehcile routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB32","unstructured":"S.R. Thangiah, I.H. Osman, and T. Sun, Methaheuristics for vehicle routing problems with time windows, Technical Report, SRU-CpSc-TR-95-32, Artificial Intelligence and Robotics Laboratory, Computer Science Department, Slippery Rock University, Pennsylvania, 1995"},{"key":"10.1016\/S0377-2217(98)00315-4_BIB33","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:S0377221798003154?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0377221798003154?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2023,4,9]],"date-time":"2023-04-09T13:47:06Z","timestamp":1681048026000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0377221798003154"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,11]]},"references-count":33,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,11]]}},"alternative-id":["S0377221798003154"],"URL":"https:\/\/doi.org\/10.1016\/s0377-2217(98)00315-4","relation":{},"ISSN":["0377-2217"],"issn-type":[{"value":"0377-2217","type":"print"}],"subject":[],"published":{"date-parts":[[1999,11]]}}}