Optimizing index deployment order for evolving OLAP
Proceedings of the 15th International Conference on Extending Database Technology
Constraint propagation as the core of local search
SETN'12 Proceedings of the 7th Hellenic conference on Artificial Intelligence: theories and applications
Memory-based local search for simplified protein structure prediction
Proceedings of the ACM Conference on Bioinformatics, Computational Biology and Biomedicine
Comparing solution methods for the machine reassignment problem
CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming
A new genetic algorithm for simplified protein structure prediction
AI'12 Proceedings of the 25th Australasian joint conference on Advances in Artificial Intelligence
Hi-index | 0.00 |
The ubiquity of combinatorial optimization problems in our society is illustrated by the novel application areas for optimization technology, which range from supply chain management to sports tournament scheduling. Over the last two decades, constraint programming has emerged as a fundamental methodology to solve a variety of combinatorial problems, and rich constraint programming languages have been developed for expressing and combining constraints and specifying search procedures at a high level of abstraction. Local search approaches to combinatorial optimization are able to isolate optimal or near-optimal solutions within reasonable time constraints. This book introduces a method for solving combinatorial optimization problems that combines constraint programming and local search, using constraints to describe and control local search, and a programming language, COMET, that supports both modeling and search abstractions in the spirit of constraint programming. After an overview of local search including neighborhoods, heuristics, and metaheuristics, the book presents the architecture and modeling and search components of constraint-based local search and describes how constraint-based local search is supported in COMET. The book describes a variety of applications, arranged by meta-heuristics. It presents scheduling applications, along with the background necessary to understand these challenging problems. The book also includes a number of satisfiability problems, illustrating the ability of constraint-based local search approaches to cope with both satisfiability and optimization problems in a uniform fashion.