Local Search with Constraint Propagation and Conflict-based Heuristics

Proceedings of the 17th National Conference on Artificial Intelligence and 12th Conference on Innovative Applications of Artificial Intelligence, AAAI 2000

Volumn , Issue , 2000, Pages 169-174

  Jussien, Narendra ^a   Lhomme, Olivier ^b  

^a ECOLE DES MINES DE NANTES   (France)

^b IBM   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; CONSTRAINT THEORY; LOCAL SEARCH (OPTIMIZATION);

CONSTRAINT PROPAGATION; CONSTRAINT-SATISFACTION PROBLEMS; DOMAIN FILTERING; FILTERING TECHNIQUE; HARD INSTANCES; LOCAL SEARCH; OPEN SHOP SCHEDULING PROBLEM; SEARCH SPACES; SOLVING ALGORITHM;

CONSTRAINT SATISFACTION PROBLEMS;

EID: 84984590182     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (31)

1. Alcaide, D.; Sicilia, J.; and Vigo, D. 1997. A tabu search algorithm for the open shop problem. TOP: Trabajos de Investigación Operativa 5(2):283-296.
2. Bessière, C. 1991. Arc consistency in dynamic constraint satisfaction problems. In Proceedings AAAI'91.
3. Bliek, C. 1998. Generalizing partial order and dynamic backtracking. In Proceedings of AAAI.
4. Brucker, P.; Hurink, J.; Jurisch, B.; and Westmann, B. 1994. A branch and bound algorithm for the open-shop problem. Technical report, Osnabrueck University.
5. Carlier, J., and Pinson, E. 1994. Adjustment of heads and tails for the job-shop problem. European Journal of Operational Research 78:146-161.
6. Codognet, P.; Fages, F.; and Sola, T. 1993. A metalevel compiler of CLP(FD) and its combination with intelligent backtracking. In Benhamou, F., and Colmerauer, A., eds., Constraint Logic Programming - Selected Research. Massachussetts Institute of Technology. chapter 23, 437-456.
7. David, P. 1997. A constraint-based approach for examination timetabling using local repair techniques. In Proceedings of the Second International Conference on the Practice And Theory of Automated Timetabling (Patat'97), 132-145.
8. th Conference on Tools with Artificial Intelligence (TAI'96), 299-306.
9. Frost, and Dechter. 1994. Dead-end driven learning. In 12th National Conf. on Artificial Intelligence, AAAI94.
10. Gervet, C. 1998. Large combinatorial optimization problem methodology for hybrid models and solutions (invited talk). In JFPLC.
11. Ginsberg, M., and McAllester, D. A. 1994. Gsat and dynamic backtracking. In International Conference on the Principles of Knowledge Representation (KR94), 226-237.
12. Ginsberg, M. 1993. Dynamic backtracking. Journal of Artificial Intelligence Research 1:25-46.
13. Glover, F., and Laguna, M. 1993. Modern heuristic Techniques for Combinatorial Problems, chapter Tabu Search, C. Reeves. Blackwell Scientific Publishing.
14. Gonzales, T., and Sahni, S. 1976. Open-shop scheduling to minimize finish time. Journal of the Association for Computing Machinery 23(4):665-679.
15. Jackson, P. 1990. Introduction to Expert Systems. Readings. Addison Wesley.
16. Jussien, N., and Lhomme, O. 1998. Dynamic domain splitting for numeric csp. In European Conference on Artificial Intelligence, 224-228.
17. Jussien, N. 1997. Relaxation de Contraintes pour les problèmes dynamiques. 1. thèse, Université de Rennes I.
18. Liaw, C.-F. 1998. A tabu search algorithm for the open shop scheduling problem. Computers and Operations Research 26.
19. Minton, S.; Johnston, M.; and Laird, P. 1992. Minimizing conflicts: A heuristic repair method for constraint satisfaction and scheduling problems. Artificial Intelligence 58:161-206.
20. Pesant, G., and Gendreau, M. 1996. A view of local search in constraint programming. In Proc. of the Principles and Practice of Constraint Programming, 353-366. Springer-Verlag.
21. Prosser, P. 1993. Hybrid algorithms for the constraint satisfaction problem. Computational Intelligence 9(3):268-299. (Also available as Technical Report AISL-46-91, Stratchclyde, 1991).
22. Richards, E. T., and Richards, E. B. 1998. Non-systematic search and learning: An empirical study. In Proc. of the the Conference on Principles and Practice of Constraint Programming.
23. Schaerf, A. 1997. Combining local search and look-ahead for scheduling and constraint satisfaction problems. In Proc. of the 15th International Joint Conf. on Artificial Intelligence (IJCAI-96), 1254-1259. Nagoya, Japan: Morgan Kaufmann.
24. Schiex, T., and Verfaillie, G. 1994. Nogood Recording fot Static and Dynamic Constraint Satisfaction Problems. International Journal of Artificial Intelligence Tools 3(2):187-207.
25. Selman, B., and Kautz, H. 1993. Domain-independent extensions to gsat: Solving large structured satisfiability problems. In Bajcsy, R., ed., Proceedings of International Joint Conference on Artificial Intelligence (IJCAI-93), 290-295. Chambery, France: Morgan Kaufmann.
26. Selman, B.; Levesque, H.; and Mitchell, D. 1992. A new method for solving hard satisfiability problems. In AAAI 92, Tenth National Conference on Artificial Intelligence, 440-446.
27. Stuckey, P., and Tam, V. 1998. Extending GENET with lazy arc consistency. IEEE Transactions on Systems, Man, and Cybernetics 28(5):698-703.
28. Taillard, É. 1993. Benchmarks for basic scheduling problems. European Journal of Operations Research 64:278-285.
29. Verfaillie, G., and Lobjois, L. 1999. Problèmes incohérents: ex-pliquer l'incohérence, restaurer la cohérence. In Actes des JNPC.
30. Verfaillie, G., and Schiex, T. 1994. Dynamic backtracking for dynamic csps. In Schiex, T., and Bessière, C., eds., Proceedings ECAI'94 Workshop on Constraint Satisfaction Issues raised by Practical Applications.
31. Yokoo, M. 1994. Weak-commitment search for solving constraint satisfaction problems. In Proceedings of AAAI.