Constraint-Based Local Search
Parallel and distributed local search in COMET
Computers and Operations Research
Revisiting constraint-directed search
Information and Computation
Model-driven visualizations of constraint-based local search
CP'07 Proceedings of the 13th international conference on Principles and practice of constraint programming
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Synthesis of search algorithms from high-level CP models
CP'11 Proceedings of the 17th international conference on Principles and practice of constraint programming
An automated approach to generating efficient constraint solvers
Proceedings of the 34th International Conference on Software Engineering
A high level language for solver independent model manipulation and generation of hybrid solvers
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
| Hi-index | 0.00 |
The gap in automation between MIP/SAT solvers and those for constraint programming and constraint-based local search hinders experimentation and adoption of these technologies and slows down scientific progress. This paper addresses this important issue: It shows how effective local search procedures can be automatically synthesized from models expressed in a rich constraint language. The synthesizer analyzes the model and derives the local search algorithm for a specific meta-heuristic by exploiting the structure of the model and the constraint semantics. Experimental results suggest that the synthesized procedures only induce a small loss in efficiency on a variety of realistic applications in sequencing, resource allocation, and facility location.