{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,23]],"date-time":"2026-06-23T19:42:01Z","timestamp":1782243721116,"version":"3.54.5"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,9,1]],"date-time":"2000-09-01T00:00:00Z","timestamp":967766400000},"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":[[2000,9]]},"DOI":"10.1023\/a:1009621410177","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:47:08Z","timestamp":1040597228000},"page":"501-523","source":"Crossref","is-referenced-by-count":123,"title":["Solving Vehicle Routing Problems Using Constraint Programming and Metaheuristics"],"prefix":"10.1007","volume":"6","author":[{"given":"Bruno De","family":"Backer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vincent","family":"Furnon","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Paul","family":"Shaw","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Philip","family":"Kilby","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Patrick","family":"Prosser","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"270681_CR1","unstructured":"De Backer, B. and V. Furnon. (1997). \u201cMeta-Heuristics in Constraint Programming: Experiments with Tabu Search on the Vehicle Routing Problem.\u201d In Proceedings of the 2nd International Conference on Meta-heuristics."},{"key":"270681_CR2","doi-asserted-by":"crossref","unstructured":"Caseau, Y. and F. Laburthe. (1997). \u201cSolving Small TSPs with Constraints.\u201d In L. Naish (ed.), Proceedings the 14th International Conference on Logic Programming. The MIT Press.","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"270681_CR3","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G. and G.W. Wright. (1964). \u201cScheduling of Vehicles from a Central Depot to a Number of Delivery Points.\u201d Operations Research 12, 568\u2013581.","journal-title":"Operations Research"},{"issue":"2","key":"270681_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. Solomon. (1992). \u201cA new Optimization Algorithm for the Vehicle Routing Problems with Time Windows.\u201d Operations Research 40(2), 342\u2013354.","journal-title":"Operations Research"},{"key":"270681_CR5","unstructured":"Garey, M.R. and D.S. Johnson. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman."},{"issue":"10","key":"270681_CR6","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(10), 1276\u20131290.","journal-title":"Management Science"},{"issue":"3","key":"270681_CR7","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F. (1989). \u201cTabu Search, part I.\u201d ORSA Journal on Computing 1(3), 190\u2013206.","journal-title":"ORSA Journal on Computing"},{"issue":"1","key":"270681_CR8","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1287\/ijoc.2.1.4","volume":"2","author":"F. Glover","year":"1990","unstructured":"Glover, F. (1990). \u201cTabu Search, part II.\u201d ORSA Journal on Computing 2(1), 4\u201332.","journal-title":"ORSA Journal on Computing"},{"key":"270681_CR9","unstructured":"Glover, F. and M. Laguna. (1995). \u201cTabu Search.\u201d In Modern Heuristic Techniques for Combinatorial Problems. McGraw-Hill, pp. 70\u2013150."},{"key":"270681_CR10","doi-asserted-by":"crossref","unstructured":"Glover, F.W. and M. Laguna. (1997). Tabu Search. Kluwer Academic.","DOI":"10.1007\/978-1-4615-6089-0"},{"key":"270681_CR11","unstructured":"ILOG S.A. (1998). 9, Rue de Verdun, Gentilly, France. ILOG Dispatcher Reference Manual, Version 1.2."},{"key":"270681_CR12","unstructured":"ILOG S.A. (1998). 9, Rue de Verdun, Gentilly, France. ILOG Solver Reference Manual, Version 4.3."},{"key":"270681_CR13","unstructured":"Kilby, P., P. Prosser, and P. Shaw. (1997). \u201cGuided Local Search for the Vehicle Routing Problem.\u201d In Proceedings of the 2nd International Conference on Meta-heuristics."},{"key":"270681_CR14","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1007\/BF02098290","volume":"61","author":"G. Laporte","year":"1995","unstructured":"Laporte, G. and I.H. Osman. (1995). \u201cRouting Problems: A Bibliography.\u201d Annals of Operations Research 61, 227\u2013262.","journal-title":"Annals of Operations Research"},{"key":"270681_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 of the Traveling Salesman Problem.\u201d Bell Systems Technology Journal 44, 2245\u20132269.","journal-title":"Bell Systems Technology Journal"},{"key":"270681_CR16","volume-title":"Travelling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood-Banking","author":"I. Or","year":"1976","unstructured":"Or, I. (1976). \u201cTravelling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Blood-Banking.\u201d Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwest University, Evanston, IL."},{"key":"270681_CR17","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I.H. Osman","year":"1993","unstructured":"Osman, I.H. (1993). \u201cMetastrategy Simulated Annealing and Tabu Search Algorithms for the Vehicle Routing Problem.\u201d Annals of Operations Research 41, 421\u2013451.","journal-title":"Annals of Operations Research"},{"key":"270681_CR18","doi-asserted-by":"crossref","unstructured":"Pesant, G. and M. Gendreau. (1996). \u201cA View of Local Search in Constraint Programming.\u201d In E.C. Freuder (ed.), Second International Conference on Principles and Practice of Constraint Programming-CP96. Springer-Verlag, pp. 353\u2013366.","DOI":"10.1007\/3-540-61551-2_86"},{"key":"270681_CR19","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. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. (1998). \u201cAn Exact Constraint Logic Programming Algorithm for the Traveling Salesman Problem with Time Windows.\u201d Transportation Science 32, 12\u201329.","journal-title":"Transportation Science"},{"key":"270681_CR20","unstructured":"Potvin, J.-Y. and S. Bengio. (1994). \u201cA Genetic Approach to the Vehicle Routing Problem with Time Windows.\u201d Technical Report CRT-953, Centre de Recherche sur les Transports, University of Montreal."},{"key":"270681_CR21","unstructured":"Potvin, J.-Y., T. Kervahut, B.-L. Garcia, and J.-M. Rousseau. (1993). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Time Windows.\u201d Technical Report CRT-855, Centre de Recherche sur les Transports. University of Montreal."},{"issue":"1","key":"270681_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(1), 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"270681_CR23","unstructured":"Savelsbergh, M.W.P. (1988). Amsterdam: Centrum voor Wiskunde en Informatica."},{"issue":"2","key":"270681_CR24","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M.W.P. Savelsbergh","year":"1992","unstructured":"Savelsbergh, M.W.P. (1992). \u201cThe Vehicle Routing Problem with Time Windows: Minimizing Route Duration.\u201d ORSA Journal on Computing 4(2), 146\u2013154.","journal-title":"ORSA Journal on Computing"},{"key":"270681_CR25","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). \u201cUsing Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.\u201d In M. Maher and J.-F. Puget (eds.), Fourth International Conference on Principles and Practice of Constraint Programming-CP98, Springer-Verlag, pp. 417\u2013431.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"270681_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 Problem with Time Window Constraints.\u201d Operations Research 35, 254\u2013265.","journal-title":"Operations Research"},{"key":"270681_CR27","doi-asserted-by":"crossref","unstructured":"Taillard, E., P. Badeau, M. Gendreau, F. Guertain, and J.-Y. Potvin. (1997). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.\u201d Transportation Science 32(2).","DOI":"10.1287\/trsc.31.2.170"},{"key":"270681_CR28","series-title":"Working paper UKC\/OR94\/4","volume-title":"Hybrid Genetic Algorithm, Simulated Annealing, and Tabu Search Methods for Vehicle Routing Problems with Time Windows","author":"S.R. Thangiah","year":"1994","unstructured":"Thangiah, S.R., I.H. Osman, and T. Sun. (1994). \u201cHybrid Genetic Algorithm, Simulated Annealing, and Tabu Search Methods for Vehicle Routing Problems with Time Windows.\u201d Working paper UKC\/OR94\/4, Institute of Mathematics and Statistics, University of Kent, Canterbury."},{"issue":"3","key":"270681_CR29","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0167-6377(96)00042-9","volume":"20","author":"E. Tsang","year":"1997","unstructured":"Tsang, E. and C. Voudouris. (1997). \u201cFast Local Search and Guided Local Search and Their Application to British Telecom's Workforce Scheduling Problem.\u201d Operations Research Letters 20(3), 119\u2013127.","journal-title":"Operations Research Letters"},{"key":"270681_CR30","volume-title":"Guided Local Search for Combinatorial Problems","author":"C. Voudouris","year":"1997","unstructured":"Voudouris, C. (1997). \u201cGuided Local Search for Combinatorial Problems.\u201d Ph.D. Thesis, University of Essex, Colchester, UK."},{"key":"270681_CR31","unstructured":"Voudouris, C. and E. Tsang. (1995). \u201cFunction Optimization Using Guided Local Search.\u201d Technical Report CSM-249, Department of Computer Science, University of Essex."},{"key":"270681_CR32","unstructured":"Voudouris, C. and E.P.K. Tsang. (1996). \u201cPartial Constraint Satisfaction Problems and Guided Local Search.\u201d In Proceedings of Practical Applications of Constraint Technology (PACT '96)."},{"issue":"2","key":"270681_CR33","first-page":"80","volume":"113","author":"C. Voudouris","year":"1998","unstructured":"Voudouris, C. and E.P.K. Tsang. (1998). \u201cGuided Local Search.\u201d European Journal of Operational Research 113(2), 80\u2013110.","journal-title":"European Journal of Operational Research"}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009621410177.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009621410177\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009621410177.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T10:50:18Z","timestamp":1747651818000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009621410177"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,9]]},"references-count":33,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,9]]}},"alternative-id":["270681"],"URL":"https:\/\/doi.org\/10.1023\/a:1009621410177","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,9]]}}}