Hybrid CSP solving

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3717 LNAI, Issue , 2005, Pages 138-167

  Monfroy, Eric ^a,c   Saubion, Frédéric ^b   Lambert, Tony ^b,c  

^a DEPARTAMENTO DE FÍSICA   (Chile)

^b UNIVERSITÉ D'ANGERS   (France)

^c UNIVERSITÉ DE NANTES   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; GENETIC ALGORITHMS; INTEGRATION; ITERATIVE METHODS; NUMERICAL METHODS; OPTICAL RESOLVING POWER; PROBLEM SOLVING;

CHAOTIC ITERATIONS; CONSTRAINT PROPAGATIONS; ELEMENTARY FUNCTIONS; HYBRIDIZATIONS;

COMPUTATION THEORY;

EID: 33646170224     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11559306_8     Document Type: Conference Paper

References (34)

1. E. Aarts and J.K. Lenstra, editors. Local Search in Combinatorial Optimization. John Wiley and Sons, 1997.
2. A. Aggoun and N. Beldiceanu. Overview of the chip compiler system. In K. Purukawa, editor, Logic Programming, Proceedings of the Eigth International Conference, pages 775-789. MIT Press, 1991.
3. K. Apt. The rough guide to constraint propagation. In Proceedings of the 5th International Conference on Principles and Practice of Constraint Programming (CP'99), volume 1713 of Lecture Notes in Computer Science, pages 1-23, Springer, 1999. (Invited lecture).
4. K. Apt. From chaotic iteration to constraint propagation. In Proceedings of ICALP '97, volume 1256 of Lecture Notes in Computer Science, pages 36-55. Springer, 1997.
5. K. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
6. T. Back, J. M. de Graaf, J. N. Kok, and W. A. Kosters. Theory of genetic algorithms. In Current Trends in Theoretical Computer Science, pages 546-578. 2001.
7. J. E. Baker. Adaptive Selection Methods for Genetic Algorithms. ICGA, pages 101-111, 1985.
8. C. Castro and S. Manzano. Variable and value ordering when solving balanced academic curriculum problems. In Proceedings of 6th Workshop of the ERCIM WG on Constraints. CoRR cs. PL/0110007, 2001.
9. R. Dechter. Constraint Processing. Morgan Kaufmann, 2003.
10. A. E. Eiben, P-E. Raué and Z. Ruttkay. Genetic algorithms with multi-parent recombination. In PPSN III: Proceedings of the International Conference on Evolutionary Computation, volume 866 of Lecture Notes in Computer Science, pages 78-87, Springer, 1994.
11. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science, Kluwer, 2002.
12. T. Fruewirth and S. Abdennadher. Essentials of Constraint Programming. Springer, 2003.
13. I. Gent, T. Walsh, and B. Selman. http://www.csplib.org, funded by the UK Network of Constraints.
14. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
15. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co., Inc., 1989.
16. L. Granvilliers and E. Monfroy. Implementing Constraint Propagation by Composition of Reductions. Proceedings of International Conference on Logic Programming, volume 2916 of Lecture Notes in Computer Science, pages 300-314, Springer, 2003.
17. J. H. Holland. Adaptation in Natural and Artificial Systems. 1975.
18. H. Hoos and T. Stülze. Stochastic local search : foundations and applications. Morgan Kaufmann, Elsevier, 2004.
19. ILOG. ILOG Solver 5.0 User's Manual and Reference Manual, 2000.
20. K. A. D. Jong. An analysis of the behavior of a class of genetic adaptive systems. Phd thesis, University of Michigan, 1975.
21. N. Jussien and O. Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1):21-45, 2002.
22. F. Laburthe. CHOCO: implementing a cp kernel. In CP'00 Post Conference Workshop on Techniques for Implementing Constraint Programming Systems - TRIGS, 2000.
23. T. Lambert and E. Monfroy and F. Saubion. Solving Strategies using a Hybridization Model for Local Search and Constraint Propagation. In Proceedings of ACM SAC'2005, pages 398-403, ACM Press 2005.
24. A. Mackworth. Encyclopedia on Artificial Intelligence, chapter Constraint Satisfaction. John Wiley, 1987.
25. K. Mariott and P. Stuckey. Programming with Constraints, An introduction. MIT Press, 1998.
26. Z. Michalewicz. Genetic algorithms + data structures = evolution programs (3rd, extended ed.). Springer, New York, 1996.
27. R. Mohr and T.C. Henderson. Arc and path consistency revisited. Artificial Intelligence, 28:225-233, 1986.
28. E. Monfroy, F. Saubion and T. Lambert. On Hybridization of Local Search and Constraint Propagation. In Proceedings of ICLP'2004, pages 299-313, volume 3132 of Lecture Notes in Computer Science, Springer, 2004.
29. P. Pardalos and M. Resende. Handbook of Applied Optimization. Oxford University Press, 2002.
30. 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, volume 1118 in Lecture Notes in Computer Science, pages 353-366. Springer, 1996.
31. S. Prestwich. A hybrid search architecture applied to hard random 3-sat and low-autocorrelation binary sequences. In Principle and Practice of Constraint Programming - CP 2000, volume 1894 in Lecture Notes in Computer Science, pages 337-352. Springer, 2000.
32. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Principles and Practice of Constraint Programming - CP98, volume 1520 of Lecture Notes in Computer Science, pages 417-431. Springer, 1998.
33. D. Thierens and D. E. Goldberg. Convergence Models of Genetic Algorithm Selection Schemes. In PPSN III: Proceedings of the International Conference on Evolutionary Computation, volume 866 of Lecture Notes in Computer Science, pages 119-129,Springer, 1994.
34. E. Tsang. Foundations of Constraint Satisfaction. Academic Press, London, 1993.