{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,13]],"date-time":"2026-11-13T23:13:52Z","timestamp":1794611632459,"version":"4.9.1"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"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":[[2002,1]]},"DOI":"10.1023\/a:1013661617536","type":"journal-article","created":{"date-parts":[[2002,12,23]],"date-time":"2002-12-23T22:11:47Z","timestamp":1040681507000},"page":"43-58","source":"Crossref","is-referenced-by-count":122,"title":["Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","volume":"8","author":[{"given":"Louis-Martin","family":"Rousseau","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Michel","family":"Gendreau","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gilles","family":"Pesant","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"391042_CR1","volume-title":"Proceedings of the First International JointWorkshop on Artificial Intelligence and Operations Research","author":"P. C. Baptiste","year":"1995","unstructured":"Baptiste, P. C., Le Pape, and W. Nuijten. (1995). \u201cIncorporating Efficient Operations Research Algorithms in Contraint-Based Scheduling.\u201d In Proceedings of the First International JointWorkshop on Artificial Intelligence and Operations Research. Timberline Lodge, Oregon."},{"key":"391042_CR2","unstructured":"Caseau, Y. and F. Laburthe. (to appear). \u201cHeuristics for Large Constrained Vehicle Routing Problems.\u201d Journal of Heuristics."},{"key":"391042_CR3","first-page":"316","volume-title":"Proceedings of the 14th International Conference on Logic Programming","author":"Y. Caseau","year":"1997","unstructured":"Caseau, Y. and F. Laburthe. (1997). \u201cSolving Small TSPs with Constraints.\u201d In Proceedings of the 14th International Conference on Logic Programming. Cambridge MA: MIT Press, pp. 316\u2013330."},{"key":"391042_CR4","doi-asserted-by":"crossref","unstructured":"Caseau, Y. and F. Laburthe. (1998). \u201cSALSA: A Language for Search Algorithms.\u201d In Principle and Practice of Constraint Programming\u2014CP98. Pisa, Italy, Oct. 1998.","DOI":"10.1007\/3-540-49481-2_23"},{"key":"391042_CR5","unstructured":"Caseau, Y., F. Laburthe, and G. Silverstein. \u201cA Meta-Heuristic Factory for Vehicle Routing Problems.\u201d Personal Communication."},{"key":"391042_CR6","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 Second International Conference on Metaheuristics (MIC'97). Sophia Antipolis, France, July 1997."},{"key":"391042_CR7","volume-title":"Neighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-Ups and Deliveries","author":"M. Gendreau","year":"1998","unstructured":"Gendreau, M., F. Guertin, J.-Y. Potvin, and R. Seguin. (1998). \u201cNeighborhood Search Heuristics for a Dynamic Vehicle Dispatching Problem with Pick-Ups and Deliveries.\u201d Publication CRT-98-10, Centre de recherche sur les transports, Universit\u00e9 de Montr\u00e9al, Montr\u00e9al."},{"key":"391042_CR8","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., A. Hertz, and G. Laporte. (1992). \u201cNewInsertion and Postoptimization Procedures for the Traveling Salesman Problem.\u201d Operations Research 40, 1086\u20131094.","journal-title":"Operations Research"},{"key":"391042_CR9","first-page":"330","volume":"43","author":"M. Gendreau","year":"1995","unstructured":"Gendreau, M., A. Hertz, G. Laporte, and M. Stan. (1995). \u201cA Generalized Insertion Heuristic for the Traveling Salesman Problem with Time Windows.\u201d Operations Research 43, 330\u2013335.","journal-title":"Operations Research"},{"key":"391042_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0166-218X(94)00037-E","volume":"65","author":"F. Glover","year":"1996","unstructured":"Glover, F. (1996). \u201cEjection Chains, Reference Structures and Alternating Path Methods for Traveling Salesman Problems.\u201d Discrete Applied Mathmatics 65, 223\u2013253.","journal-title":"Discrete Applied Mathmatics"},{"key":"391042_CR11","first-page":"607","volume-title":"Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95)","author":"W. Harvey","year":"1995","unstructured":"Harvey, W. and M. Ginsberg. (1995). \u201cLimited Discrepancy Search.\u201d In Proc. of the Fourteenth International Joint Conference on Artificial Intelligence (IJCAI-95). Montr\u00e9al, Canada, San Mateo, CA: Morgan Kaufmann, pp. 607\u2013615."},{"key":"391042_CR12","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/978-1-4615-5775-3_32","volume-title":"META-HEURISTICS Advances and Trends in Local Search Paradigms for Optimization","author":"P. Kilby","year":"1999","unstructured":"Kilby, P., P. Prosser, and P. Shaw. (1999). \u201cGuided Local Search for the Vehicle Routing Problem with TimeWindows.\u201d In META-HEURISTICS Advances and Trends in Local Search Paradigms for Optimization. Dordrecht: Kluwer Academic Publishers, pp. 473\u2013486."},{"key":"391042_CR13","unstructured":"Meseguer, P. and T. Walsh. (1998). \u201cInterleave and Discrepancy Based Search.\u201d In ECAI 98."},{"key":"391042_CR14","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovic","year":"1997","unstructured":"Mladenovic, N. and P. Hansen. (1997). \u201cVariable Neighbourhood Search.\u201d Computer and Operations Research 24, 1097\u20131100.","journal-title":"Computer and Operations Research"},{"key":"391042_CR15","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1007\/3-540-61551-2_86","volume-title":"In Principles and Practice of Constraint Programming\u2014CP96: Proceedings of the Second International Conference","author":"G. Pesant","year":"1996","unstructured":"Pesant, G. and M. Gendreau. (1996). \u201cA view of Local Search in Constraint Programming.\u201d In Principles and Practice of Constraint Programming\u2014CP96: Proceedings of the Second International Conference. Berlin: Springer-Verlag, pp. 353\u2013366. LNCS, 1118."},{"key":"391042_CR16","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"Pesant, G. and M. Gendreau. (1999). \u201cA Constraint Programming Framework for Local Search Methods.\u201d Journal of Heuristics 5, 255\u2013279.","journal-title":"Journal of Heuristics"},{"key":"391042_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. 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":"391042_CR18","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"420","DOI":"10.1007\/BFb0017457","volume-title":"Principles and Practice of Constraint Programming\u2014CP97: Proceedings of the Third International Conference","author":"G. Pesant","year":"1997","unstructured":"Pesant, G., M. Gendreau, and J.-M. Rousseau. (1997). \u201cGENIUS-CP: A Generic Vehicle Routing Algorithm.\u201d In Principles and Practice of Constraint Programming\u2014CP97: Proceedings of the Third International Conference. Berlin: Springer-Verlag, pp. 420\u2013434. LNCS 1330."},{"key":"391042_CR19","doi-asserted-by":"crossref","unstructured":"Rego, C. and C. Roucairol. (1996). \u201cA Parallel Tabu Search Algorithm Using Ejection Chain for the Vehicle Routing Problem.\u201d Metaheuristics: Theory and Applications, pp. 661\u2013675.","DOI":"10.1007\/978-1-4613-1361-8_40"},{"key":"391042_CR20","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Rochat, Y. and \u00c9. Thaillard. (1995). \u201cProbabilistic Diversification and Intensification in Local Search for Vehicle Routing.\u201d Journal of Heuristics 1, 147\u2013167.","journal-title":"Journal of Heuristics"},{"key":"391042_CR21","series-title":"LNCS","volume-title":"Principle and Practice of Constraint Programming\u2014CP98","author":"P. Shaw","year":"1998","unstructured":"Shaw, P. (1998). \u201cUsing Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems.\u201d In Principle and Practice of Constraint Programming\u2014CP98. Pisa, Italy, Oct. 1998. Berlin: Springer-Verlag. LNCS."},{"key":"391042_CR22","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":"391042_CR23","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9. Taillard","year":"1997","unstructured":"Taillard, \u00c9., P. Badeau, M. Gendreau, F. Guertin, and J.-Y. Potvin. (1997). \u201cA Tabu Search Heuristic for the Vehicle Routing Problem with Soft Time Windows.\u201d Transportation Science 31, 170\u2013186.","journal-title":"Transportation Science"},{"key":"391042_CR24","doi-asserted-by":"crossref","first-page":"935","DOI":"10.1287\/opre.41.5.935","volume":"41","author":"P. Thompson","year":"1993","unstructured":"Thompson, P. and H.N. Psaraftis. (1993). \u201cCyclic Transfer Algorithms for Multi-Vehicle Routing and Scheduling Problems.\u201d Operations Research 41, 935\u2013946.","journal-title":"Operations Research"},{"key":"391042_CR25","volume-title":"The OPL Optimization Programming Language","author":"P. Van Hentenryck","year":"1999","unstructured":"Van Hentenryck, P. (1999). The OPL Optimization Programming Language. Cambridge, MA: MIT Press."}],"container-title":["Journal of Heuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013661617536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1013661617536\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1013661617536.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T11:02:22Z","timestamp":1747652542000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1013661617536"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,1]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,1]]}},"alternative-id":["391042"],"URL":"https:\/\/doi.org\/10.1023\/a:1013661617536","relation":{},"ISSN":["1381-1231","1572-9397"],"issn-type":[{"value":"1381-1231","type":"print"},{"value":"1572-9397","type":"electronic"}],"subject":[],"published":{"date-parts":[[2002,1]]}}}