{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T10:27:21Z","timestamp":1761647241417,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2003,6,1]],"date-time":"2003-06-01T00:00:00Z","timestamp":1054425600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[2003,6]]},"DOI":"10.1023\/a:1024427114516","type":"journal-article","created":{"date-parts":[[2003,9,15]],"date-time":"2003-09-15T17:22:37Z","timestamp":1063646557000},"page":"179-207","source":"Crossref","is-referenced-by-count":22,"title":["GRASP with a New Local Search Scheme for Vehicle Routing Problems with Time Windows"],"prefix":"10.1007","volume":"7","author":[{"given":"Wanpracha","family":"Chaovalitwongse","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dukwon","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Panos M.","family":"Pardalos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5128228_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1080\/01966324.1986.10737197","volume":"6","author":"E.K. Baker","year":"1988","unstructured":"E.K. Baker and J.R. Schaffer, \u201cSolution improvement heuristics for the vehicle routing problem with time window constraints,\u201d American Journal of Mathematical and Management Sciences, vol. 6, pp. 261\u2013300, 1988.","journal-title":"American Journal of Mathematical and Management Sciences"},{"key":"5128228_CR2","unstructured":"J.E. Beasley, A. Lucena, and M.P. de Araq\u00e3o, \u201cThe vehicle routing problem,\u201d in P.M. Pardalos and M.G.C. Resende (Eds.), Handbook of Applied Optimization, Part Two: Applications, Oxford University Press, 2002."},{"key":"5128228_CR3","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"W. Chiang","year":"1997","unstructured":"W. Chiang and R. Russell, \u201cA reactive tabu search methaheuristic for the vehicle routing problem with time windows,\u201d INFORMS Journal on Computing, vol. 9, pp. 417\u2013430, 1997.","journal-title":"INFORMS Journal on Computing"},{"key":"5128228_CR4","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1002\/net.3230110207","volume":"11","author":"N. Christofides","year":"1981","unstructured":"N. Christofides, A. Mingozzi, and P. Toth, \u201cState space relaxation procedures for the computation of bounds to routing problems,\u201d Networks, vol. 11, pp. 145\u2013164, 1981.","journal-title":"Networks"},{"key":"5128228_CR5","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers, and M.M. Solomon, \u201cA new optimization algorithm for the vehicle routing problem with time windows,\u201d Operations Research, vol. 40, pp. 342\u2013354, 1992.","journal-title":"Operations Research"},{"key":"5128228_CR6","first-page":"35","volume-title":"Handbooks in Operations Research and Management Science, Network Routing","author":"J. Desrosiers","year":"1995","unstructured":"J. Desrosiers, Y. Dumas, M. Solomon, and F. Soumis, \u201cTime constrained routing and scheduling,\u201d in M. Ball, T. Magnanti, M. Monma, and G. Nemhauser (Eds.), Handbooks in Operations Research and Management Science, Network Routing, vol. 8, North-Holland, Amsterdam, pp. 35\u2013139, 1995."},{"key":"5128228_CR7","first-page":"65","volume-title":"Vehicle Routing: Methods and Studies","author":"M. Desrochers","year":"1988","unstructured":"M. Desrochers, J.K. Lenstra, M.W.P. Savelsbergh, and F. Soumis, \u201cVehicle routing with time windows: Optimization and approximation,\u201d in B.L. Golden and A.A. Assad (Eds.), Vehicle Routing: Methods and Studies, North-Holland, Amsterdam, pp. 65\u201384, 1988."},{"key":"5128228_CR8","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T.A. Feo","year":"1995","unstructured":"T.A. Feo and M.G.C. Resende, \u201cGreedy randomized adaptive search procedures,\u201d Journal of Global Optimization, vol. 6, pp. 109\u2013133, 1995.","journal-title":"Journal of Global Optimization"},{"key":"5128228_CR9","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M.L. Fisher","year":"1994","unstructured":"M.L. Fisher, \u201cOptimal solution of vehicle routing problems using minimum K-Trees,\u201d Operations Research, vol. 42, pp. 626\u2013642, 1994.","journal-title":"Operations Research"},{"key":"5128228_CR10","first-page":"296","volume":"37","author":"J. Homberger","year":"1999","unstructured":"J. Homberger and H. Gehring, \u201cTwo evolutionary metaheuristics for the vehicle routing problem with time windows,\u201d INFOR, vol. 37, pp. 296\u2013318, 1999.","journal-title":"INFOR"},{"key":"5128228_CR11","series-title":"Research Report","volume-title":"Exact solution of the vehicle routing and scheduling problem with time windows by variable splitting","author":"K. Jorsten","year":"1986","unstructured":"K. Jorsten, O.B.G. Madsen, and B. Sorensen, \u201cExact solution of the vehicle routing and scheduling problem with time windows by variable splitting,\u201d Research Report 5\/1986, IMSOR, The Technical University of Denmark, Lyngby, Denmark, 1986."},{"key":"5128228_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N. Kohl","year":"1997","unstructured":"N. Kohl and O.B.G. Madsen, \u201cAn optimization algorithm for the vehicle routing problem with time windows based on Lagrangian relaxation,\u201d Operations Research, vol. 45, pp. 395\u2013406, 1997.","journal-title":"Operations Research"},{"key":"5128228_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","volume":"35","author":"A.W.J. Kolen","year":"1987","unstructured":"A.W.J. Kolen, A.H.G.R. Kan, and H.W.J.M. Trienekens, \u201cVehicle routing with time windows,\u201d Operations Research, vol. 35, pp. 266\u2013273, 1987.","journal-title":"Operations Research"},{"key":"5128228_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"G. Kontoravdis and J.F. Bard, \u201cA GRASP for the vehicle routing problem with time windows,\u201d ORSA Journal of Computing, vol. 7, pp. 10\u201323, 1995.","journal-title":"ORSA Journal of Computing"},{"key":"5128228_CR15","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J. Lenstra","year":"1981","unstructured":"J. Lenstra and R.A. Kan, \u201cComplexity of vehicle routing and scheduling problems,\u201d Networks, vol. 11, pp. 221\u2013227, 1981.","journal-title":"Networks"},{"key":"5128228_CR16","doi-asserted-by":"crossref","unstructured":"Y. Li, P.M. Pardalos, and M.G.C. Resende, \u201cA greedy randomized adaptive search procedure for the quadratic assignment problem,\u201d in P.M. Pardalos and H. Wolkowicz (Eds.), Quadratic Assignment and Related Problems, vol. 16 of DIMACS series on Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, pp. 237\u2013261, 1994.","DOI":"10.1090\/dimacs\/016\/12"},{"key":"5128228_CR17","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1016\/S0377-2217(98)00315-4","volume":"118","author":"F.F. Lui","year":"1999","unstructured":"F.F. Lui and S. Shen, \u201cA route-neighborhood-based metaheuristic for vehicle routing problem with time windows,\u201d European Journal of Operational Research, vol. 118, pp. 485\u2013504, 1999.","journal-title":"European Journal of Operational Research"},{"key":"5128228_CR18","series-title":"Working Paper","volume-title":"Lagrangian relaxation and vehicle routing","author":"O.B.G. Madsen","year":"1990","unstructured":"O.B.G. Madsen, \u201cLagrangian relaxation and vehicle routing,\u201d Working Paper, IMSOR, The Technical University of Denmark, Lyngby, Denmark, 1990."},{"key":"5128228_CR19","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-322-83430-0","volume-title":"Evolutionare Algorithmen","author":"V. Nissen","year":"1994","unstructured":"V. Nissen, Evolutionare Algorithmen, Deutscher Universitats-Verlag, Wiesbaden, 1994."},{"key":"5128228_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J. Potvin","year":"1993","unstructured":"J. Potvin and J. Rousseau, \u201cA parallel route building algorithms for the vehicle routing and scheduling problem with time windows,\u201d European Journal of Operational Research, vol. 66, pp. 331\u2013340, 1993.","journal-title":"European Journal of Operational Research"},{"key":"5128228_CR21","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J. Potvin","year":"1995","unstructured":"J. Potvin and J. Rousseau, \u201cAn exchange heuristic for routing problems with time windows,\u201d Journal of the Operational Research Society, vol. 46, pp. 1433\u20131446, 1995.","journal-title":"Journal of the Operational Research Society"},{"key":"5128228_CR22","volume-title":"Evolutionsstrategic","author":"I. Rechenberg","year":"1973","unstructured":"I. Rechenberg, Evolutionsstrategic, Fromman-Holzboog, Stuttgart, 1973."},{"key":"5128228_CR23","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1023\/A:1009677613792","volume":"4","author":"M.G.C. Resende","year":"1998","unstructured":"M.G.C. Resende, \u201cComputing approximate solutions of the maximum covering problem using GRASP,\u201d Journal of Heuristics, vol. 4, pp. 161\u2013171, 1998.","journal-title":"Journal of Heuristics"},{"key":"5128228_CR24","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R.A. Russell","year":"1995","unstructured":"R.A. Russell, \u201cHybrid heuristics for the vehicle routing problem with time windows,\u201d Transportation Science, vol. 29, pp. 156\u2013166, 1995.","journal-title":"Transportation Science"},{"key":"5128228_CR25","unstructured":"M. Savelbergh, \u201cComputer aided routing,\u201d in Centrum voor Wiskunde en Informatica, Amsterdam, 1988."},{"key":"5128228_CR26","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M. Savelbergh","year":"1992","unstructured":"M. Savelbergh, \u201cThe vehicle routing problem with time windows: Minimizing route duration,\u201d ORSA Journal on Computing, vol. 4, pp. 146\u2013154, 1992.","journal-title":"ORSA Journal on Computing"},{"key":"5128228_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-0348-5927-1","volume-title":"Numberische Optimierung von Computer-Modellen mittels der Evolutions-strategic","author":"H.P. Schwefel","year":"1977","unstructured":"H.P. Schwefel, Numberische Optimierung von Computer-Modellen mittels der Evolutions-strategic, Birkauser, Basel, 1977."},{"key":"5128228_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/trsc.22.1.1","volume":"22","author":"M. Solomon","year":"1988","unstructured":"M. Solomon and J. Desrosiers, \u201cTime window constrained routing and scheduling problems,\u201d Transportation Science, vol. 22, pp. 1\u201313, 1988.","journal-title":"Transportation Science"},{"key":"5128228_CR29","first-page":"322","volume-title":"Preceedings of the 7th Conference on Artificial Intelligence for Applications","author":"S.R. Thangiah","year":"1991","unstructured":"S.R. Thangiah, K.E. Nygard, and P.L. Juell, \u201cA genetic algorithm system for vehicle routing with time windows,\u201d in Preceedings of the 7th Conference on Artificial Intelligence for Applications, IEEE Press, Miami, FL, pp. 322\u2013328, 1991."},{"key":"5128228_CR30","series-title":"Technical Report","volume-title":"Hybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows","author":"S.R. Thangiah","year":"1994","unstructured":"S.R. Thangiah, I.H. Osman, and T. Sun, \u201cHybrid genetic algorithms, simulated annealing and tabu search methods for vehicle routing problems with time windows,\u201d Technical Report, Institute of Mathematics and Statistics, University of Kent, Canterbury, UK, 1994."}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024427114516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1024427114516\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1024427114516.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:41:51Z","timestamp":1751283711000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1024427114516"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,6]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2003,6]]}},"alternative-id":["5128228"],"URL":"https:\/\/doi.org\/10.1023\/a:1024427114516","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[2003,6]]}}}