{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T10:49:22Z","timestamp":1772275762455,"version":"3.50.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,10,1]],"date-time":"1999-10-01T00:00:00Z","timestamp":938736000000},"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":[[1999,10]]},"DOI":"10.1023\/a:1009661600931","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"281-303","source":"Crossref","is-referenced-by-count":56,"title":["Heuristics for Large Constrained Vehicle Routing Problems"],"prefix":"10.1007","volume":"5","author":[{"given":"Yves","family":"Caseau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Laburthe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"238059_CR1","unstructured":"P. Augerat, J.M. Belenguer, E. Benavent, A. Corberan, D. Naddef, and G. Rinaldi. (1995). \u201cComputational Results with a Branch and Cut Code for the Capacitated Vehicle Routing Problem,\u201d Artemis Imag Research Report RR949-M."},{"key":"238059_CR2","unstructured":"Caseau, Y. and.P. Koppstein. (1992). \u201cA Rule-Based Approach to a Time-Constrained Traveling Salesman Problem,\u201d 2nd Int. Symp. on AI and Mathematics."},{"key":"238059_CR3","unstructured":"Caseau, Y. and F. Laburthe. (1996). \u201cIntroduction to the Claire Programming Language.\u201d LIENS Report 96-15, Ecole Normale Sup\u00e9rieure."},{"key":"238059_CR4","doi-asserted-by":"crossref","unstructured":"Caseau, Y. and F. Laburthe. (1997). \u201cSolving Small TSPs with Constraints,\u201d to appear in Proc. of the 14th International Conference on Logic Programming, The MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"238059_CR5","unstructured":"Christophides, N. (1985). \u201cVehicle Routing.\u201d The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. In E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, and D.B. Shrmoys (eds.),Wiley, pp. 431\u2013448."},{"key":"238059_CR6","first-page":"93","volume":"46","author":"G. Clarke","year":"1964","unstructured":"Clarke, G. and J.W. Wright. (1964). \u201cScheduling of Vehicles from a Central Depot to a Number of Delivery Points,\u201d Operations Research 46, 93\u2013100.","journal-title":"Operations Research"},{"key":"238059_CR7","unstructured":"Desaulniers, G., J. Desrosiers, I. Loachim, M.M. Solomon, and F. Soumis. A Unified Framework for Deterministic Time Constrained Vehicle Routing and Crew Scheduling Problems, cahiers du GERAD 94-46."},{"key":"238059_CR8","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y. Dumas","year":"1995","unstructured":"Dumas, Y., J. Desrosiers, E. G\u00e9linas, and M.M. Solomon. (1995). \u201cAn Optimal Algorithm for the Traveling Salesman Problem with Time Windows,\u201d Operations Research 43, 367\u2013371.","journal-title":"Operations Research"},{"key":"238059_CR9","doi-asserted-by":"crossref","unstructured":"Desrochers, M., J. Desrosiers, and M. Solomon. (1992). \u201cA New Optimization Algorithm for the Vehicle Routing Problem with Time Windows,\u201d Operations Research 40(2).","DOI":"10.1287\/opre.40.2.342"},{"key":"238059_CR10","doi-asserted-by":"crossref","unstructured":"Gendreau, M., A. Hertz, and G. Laporte. (1992). \u201cNewInsertion and Postoptimization Procedures for the Traveling Salemsan Problem,\u201d Operations Research 40(6).","DOI":"10.1287\/opre.40.6.1086"},{"key":"238059_CR11","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., A. Hertz, and G. Laporte. (1994). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem,\u201d Management Science 40, 1276\u20131290.","journal-title":"Management Science"},{"key":"238059_CR12","unstructured":"Harvey, W. and M. Ginsberg. (1995). \u201cLimited Discrepancy Search.\u201d Proceedings of the 14th IJCAI, Morgan Kaufmann, pp. 607\u2013615."},{"key":"238059_CR13","unstructured":"Kindervater, G. and M. Savelsbergh. (1997). \u201cVehicle Routing: Handling Edges Exchanges.\u201d Local Search in Combinatorial Optimization. In E. Aarts and J.K. Lenstra (eds.), Wiley."},{"key":"238059_CR14","doi-asserted-by":"crossref","unstructured":"Kontoravdis, G. and J. Bard. (1995). \u201cA GRASP for the Vehicle Routing Problem with Time Windows,\u201d ORSA Journal on Computing 7(1).","DOI":"10.1287\/ijoc.7.1.10"},{"key":"238059_CR15","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G. Laporte","year":"1992","unstructured":"Laporte, G. (1992). \u201cThe Vehicle Routing Problem: An Overview of Exact and Approximate Algorithms,\u201d European Journal of Operational Research 59, 345\u2013358.","journal-title":"European Journal of Operational Research"},{"key":"238059_CR16","doi-asserted-by":"crossref","unstructured":"Pesant, G. and M. Gendreau. (1995). \u201cA View of Local Search in Constraint Programming.\u201d Proceedings of Constraint Programming, CP'96, LNCS 1118, Springer.","DOI":"10.1007\/3-540-61551-2_86"},{"issue":"1","key":"238059_CR17","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1998","unstructured":"Pesant, G., M. Gundreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). \u201cAn Exact Constraint Logic Programming Algorithm for the Travelling Salesman Problem with Time Windows,\u201d Transportation Science 32(1), 12\u201329.","journal-title":"Transportation Science"},{"key":"238059_CR18","doi-asserted-by":"crossref","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 Eur. Journal Op. Res. 66.","DOI":"10.1016\/0377-2217(93)90221-8"},{"key":"238059_CR19","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"E. Rochat","year":"1995","unstructured":"Rochat, E. and E. Taillard. (1995). \u201cProbabilistic Diversification and Intensification in Local Search for Vehicle Routing,\u201d Journal of Heuristic 1, 147\u2013167.","journal-title":"Journal of Heuristic"},{"key":"238059_CR20","doi-asserted-by":"crossref","unstructured":"Russell, R. (1995). \u201cHybrid Heuristics for the Vehicle Routing Problem with Time Windows,\u201d Transportation Science 29(2).","DOI":"10.1287\/trsc.29.2.156"},{"key":"238059_CR21","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M. Savelsbergh","year":"1985","unstructured":"Savelsbergh, M. (1985). \u201cLocal Search in Routing Problems with TimeWindows,\u201d Annals of Operations Research 4, 285\u2013305.","journal-title":"Annals of Operations Research"},{"key":"238059_CR22","doi-asserted-by":"crossref","unstructured":"Solomon, M. (1987). \u201cAlgorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints,\u201d Operations Research 35(2).","DOI":"10.1287\/opre.35.2.254"},{"issue":"2","key":"238059_CR23","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E. Taillard","year":"1997","unstructured":"Taillard, E., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). \u201cA Tabu Seach Heuristic for the Vehicle Routing Problem with Soft Time Windows,\u201d Transportation Science 31(2), 170\u2013186.","journal-title":"Transportation Science"},{"key":"238059_CR24","doi-asserted-by":"crossref","unstructured":"Thompson, P. and H. Psaraftis. (1993). \u201cCyclic Transfer Algorithms for Multivehicle Routing and Scheduling Problems,\u201d Operations Research 41(5).","DOI":"10.1287\/opre.41.5.935"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009661600931.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009661600931\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009661600931.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:00:48Z","timestamp":1747652448000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009661600931"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,10]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1999,10]]}},"alternative-id":["238059"],"URL":"https:\/\/doi.org\/10.1023\/a:1009661600931","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[1999,10]]}}}