{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,19]],"date-time":"2025-05-19T04:02:09Z","timestamp":1747627329095,"version":"3.40.5"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2002,9,1]],"date-time":"2002-09-01T00:00:00Z","timestamp":1030838400000},"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":["Annals of Operations Research"],"published-print":{"date-parts":[[2002,9]]},"DOI":"10.1023\/a:1021188818613","type":"journal-article","created":{"date-parts":[[2003,3,21]],"date-time":"2003-03-21T00:40:25Z","timestamp":1048207225000},"page":"31-50","source":"Crossref","is-referenced-by-count":18,"title":["Improved Local Search for CP Toolkits"],"prefix":"10.1007","volume":"115","author":[{"given":"Paul","family":"Shaw","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruno","family":"De Backer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vincent","family":"Furnon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"volume-title":"Local Search in Combinatorial Optimization","year":"1997","key":"5101081_CR1","unstructured":"E.H.L. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization (Wiley, Chichester, 1997)."},{"key":"5101081_CR2","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 (1991) 149-156.","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"5101081_CR3","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B.D. Backer","year":"2000","unstructured":"B.D. Backer, V. Furnon, P. Kilby, P. Prosser and P. Shaw, Solving vehicle routing problems with constraint programming and meta-heuristics, Journal of Heuristics 6(4) (2000) 501-524.","journal-title":"Journal of Heuristics"},{"key":"5101081_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/0377-2217(88)90175-0","volume":"33","author":"J.E. Beasley","year":"1988","unstructured":"J.E. Beasley, An algorithm for solving large capacitated warehouse location problems, European Journal of Operational Research 33 (1988) 314-325.","journal-title":"European Journal of Operational Research"},{"issue":"11","key":"5101081_CR5","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J.E. Beasley","year":"1990","unstructured":"J.E. Beasley, OR-library: distributing test problems by electronic mail, Journal of the Operational Research Society 41(11) (1990) 1069-1072.","journal-title":"Journal of the Operational Research Society"},{"key":"5101081_CR6","unstructured":"Y. Caseau and F. Laburthe, The CLAIRE documentation, Technical Report LIENS Report 96-15, \u00c9cole Normale Sup\u00e9rieure (1995)."},{"key":"5101081_CR7","first-page":"310","volume-title":"Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP '98)","author":"Y. Caseau","year":"1998","unstructured":"Y. Caseau and F. Laburthe, SALSA: A language for search algorithms, in: Proceedings of the Fourth International Conference on Principles and Practice of Constraint Programming (CP '98), eds. M. Maher and J.-F. Puget (Springer, Berlin, 1998) pp. 310-324."},{"key":"5101081_CR8","unstructured":"L.L. et M. Lema\u00eetre, LNS\/VSP: une m\u00e9thode de recherche locale pour la r\u00e9solution de VCSP en contexte interruptible. Presented at the 5i\u00e8mes Journ\u00e9es Nationales sur la R\u00e9solution Pratique de Probl\u00e8mes NP-Complets (1999)."},{"issue":"3","key":"5101081_CR9","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1023\/A:1009816801567","volume":"5","author":"A. Fernandez","year":"2000","unstructured":"A. Fernandez and P. Hill, A comparative study of eight constraint programming languages over the Boolean and finite domains, Constraints 5(3) (2000) 275-301.","journal-title":"Constraints"},{"key":"5101081_CR10","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu Search","author":"F.W. Glover","year":"1997","unstructured":"F.W. Glover and M. Laguna, Tabu Search (Kluwer Academic, Dordrecht, 1997)."},{"key":"5101081_CR11","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"R. Haralick and G. Elliott, Increasing tree search efficiency for constraint satisfaction problems, Artificial Intelligence 14 (1980) 263-313.","journal-title":"Artificial Intelligence"},{"key":"5101081_CR12","unstructured":"W.D. Harvey and M.L. Ginsberg, Limited discrepancy search, in: Proceedings of the 14th IJCAI (Morgan Kaufmann, San Mateo, CA, 1995) pp. 607-615."},{"key":"5101081_CR13","unstructured":"ILOG, ILOG Dispatcher Reference Manual, Version 2.1, ILOG S.A., 9, Rue de Verdun, Gentilly, France (1999)."},{"key":"5101081_CR14","unstructured":"ILOG, ILOG Solver Reference Manual, Version 5.2, ILOG S.A., 9, Rue de Verdun, Gentilly, France (2001)."},{"key":"5101081_CR15","unstructured":"U. Junker, S.E. Karisch and T. Fahle (eds.), Proceedings of CP-AI-OR 2000, published as Technical Report TR-001-2000, Paderborn Center for Parallel Computing (2000)."},{"key":"5101081_CR16","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: Local Search in Combinatorial Optimization, eds. E.H.L. Aarts and J.K. Lenstra (Wiley, Chichester, 1997) pp. 337-360."},{"key":"5101081_CR17","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S. Lin","year":"1965","unstructured":"S. Lin, Computer solutions of the traveling salesman problem, Bell Systems Technology Journal 44 (1965) 2245-2269.","journal-title":"Bell Systems Technology Journal"},{"key":"5101081_CR18","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1023\/A:1009818401322","volume":"5","author":"L. Michel","year":"2000","unstructured":"L. Michel and P. van Hentenryck, Localizer, Constraints 5 (2000) 41-82.","journal-title":"Constraints"},{"key":"5101081_CR19","first-page":"237","volume-title":"Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP '97)","author":"L. Michel","year":"1997","unstructured":"L. Michel and P. van Hentenryck, Localizer: A modeling language for local search, in: Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP '97), ed. G. Smolka (Springer, Berlin, 1997) pp. 237-251."},{"key":"5101081_CR20","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"S. Minton, M.D. Johnston, A.B. Philips and P. Laird, Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems, Artificial Intelligence 58 (1992) 161-205.","journal-title":"Artificial Intelligence"},{"key":"5101081_CR21","first-page":"353","volume-title":"Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP '96)","author":"G. Pesant","year":"1996","unstructured":"G. Pesant and M. Gendreau, A view of local search in constraint programming, in: Proceedings of the Second International Conference on Principles and Practice of Constraint Programming (CP '96), ed. E.C. Freuder (Springer, Berlin, 1996) pp. 353-366."},{"key":"5101081_CR22","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"G. Pesant and M. Gendreau, A constraint programming framework for local search methods, Journal of Heuristics 5 (1999) 255-279.","journal-title":"Journal of Heuristics"},{"key":"5101081_CR23","volume-title":"Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP '97)","author":"G. Pesant","year":"1997","unstructured":"G. Pesant, M. Gendreau and J.-M. Rousseau, GENIUS-CP: A generic single-vehicle routing algorithm, in: Proceedings of the Third International Conference on Principles and Practice of Constraint Programming (CP '97), ed. G. Smolka (Springer, Berlin, 1997)."},{"key":"5101081_CR24","unstructured":"L.-M. Rousseau, G. Pesant and M. Gendreau, A hybrid algorithm to solve a physician rostering problem, in: Proceedings of CP-AI-OR 2000, eds. U. Junker, S.E. Karisch and T. Fahle, published as Technical Report TR-001-2000, Paderborn Center for Parallel Computing (2000), pp. 145-152."},{"key":"5101081_CR25","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1007\/BF02022044","volume":"4","author":"M.W.P. Savelsbergh","year":"1985","unstructured":"M.W.P. Savelsbergh, Local search in routing problems with time windows, Annals of Operations Research 4 (1985) 285-305.","journal-title":"Annals of Operations Research"},{"key":"5101081_CR26","first-page":"417","volume-title":"Fourth International Conference on Principles and Practice of Constraint Programming (CP '98)","author":"P. Shaw","year":"1998","unstructured":"P. Shaw, Using constraint programming and local search methods to solve vehicle routing problems, in: Fourth International Conference on Principles and Practice of Constraint Programming (CP '98), eds. M. Maher and J.-F. Puget (Springer, Berlin, 1998) pp. 417-431."},{"key":"5101081_CR27","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 (1987) 254-265.","journal-title":"Operations Research"},{"key":"5101081_CR28","doi-asserted-by":"crossref","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).","DOI":"10.1287\/trsc.31.2.170"},{"key":"5101081_CR29","volume-title":"Foundations of Constraint Satisfaction","author":"E. Tsang","year":"1993","unstructured":"E. Tsang, Foundations of Constraint Satisfaction (Academic Press, New York, 1993)."},{"key":"5101081_CR30","volume-title":"Constraint Satisfaction in Logic Programming","author":"P. van Hentenryck","year":"1989","unstructured":"P. van Hentenryck, Constraint Satisfaction in Logic Programming (The MIT Press, Cambridge, MA, 1989)."},{"key":"5101081_CR31","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00143881","volume":"1","author":"M. Wallace","year":"1996","unstructured":"M. Wallace, Practical applications of constraint programming, Constraints 1 (1996) 139-168.","journal-title":"Constraints"}],"container-title":["Annals of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021188818613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1021188818613\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1021188818613.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,18]],"date-time":"2025-05-18T14:17:11Z","timestamp":1747577831000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1021188818613"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,9]]},"references-count":31,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[2002,9]]}},"alternative-id":["5101081"],"URL":"https:\/\/doi.org\/10.1023\/a:1021188818613","relation":{},"ISSN":["0254-5330","1572-9338"],"issn-type":[{"type":"print","value":"0254-5330"},{"type":"electronic","value":"1572-9338"}],"subject":[],"published":{"date-parts":[[2002,9]]}}}