{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,31]],"date-time":"2026-07-31T22:57:04Z","timestamp":1785538624367,"version":"3.56.0"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540652243","type":"print"},{"value":"9783540494812","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/3-540-49481-2_30","type":"book-chapter","created":{"date-parts":[[2007,11,24]],"date-time":"2007-11-24T19:46:10Z","timestamp":1195933570000},"page":"417-431","source":"Crossref","is-referenced-by-count":823,"title":["Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems"],"prefix":"10.1007","author":[{"given":"Paul","family":"Shaw","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[1999,6,11]]},"reference":[{"key":"30_CR1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"D. Applegate and W. Cook. A computational study of the job-shop scheduling problem. ORSA Journal On Computing, 3:149\u2013156, 1991.","journal-title":"ORSA Journal On Computing"},{"key":"30_CR2","unstructured":"B. De Backer, V. Furnon, P. Prosser, P. Kilby, and P. Shaw. Local search in constraint programming: Application to the vehicle routing problem. In A. Davenport and C. Beck, editors, Proceedings of the CP-97 workshop on Industrial Constraintbased Scheduling, 1997."},{"key":"30_CR3","unstructured":"P. Baptiste, C. Le Pape, and W. Nuijten. Constraint-based optimization and approximation for job-shop scheduling. In Proceedings of the AAAI-SIGMAN Workshop on Intelligent Manufacturing Systems, IJCAI-95, Montreal, Canada, 1995."},{"key":"30_CR4","unstructured":"Y. Caseau and F. Laburthe. Disjunctive scheduling with task intervals. Technical report, LIENS Technical Report 95-25, \u00e9cole Normale Sup\u00e9rieure Paris, France, July 1995."},{"key":"30_CR5","doi-asserted-by":"crossref","unstructured":"Y. Caseau and F. Laburthe. Solving small TSPs with constraints. In L. Naish, editor, Proceedings the 14th International Conference on Logic Programming. The MIT Press, 1997.","DOI":"10.7551\/mitpress\/4299.003.0028"},{"key":"30_CR6","unstructured":"N. Christofides, A. Mingozzi, and P. Toth. The vehicle routing problem. Combinatorial Optimization, pages 315\u2013338, 1979."},{"issue":"2","key":"30_CR7","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M. Desrochers","year":"1992","unstructured":"M. Desrochers, J. Desrosiers, and M. Solomon. A new optimization algorithm for the vehicle routing problems with time windows. Operations Research, 40(2):342\u2013354, 1992.","journal-title":"Operations Research"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42","author":"M. Fisher","year":"1994","unstructured":"M. Fisher. Optimal solution of vehicle routing problems using minimum K-trees. Operations Research, 42:626\u2013642, 1994.","journal-title":"Operations Research"},{"key":"30_CR9","unstructured":"W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proceedings of the 14th IJCAI, 1995."},{"key":"30_CR10","unstructured":"P. Kilby, P. Prosser, and P. Shaw. A comparison of traditional and constraint-based heuristic methods on vehicle routing problems with side constraints. Submitted to the Constraints Special Issue on Industrial Scheduling, 1998."},{"key":"30_CR11","first-page":"337","volume-title":"Local Search in Combinatorial Optimization","author":"G. A. P. Kindervater","year":"1997","unstructured":"G. A. P. Kindervater and M. W. P. Savelsbergh. Vehicle routing: Handling edge exchanges. In E. H. L. Aarts and J. K. Lenstra, editors, Local Search in Combinatorial Optimization, pages 337\u2013360. Wiley, Chichester, 1997."},{"key":"30_CR12","unstructured":"T. Mautor and P. Michelon. MIMAUSA: A new hybrid method combining exact solution and local search. In Proceedings of the 2nd International Conference on Meta-heuristics, 1997."},{"key":"30_CR13","unstructured":"Pedro Meseguer and Toby Walsh. Interleaved and discrepancy based search. In Proceedings of the 13th European Conference on AI\u2014ECAI-98, 1998. To appear."},{"key":"30_CR14","doi-asserted-by":"crossref","unstructured":"G. Pesant and M. Gendreau. A view of local search in constraint programming. In Proceedings of CP\u2019 96, pages 353\u2013366. Springer-Verlag, 1996.","DOI":"10.1007\/3-540-61551-2_86"},{"key":"30_CR15","doi-asserted-by":"crossref","unstructured":"G. Pesant, M. Gendreau, J.-Y. Potvin, and J.-M. Rousseau. An exact constraint logic programming algorithm for the traveling salesman problem with time windows. Transportation Science, 1998. To appear.","DOI":"10.1287\/trsc.32.1.12"},{"key":"30_CR16","doi-asserted-by":"crossref","unstructured":"G. Pesant, M. Gendreau, and J.-M. Rousseau. GENIUS-CP: A generic single-vehicle routing algorithm. In Proceedings of CP\u2019 97, pages 420\u2013433. Springer-Verlag, 1997.","DOI":"10.1007\/BFb0017457"},{"key":"30_CR17","unstructured":"J.-Y. Potvin and S. Bengio. A genetic approach to the vehicle routing problem with time windows. Technical Report CRT-953, Centre de Recherche sur les Transports, University of Montreal, 1994."},{"issue":"1","key":"30_CR18","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y. Rochat","year":"1995","unstructured":"Y. Rochat and E. D. Taillard. Probabilistic diversi_cation and intensification in local search for vehicle routing. Journal of Heuristics, 1(1):147\u2013167, 1995.","journal-title":"Journal of Heuristics"},{"issue":"2","key":"30_CR19","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1287\/ijoc.4.2.146","volume":"4","author":"M. W. P. Savelsbergh","year":"1992","unstructured":"M. W. P. Savelsbergh. The vehicle routing problem with time windows: Minimizing route duration. ORSA Journal on Computing, 4(2):146\u2013154, 1992.","journal-title":"ORSA Journal on Computing"},{"key":"30_CR20","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M. M. Solomon","year":"1987","unstructured":"M. M. Solomon. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, 35:254\u2013265, 1987.","journal-title":"Operations Research"},{"issue":"2","key":"30_CR21","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"\u00c9ric Taillard","year":"1997","unstructured":"E. Taillard, P. Badeau, M. Gendreau, F. Guertain, and J.-Y. Potvin. A tabu search heuristic for the vehicle routing problem with soft time windows. Transportation Science, 32(2), 1997.","journal-title":"Transportation Science"},{"key":"30_CR22","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E. D. Taillard","year":"1993","unstructured":"E. D. Taillard. Parallel iterative search methods for vehicle routing problems. Networks, 23:661\u2013676, 1993.","journal-title":"Networks"},{"key":"30_CR23","volume-title":"Working paper UKC\/OR94\/4","author":"S. R. Thangiah","year":"1994","unstructured":"S. R. Thangiah, I. H. Osman, and T. Sun. Hybrid genetic algorithm, simulated annealing, and tabu search methods for vehicle routing problems with time windows. Working paper UKC\/OR94\/4, Institute of Mathematics and Statistics, University of Kent, Canterbury, 1994."}],"container-title":["Lecture Notes in Computer Science","Principles and Practice of Constraint Programming \u2014 CP98"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49481-2_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T15:18:59Z","timestamp":1708355939000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49481-2_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540652243","9783540494812"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-49481-2_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[1998]]}}}