A cooperative framework based on local search and constraint programming for solving discrete global optimisation

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

Volumn 3171, Issue , 2004, Pages 93-102

  Castro, Carlos ^a   Moossen, Michael ^a   Riff, María Cristina ^a  

^a DEPARTAMENTO DE FÍSICA   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMBINATORIAL OPTIMIZATION; COMPUTER PROGRAMMING; GLOBAL OPTIMIZATION; ITERATIVE METHODS; LOCAL SEARCH (OPTIMIZATION); OPTIMIZATION;

CAPACITY VEHICLE ROUTING PROBLEMS; CONSTRAINT PROGRAMMING; CONSTRAINT PROGRAMMING COMMUNITY; COOPERATIVE FRAMEWORKS; COOPERATIVE STRATEGY; GLOBAL OPTIMISATION; ITERATIVE IMPROVEMENTS; RECENT RESEARCHES;

CONSTRAINT THEORY;

EID: 34248666171     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-28645-5_10     Document Type: Article

References (16)

1. Alexander Bockmayr and Thomas Kasper. Branch-and-Infer: A unifying framework for integer and finite domain constraint programming. INFORMS J. Computing, 10(3):287-300, 1998. Also available as Technical Report MPI-I-97-2-008 of the Max Planck Institut für Informatik, Saarbrücken, Germany.
2. G. Castro and E. Monfroy. A Control Language for Designing Constraint Solvers. In Proceedings of Andrei Ershov Third International Conference Perspective of System Informatics, PSI'99, volume 1755 of Lecture Notes in Computer Science, pages 402-415, Novosibirsk, Akademgorodok, Russia, 2000. Springer-Verlag.
3. Carlos Castro and Eric Monfroy. Basic Operators for Solving Constraints via Collaboration of Solvers. In Proceedings of The Fifth International Conference on Artificial Intelligence and Symbolic Computation, Theory, Implementations and Applications, AISC 2000, volume 1930 of Lecture Notes in Artificial Intelligence, pages 142-156, Madrid, Spain, July 2000. Springer-Verlag.
4. Carlos Castro and Eric Monfroy. Towards a framework for designing constraint solvers and solver collaborations. Joint Bulletin of the Novosibirsk Computing Center (NCC) and the A. P. Ershov Institute of Informatics Systems (US). Series: Computer Science. Russian Academy of Sciences, Siberian Branch., 16:1-28, December 2001.
5. Filippo Focacci, Francois Laburthe, and Andrea Lodi. Constraint and Integer Programming: Toward a Unified Methodology, chapter 9, Local Search and Constraint Programming. Kluwer, November 2003.
6. L. Granvilliers, E. Monfroy, and F. Benhamou. Symbolic-Interval Cooperation in Constraint Programming. In Proceedings of the 26th International Symposium on Symbolic and Algebraic Computation (ISSAC'2001), pages 150-166, University of Western Ontario, London, Ontario, Canada, 2001. ACM Press.
7. Robert M. Haralick and Gordon L. Elliot. Increasing Tree Search Efficiency for Constraint Satisfaction Problems. Artificial Intelligence, 14:263-313, 1980.
8. Jussien and Lhomme. Local search with constraint propagation and conflict-based heuristics. Artificial Intelligence, 139:21-45, 2002.
9. Vipin Kumar. Algorithms for Constraint-Satisfaction Problems: A Survey. Artificial Intelligence Magazine, 13(1):32-44, Spring 1992.
10. Alan K. Mackworth. Consistency in Networks of Relations. Artificial Intelligence, 8:99-118, 1977.
11. Philippe Marti and Michel Rucher. A Distributed Cooperating Constraints Solving System. International Journal of Artificial Intelligence Tools, 4(1-2):93-113, 1995.
12. E. Monfroy, M. Rusinowitch, and R. Schott. Implementing Non-Linear Constraints with Cooperative Solvers. In K. M. George, J. H. Carroll, D. Oppenheim, and J. Hightower, editors, Proceedings of ACM Symposium on Applied Computing (SAC'96), Philadelphia, PA, USA, pages 63-72. ACM Press, February 1996.
13. Prestwich. Combining the scalability of local search with the pruning techniques of systematic search. Annals of Operations Research, 115:51-72, 2002.
14. M. Solomon. Algorithms for the vehicle routing and scheduling problem with time window constraints. Operations Research, pages 254-365, 1987.
15. Edward Tsang. Foundations of Constraint Satisfaction. Academic Press, 1993.
16. Martin Zahn and Walter Hower. Backtracking along with constraint processing and their time complexities. Journal of Experimental and Theoretical Artificial Intelligence, 8:63-74, 1996.