{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T14:21:18Z","timestamp":1725459678114},"publisher-location":"Boston","reference-count":52,"publisher":"Kluwer Academic Publishers","isbn-type":[{"type":"print","value":"1402072635"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/0-306-48056-5_13","type":"book-chapter","created":{"date-parts":[[2006,2,2]],"date-time":"2006-02-02T13:26:26Z","timestamp":1138886786000},"page":"369-403","source":"Crossref","is-referenced-by-count":18,"title":["Local Search and Constraint Programming"],"prefix":"10.1007","author":[{"given":"Filippo","family":"Focacci","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Fran\u00e7ois","family":"Laburthe","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea","family":"Lodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","volume-title":"Actes des Journees Francophones de Programmation et Logique","author":"A. Aggoun","year":"1992","unstructured":"Aggoun, A. and Beldiceanu, N. (1992) Extending CHIP in order to solve complex scheduling and placement problems. In: Actes des Journees Francophones de Programmation et Logique. Lille, France."},{"key":"13_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1287\/ijoc.3.2.149","volume":"3","author":"D. Applegate","year":"1991","unstructured":"Applegate, D. and Cook, W. (1991) A computational study of thejob-shop scheduling problem. ORSA Journal on Computing, 3, 149\u2013156.","journal-title":"ORSA Journal on Computing"},{"key":"13_CR3","volume-title":"Proceedings of the 3rd Metaheuristics International Conference","author":"N. Beldiceanu","year":"1999","unstructured":"Beldiceanu, N., Bourreau, E., Simonis, H. and Rivrau, D. (1999) Introducing metaheuristics in CHIP. In: Proceedings of the 3rd Metaheuristics International Conference. Angra do Reis, Brazil."},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0025-5610(97)00057-9","volume":"79","author":"A. Caprara","year":"1997","unstructured":"Caprara, A., Fischetti, M., Toth, P., Vigo, D. and Guida, P.-L. (1997) Algorithms for railway crew management. Mathematical Programming, 79, 125\u2013141.","journal-title":"Mathematical Programming"},{"key":"13_CR5","volume-title":"Proceedings of Combinatorics and Computer Science, CCS\u201995, LNCS 1120","author":"Y. Caseau","year":"1996","unstructured":"Caseau, Y. and Laburthe, F. (1996) Improving branch and bound for job-shop scheduling with constraint propagation. In: M. Deza, R. Euler and Y. Manoussakis, (eds.), Proceedings of Combinatorics and Computer Science, CCS\u201995, LNCS 1120. Springer-Verlag, Berlin Heidelberg."},{"key":"13_CR6","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1023\/A:1009661600931","volume":"5","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y. and Laburthe, F. (1999) Heuristics for large constrained routing problems. Journal of Heuristics, 5, 281\u2013303.","journal-title":"Journal of Heuristics"},{"key":"13_CR7","doi-asserted-by":"crossref","first-page":"144","DOI":"10.1007\/978-3-540-48085-3_11","volume-title":"Principle and Practice of Constraint Programming\u2014CP\u201999, LNCS 1713","author":"Y. Caseau","year":"1999","unstructured":"Caseau, Y., Laburthe, F. and Silverstein, G. (1999) A metaheuristic factory for vehicle routing problems. In: J. Jaffar (ed.), Principle and Practice of Constraint Programming\u2014CP\u201999, LNCS 1713. Springer-Verlag, Berlin Heidelberg, pp. 144\u2013158."},{"key":"13_CR8","unstructured":"Cesta, A., Oddi, A. and Smith, S. (2000) A constraint-based method for project scheduling with time windows. Journal of Heuristics (to appear)."},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1023\/A:1009621410177","volume":"6","author":"B. Backer De","year":"2000","unstructured":"De Backer, B., Furnon, V., Shaw, P., Kilby, P. and Prosser, P. (2000) Solving vehicle routing problems using constraint programming and meta-heuristics. Journal of Heuristics, 6, 481\u2013500.","journal-title":"Journal of Heuristics"},{"key":"13_CR10","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1007\/BF02023076","volume":"41","author":"M. Dell\u2019Amico","year":"1993","unstructured":"Dell\u2019Amico, M. and Trubian, M. (1993) Applying tabu-search to the job-shop scheduling problem. Annals of Operations Research, 41, 231\u2013252.","journal-title":"Annals of Operations Research"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"T. Feo","year":"1995","unstructured":"Feo, T. and Resende, M. (1995) Greedy randomized adaptive search procedures. Journal of Global Optimization, 6, 109\u2013133.","journal-title":"Journal of Global Optimization"},{"key":"13_CR12","unstructured":"Focacci, F., Laborie, P. and Nuijten, W. (2000a) Solving scheduling problems with setup times and alternative resources. In: Proceedings of the Fifth International Conference on Artificial Intelligence Planning and Scheduling. AIPS\u201900. AAAI Press."},{"key":"13_CR13","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1007\/978-3-540-48085-3_14","volume-title":"Principle and Practice of Constraint Programming\u2014tCP\u201999, LNCS 1713","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A. and Milano, M. (1999a) Cost-based domain filtering. In: J. Jaffar (ed.), Principle and Practice of Constraint Programming\u2014tCP\u201999, LNCS 1713. Springer-Verlag, Berlin Heidelberg, pp. 189\u2013203."},{"key":"13_CR14","first-page":"515","volume-title":"Logic Programming\u2014Proceedings of the 1999 International Conference on Logic Programming","author":"F. Focacci","year":"1999","unstructured":"Focacci, F., Lodi, A. and Milano, M. (1999b) Solving TSP with time windows with constraints. In: D. De Schreye, (ed.), Logic Programming\u2014Proceedings of the 1999 International Conference on Logic Programming. The MIT-press, Cambridge, Massachusetts, pp. 515\u2013529."},{"key":"13_CR15","first-page":"5","volume":"91","author":"F. Focacci","year":"2000","unstructured":"Focacci, F., Lodi, A., Milano, M. and Vigo, D. (2000b) An introduction to constraint programming. Ricerca Operativa, 91, 5\u201320.","journal-title":"Ricerca Operativa"},{"key":"13_CR16","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","volume":"40","author":"M. Gendreau","year":"1992","unstructured":"Gendreau, M., Hertz, A. and Laporte, G. (1992) New insertion and postoptimization procedures for the traveling salesman problem. Operations Research, 40, 1086\u20131094.","journal-title":"Operations Research"},{"key":"13_CR17","doi-asserted-by":"crossref","first-page":"426","DOI":"10.1287\/ijoc.7.4.426","volume":"7","author":"F. Glover","year":"1995","unstructured":"Glover, F. (1995) Tabu thresholding: Improved search by nonmonotonic trajectories. ORSA Journal on Computing, 7, 426\u2013442.","journal-title":"ORSA Journal on Computing"},{"key":"13_CR18","volume-title":"Vehicle Routing: Methods and Studies","author":"B. Golden","year":"1988","unstructured":"Golden, B. and Assad, A. (1988) Vehicle Routing: Methods and Studies. North-Holland, Amsterdam."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0004-3702(80)90051-X","volume":"14","author":"R. Haralick","year":"1980","unstructured":"Haralick, R. and Elliott, G. (1980) Increasing tree search efficiency for constraint satisfaction problems. Artificial Intelligence, 14, 263\u2013313.","journal-title":"Artificial Intelligence"},{"key":"13_CR20","unstructured":"Harvey, W. (1995) Nonsystematic Backtracking Search. PhD thesis, Stanford University."},{"key":"13_CR21","unstructured":"Harvey, W. and Ginsberg, M. (1995) Limited discrepancy search. In: Proceedings of the 14th IJCAI. Morgan Kaufmann, pp. 607\u2013615."},{"key":"13_CR22","unstructured":"Junker, U. (2000) Preference-based search for scheduling. In Proceedings of the Seventeenth National Conference on Artificial Intelligence\u2014AAAI-2000, pp. 904\u2013909."},{"key":"13_CR23","first-page":"337","volume-title":"Local Search in Combinatorial Optimization","author":"G. Kindervater","year":"1997","unstructured":"Kindervater, G. and Savelsbergh, M. (1997) Vehicle routing: Handling edges exchanges. In: E. Aarts and J.K. Lenstra (eds.), Local Search in Combinatorial Optimization, J. Wiley & Sons, Chichester, pp. 337\u2013360."},{"key":"13_CR24","unstructured":"Laburthe, F. (2000) CHOCO: implementing a CP kernel. In: CP\u201900 Post Conference Workshop on Techniques for Implementing Constraint programming Systems\u2014TRICS. Singapore."},{"key":"13_CR25","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S. Lin","year":"1973","unstructured":"Lin, S. and Kernighan, B. (1973) An effective heuristic for the traveling salesman problem. Operations Research, 21, 498\u2013516.","journal-title":"Operations Research"},{"key":"13_CR26","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0004-3702(77)90007-8","volume":"8","author":"A. Mackworth","year":"1977","unstructured":"Mackworth, A. (1977) Consistency in networks of relations. Artificial Intelligence, 8, 99\u2013118.","journal-title":"Artificial Intelligence"},{"key":"13_CR27","doi-asserted-by":"crossref","unstructured":"Marriott, K. and Stuckey, P. (1998) Programming with Constraints. The MIT Press.","DOI":"10.7551\/mitpress\/5625.001.0001"},{"key":"13_CR28","volume-title":"Proceedings of the 2nd International Conference on Meta-Heuristics","author":"T. Mautor","year":"1997","unstructured":"Mautor, T. and Michelon, P. (1997) MIMAUSA: A new hybrid method combining exact solution and local search. In: Proceedings of the 2nd International Conference on Meta-Heuristics. Sophia-Antipolis, France."},{"key":"13_CR29","first-page":"237","volume-title":"Principle and Practice of Constraint Programming\u2014CP\u201997, LNCS 1330","author":"L. Michel","year":"1997","unstructured":"Michel, L. and van Hentenryck, P. (1997) Localizer: A modeling language for local search. In: G. Smolka (ed.), Principle and Practice of Constraint Programming\u2014CP\u201997, LNCS 1330. Berlin Heidelberg, Springer-Verlag, pp. 237\u2013251."},{"key":"13_CR30","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0004-3702(92)90007-K","volume":"58","author":"S. Minton","year":"1992","unstructured":"Minton, S., Johnston, M., Philips, A. and Laird, P. (1992) Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence, 58, 161\u2013205.","journal-title":"Artificial Intelligence"},{"key":"13_CR31","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N. Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N. and Hansen, P. (1997) Variable neighborhood search. Computers & Operations Research, 24, 1097\u20131100.","journal-title":"Computers & Operations Research"},{"key":"13_CR32","volume-title":"Time and Resource Constrainted Scheduling, a Constraint Satisfaction Approach","author":"W. Nuijten","year":"1994","unstructured":"Nuijten, W. (1994) Time and Resource Constrainted Scheduling, a Constraint Satisfaction Approach. PhD thesis, University of Eindhoven, The Netherlands."},{"key":"13_CR33","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1023\/A:1009687210594","volume":"3","author":"W. Nuijten","year":"1998","unstructured":"Nuijten, W. and Le Pape, C. (1998) Constraint based job shop scheduling with ILOG scheduler. Journal ofHeuristics, 3, 271\u2013286.","journal-title":"Journal ofHeuristics"},{"key":"13_CR34","first-page":"353","volume-title":"Principle and Practice of Constraint Programming\u2014CP\u201996, LNCS 1118","author":"G. Pesant","year":"1996","unstructured":"Pesant, G. and Gendreau, M. (1996) A view of local search in constraint programming. In: E. Freuder, (ed.), Principle and Practice of Constraint Programming\u2014CP\u201996, LNCS 1118. Springer-Verlag, Berlin Heidelberg, pp. 353\u2013366."},{"key":"13_CR35","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1023\/A:1009694016861","volume":"5","author":"G. Pesant","year":"1999","unstructured":"Pesant, G. and Gendreau, M. (1999) A constraint programming framework for local search methods. Journal ofHeuristics, 5, 255\u2013279.","journal-title":"Journal ofHeuristics"},{"key":"13_CR36","doi-asserted-by":"crossref","first-page":"12","DOI":"10.1287\/trsc.32.1.12","volume":"32","author":"G. Pesant","year":"1998","unstructured":"Pesant, G., Gendreau, M., Potvin, J. and Rousseau, J. (1998) An exact constraint logic programming algorithm for the travelling salesman problem with lime windows. Transportation Science, 32, 12\u201329.","journal-title":"Transportation Science"},{"key":"13_CR37","first-page":"420","volume-title":"Principle and Practice of Constraint Programming\u2014CP\u201997, LNCS 1330","author":"G. Pesant","year":"1997","unstructured":"Pesant, G., Gendreau, M. and Rousseau, J.-M. (1997) GENIUS-CP: A generic single-vehicle routing algorithm. In: G. Smolka (ed.), Principle and Practice of Constraint Programming\u2014CP\u201997, LNCS 1330. Springer-Verlag, Berlin Heidelberg, pp. 420\u2013433."},{"key":"13_CR38","unstructured":"Prais, M. and Ribeiro, C. (1998) Reactive grasp: an application to a matrix decomposition problem in TDMA traffic assignment. Technical report, Catholic University of Rio de Janeiro, Department of Computer Science."},{"key":"13_CR39","first-page":"337","volume-title":"Principle and Practice of Constraint Programming\u2014CP2000, LNCS 1894","author":"S. Prestwich","year":"2000","unstructured":"Prestwich, S. (2000) A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In: R. Dechter (ed.), Principle and Practice of Constraint Programming\u2014CP2000, LNCS 1894. Springer-Verlag, Berlin Heidelberg, pp. 337\u2013352."},{"key":"13_CR40","unstructured":"R\u00e9gin, J. (1994) A filtering algorithm for constraints of difference in CSPs. In: Proceedings of the Twelfth National Conference on Artificial Intelligence\u2014AAAI\u201994, pp. 362\u2013367."},{"key":"13_CR41","unstructured":"Reinelt, G. (1994) The Traveling Salesman: Computational Solutions for TSP Applications. Springer-Verlag."},{"key":"13_CR42","doi-asserted-by":"crossref","first-page":"156","DOI":"10.1287\/trsc.29.2.156","volume":"29","author":"R. Russell","year":"1995","unstructured":"Russell, R. (1995) Hybrid heuristics for the vehicle routing problem with time windows. Transportation Science, 29, 156\u2013166.","journal-title":"Transportation Science"},{"key":"13_CR43","unstructured":"Schimpf, J., Novello, S. and Sakkout, H. (1997) IC-Parc ECLiPSe Library Manual."},{"key":"13_CR44","first-page":"290","volume-title":"Proceedings of IJCAI-93, 13th International Joint Conference on Artificial Intelligence","author":"B. Selman","year":"1993","unstructured":"Selman, B. and Kautz, H. (1993) Domain-independent extension to GSAT: Solving large structured satisfiability problems. In: Proceedings of IJCAI-93, 13th International Joint Conference on Artificial Intelligence. Sidney, AU, pp. 290\u2013295."},{"key":"13_CR45","first-page":"440","volume-title":"Proceedings of the Tenth National Conference on Artificial Intelligence","author":"B. Selman","year":"1992","unstructured":"Selman, B., Levesque, H. and Mitchell, D. (1992) A new method for solving hard satisfiability problems. In: P. Rosenbloom and P. Szolovits (eds.), Proceedings of the Tenth National Conference on Artificial Intelligence. AAAI Press, Menlo Park, California, pp. 440\u2013446."},{"key":"13_CR46","first-page":"417","volume-title":"Principle and Practice of Constraint Programming\u2014CP\u201998, LNCS 1520","author":"P. Shaw","year":"1998","unstructured":"Shaw, P. (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: M. Maher and J.-F. Puget (eds.), Principle and Practice of Constraint Programming\u2014CP\u201998, LNCS 1520. Springer-Verlag, Berlin Heidelberg, pp. 417\u2013431."},{"key":"13_CR47","volume-title":"Proceedings of CP-AI-OR\u201900","author":"P. Shaw","year":"2000","unstructured":"Shaw, P., Furnon, V. and De Backer, B. (2000) A lightweight addition to CP frameworks for improved local search. In: Proceedings of CP-AI-OR\u201900. Padderborn, Germany."},{"key":"13_CR48","unstructured":"Solver (2000) ILOG Solver 5.0 User\u2019s Manual and Reference Manual. ILOG, S.A."},{"key":"13_CR49","doi-asserted-by":"crossref","unstructured":"Toth, P. and Vigo, D. (2002) The Vehicle Routing Problem. Monographs on Discrete Mathematics and Applications. SIAM.","DOI":"10.1137\/1.9780898718515"},{"key":"13_CR50","unstructured":"van Hentenryck, P., Saraswat, V. and Deville, Y. (1993) Evaluation of the constraint language cc(FD). Technical Report CS-93-02, Brown University."},{"key":"13_CR51","doi-asserted-by":"crossref","unstructured":"Walser, J. (1999) Integer Optimization by Local Search, Volume 1637 of Lecture Notes in Artificial Intelligence. Springer Verlag.","DOI":"10.1007\/3-540-48369-1"},{"key":"13_CR52","unstructured":"Walsh, T. (1997). Depth-bounded discrepancy search. In: Proceedings of the 15th International Joint Conference on Artificial Intelligence\u2014IJCAI. Morgan Kaufmann."}],"container-title":["International Series in Operations Research & Management Science","Handbook of Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/0-306-48056-5_13.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T00:20:17Z","timestamp":1619482817000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/0-306-48056-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["1402072635"],"references-count":52,"URL":"https:\/\/doi.org\/10.1007\/0-306-48056-5_13","relation":{},"subject":[]}}