Solving strategies using a hybridization model for local search and constraint propagation

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2005, Pages 398-403

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

^a UNIVERSITÉ D'ANGERS   (France)

^b UNIVERSITÉ DE NANTES   (France)

^c DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

Constraint propagation; CSP; Hybrid resolution; Local search

Indexed keywords

COMPUTATIONAL GEOMETRY; COMPUTATIONAL METHODS; CONSTRAINT THEORY; LOGIC DESIGN; MATHEMATICAL MODELS;

CONSTRAINT PROPAGATION; CSP; HYBRID RESOLUTION; LOCAL SEARCH;

PROBLEM SOLVING;

EID: 33644546668     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066677.1066769     Document Type: Conference Paper

References (12)

1. E. Aarts and J. K. Lenstra. Local Search in Combinatorial Optimization. John Wiley & Sons, Inc., 1997.
2. K. R. Apt. From chaotic iteration to constraint propagation. In Proceedings of the 24th International Colloquium on Automata, Languages and Programming, pages 36-55. Springer-Verlag, 1997.
3. K. R. Apt. Principles of Constraint Programming. Cambridge University Press, 2003.
4. F. Focacci, F. Laburthe, and A. Lodi. Local search and constraint programming. In F. Glover and G. Kochenberger, editors, Handbook of Metaheuristics, volume 57 of International Series in Operations Research and Management Science. Kluwer Academic Publishers, Norwell, MA, 2002.
5. I. Gent, T. Walsh, and B. Selman. http://www.4c.ucc.ie/tw/csplib/, funded by the UK Network of Constraints.
6. F. Glover and M. Laguna. Tabu Search. Kluwer Academic Publishers, 1997.
7. L. Granvilliers and E. Monfroy. Implementing constraint propagation by composition of reductions. In Logic Programming, 19th International Conference, ICLP, volume 2916 of Lecture Notes in Computer Science, pages 300-314. Springer, 2003.
8. N. Jussien and O. Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139(1):21-45, 2002.
9. E. Monfroy, F. Saubion, and T. Lambert. On hybridization of local search and constraint propagation. In Proceedings of ICLP'2004, volume 3132 of LNCS, pages 299-313. Springer Verlag, 2004.
10. G. Pesant and M. Gendreau. A view of local search in constraint programming. In E. C. Freuder, editor, Principles and Practice of Constraint Programming, volume 1118 of Lecture Notes in Computer Science, pages 353-366. Springer, 1996.
11. S. Prestwich. A hybrid search architecture applied to hard random 3-SAT and low-autocorrelation binary sequences. In Proceedings of the 6th International Conference on Principles and Practice of Constraint Programming, pages 337-352. Springer-Verlag, 2000.
12. P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In Proceedings of the 4th International Conference on Principles and Practice of Constraint Programming, volume 1520, pages 417-431. Springer-Verlag, 1998.