{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T08:46:15Z","timestamp":1750149975108,"version":"3.40.5"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,3,1]],"date-time":"2001-03-01T00:00:00Z","timestamp":983404800000},"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 Heuristics"],"published-print":{"date-parts":[[2001,3]]},"DOI":"10.1023\/a:1011301019184","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T09:44:13Z","timestamp":1040636653000},"page":"107-129","source":"Crossref","is-referenced-by-count":40,"title":["A Heuristic for the Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","volume":"7","author":[{"given":"Roberto","family":"Cordone","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roberto Wolfler","family":"Calvo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"320000_CR1","first-page":"261","volume":"6","author":"E.K. Baker","year":"1986","unstructured":"Baker, E.K. and J.R. Shaffer. (1986). \u201cSolution Improvement Heuristic for the Vehicle Routing and Scheduling Problem with Time Window Constrainats.\u201d American Journal of Mathematical and Managenent Sciences 6, 261\u2013300.","journal-title":"American Journal of Mathematical and Managenent Sciences"},{"key":"320000_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02601636","volume":"63","author":"W.-C. Chiang","year":"1996","unstructured":"Chiang, W.-C. and R. Russell. (1996). \u201cSimulated Annealing Metaheuristics for the Vehicle Routing Problem with Time Windows.\u201d Annals of Operations Research 63, 1\u201329.","journal-title":"Annals of Operations Research"},{"key":"320000_CR3","volume-title":"Internal Report 96-005","author":"R. Cordone","year":"1996","unstructured":"Cordone, R. and R. Wolfler Calvo. (1996). \u201cNote About Time Window Constraints in Routin Problems.\u201d Internal Report 96-005, Dipartimento di Elettronica e Informazione, Politecnico di Milano, Milano (Submitted)."},{"issue":"2","key":"320000_CR4","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"Desrochers, M., J. Desrosiers, and M.M. Solomon. (1992). \u201cA New Optimization Algorithm for the Vehicle Routing Problem with Time Windows.\u201d Operations Research 40(2), 342\u2013354.","journal-title":"Operations Research"},{"key":"320000_CR5","doi-asserted-by":"crossref","unstructured":"Desrosiers, J., Y. Dumas, M.M Solomon, and F. Soumis. (1995). \u201cTime Constrained Routing and Scheduling.\u201d In Handbooks in Operations Research and Management Science, Vol. 8: Network Routing, North-Holland, pp. 35\u2013139.","DOI":"10.1016\/S0927-0507(05)80106-9"},{"key":"320000_CR6","unstructured":"Dongarra, J.J. (1998). \u201cPerformance of Various Computers Using Standard Linear Equations Software.\u201d Report CS-89-85, Computer Science Departement, University of Tennesse."},{"key":"320000_CR7","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L. and R. Jaikumar. (1981). \u201cA Generalized Assignment Heuristic for the Vehicle Routing Problem.\u201d Networks 11, 109\u2013124.","journal-title":"Networks"},{"key":"320000_CR8","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1287\/opre.45.3.488","volume":"45","author":"M.L. Fisher","year":"1997","unstructured":"Fisher, M.L., K.O. Jornsten, and O.B.G. Madsen. (1997). \u201cVehicle Routing with TimeWindows\u2013Two Optimization Algorithms.\u201d Operations Research 45, 488\u2013492.","journal-title":"Operations Research"},{"key":"320000_CR9","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1016\/0377-2217(93)E0292-6","volume":"83","author":"P. Healy","year":"1995","unstructured":"Healy, P. and R. Moll. (1995). \u201cA New Extension of Local Search Applied to the Dial-a-Ride Problem.\u201d European Journal of Operational Research 83, 83\u2013104.","journal-title":"European Journal of Operational Research"},{"key":"320000_CR10","first-page":"337","volume-title":"Local Search in Combinatorial Optimization","author":"G.A.P. Kindervater","year":"1997","unstructured":"Kindervater, G.A.P. and M.W.P. Savelsbergh. (1997). \u201cehicle Routing: Handling Edge Exchanges.\u201d In Local Search in Combinatorial Optimization. Chichester: Wiley, pp. 337\u2013360."},{"key":"320000_CR11","unstructured":"Kohl, N., J. Desrosiers, O.B.G. Madsen, M.M. Solomon, and F. Soumis. (1997). \u201cK-path Cuts for the Vehicle Routing Problem with Time Windows.\u201d Technical Report 1997-12, Department of Mathematical Modelling, The Technical University of Denmark."},{"key":"320000_CR12","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1287\/opre.45.3.395","volume":"45","author":"N. Kohl","year":"1997","unstructured":"Kohl, N. and O.B.G. Madsen. (1997). \u201cAn Optimization Algorithm for the Vehicle Routing Problem with Time Windows Based on Lagrangean Relaxation.\u201d Operations Research 45, 395\u2013406.","journal-title":"Operations Research"},{"key":"320000_CR13","doi-asserted-by":"crossref","first-page":"266","DOI":"10.1287\/opre.35.2.266","volume":"35","author":"A.W.J. Kolen","year":"1997","unstructured":"Kolen, A.W.J., A.H.G. Rinnooy Kan, and H.W.J.M. Trienekens. (1997). \u201cVehicle Routing with Time Windows.\u201d Operations Research 35, 266\u2013273.","journal-title":"Operations Research"},{"key":"320000_CR14","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/ijoc.7.1.10","volume":"7","author":"G. Kontoravdis","year":"1995","unstructured":"Kontoravdis, G. and J.F. Bard. (1995). \u201cA GRASP for the Vehicle Routing Problem with Time Windows.\u201d ORSA Journal on Computing 7, 10\u201323.","journal-title":"ORSA Journal on Computing"},{"key":"320000_CR15","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"Lin, S. (1965). \u201cComputer Solutions to the Travelling Salesman Problem.\u201d Bell System Technical Journal 44, 2245\u20132269.","journal-title":"Bell System Technical Journal"},{"key":"320000_CR16","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and B.W. Kernighan. (1973). \u201cAn Effective Heuristic Algorithm for the Travelling Salesman Problem.\u201d Operations Research 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"320000_CR17","volume-title":"Ph.D. thesis","author":"I. Or","year":"1976","unstructured":"Or, I. (1976). \u201cTraveling Salesman Type Combinatorial Problems and Their Relation to the Logistics of Blood Banking.\u201d Ph.D. thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, Illinois."},{"key":"320000_CR18","first-page":"165","volume":"8","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y. and S. Bengio. (1996). \u201cThe Vehicle Routing Problem with TimeWindows\u2014Part II: Genertic Search.\u201d INFORMS Journal of Coputing 8, 165\u2013172.","journal-title":"INFORMS Journal of Coputing"},{"key":"320000_CR19","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"8","author":"J.Y. Potvin","year":"1996","unstructured":"Potvin, J.Y., T. Kervahut, B.L. Garcia, and J.M. Rousseau. (1996).\u201cThe Vehicle Routing Problem with Time Windows\u2014Part I: Tabu Search.\u201d INFORMS Journal of Computing 8, 158\u2013164.","journal-title":"INFORMS Journal of Computing"},{"key":"320000_CR20","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0377-2217(93)90221-8","volume":"66","author":"J.Y. Potvin","year":"1993","unstructured":"Potvin, J.Y. and J.M. Rousseau. (1993). \u201cA Parallel Route Building Algorithm for the Vehicle Routing and Scheduling Problem with Time Windows.\u201d European Journal of Operational Research 66, 331\u2013340.","journal-title":"European Journal of Operational Research"},{"key":"320000_CR21","doi-asserted-by":"crossref","first-page":"1233","DOI":"10.1057\/jors.1994.197","volume":"45","author":"Y. Rochat","year":"1994","unstructured":"Rochat, Y. and F. Semet. (1994). \u201cA Tabu Search Approach for Delivering Pet Food and Flour in Switzerland.\u201d Journal of Operational Research Society 45, 1233\u20131246.","journal-title":"Journal of Operational Research Society"},{"key":"320000_CR22","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y. and E.D. Taillard. (1995). \u201cProbabilistic Diversification and Intensification in Local Search for Vehicle Routing.\u201d Journal of Heuristics 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"320000_CR23","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1287\/opre.25.3.517","volume":"25","author":"R.A. Russell","year":"1977","unstructured":"Russell, R.A. (1977). \u201cAn Effective Heuristic for the m-Tour Travelling Salesman Problem with Some Side Conditions.\u201d Operation Research 25, 517\u2013524.","journal-title":"Operation Research"},{"key":"320000_CR24","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R.A. Russell","year":"1995","unstructured":"Russell, R.A. (1995). \u201cHybrid Heuristics for the Vehicle Routing Problems with TimeWindows.\u201d Transportation Science 29, 156\u2013166.","journal-title":"Transportation Science"},{"key":"320000_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M.W.P. (1985). \u201cLocal Search in Routing Problems with Time Windows.\u201d Annals of Operations Research 4, 285\u2013305.","journal-title":"Annals of Operations Research"},{"key":"320000_CR26","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M.M. Solomon","year":"1987","unstructured":"Solomon, M.M. (1987). \u201cAlgorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints.\u201d Operations Research 35, 254\u2013265.","journal-title":"Operations Research"},{"key":"320000_CR27","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E.D. Taillard","year":"1997","unstructured":"Taillard, E.D., P. Badeau, M. Gendreau, F. Guertin, and J.Y. Potvin. (1997). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.\u201d Transportation Science 31, 170\u2013186.","journal-title":"Transportation Science"},{"key":"320000_CR28","unstructured":"Thangiah, S.R., I.H. Osman, and T. Sun. (1994). \u201cHybrid Genetic Algorithm, Simulated Annealing and Tabu Search Methods for Vehicle Routing Problem with Time Windows.\u201d Technical Report 27, Computer Science Department, Slippery Rock University (Forthcoming in the Annals of OR Transportation, Laporte and Gendreau, eds.)."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011301019184.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1011301019184\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1011301019184.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:55:47Z","timestamp":1747652147000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1011301019184"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,3]]},"references-count":28,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2001,3]]}},"alternative-id":["320000"],"URL":"https:\/\/doi.org\/10.1023\/a:1011301019184","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"type":"print","value":"1381-1231"},{"type":"electronic","value":"1572-9397"}],"subject":[],"published":{"date-parts":[[2001,3]]}}}