Anzeige
Erschienen in:
2012 | OriginalPaper | Buchkapitel
Activity-Based Search for Black-Box Constraint Programming Solvers
verfasst von : Laurent Michel, Pascal Van Hentenryck
Erschienen in: Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
Robust search procedures are a central component in the design of black-box constraint-programming solvers. This paper proposes activity-based search which uses the activity of variables during propagation to guide the search. Activity-based search was compared experimentally to impact-based search and the
wdeg
heuristics but not to solution counting heuristics. Experimental results on a variety of benchmarks show that activity-based search is more robust than other heuristics and may produce significant improvements in performance.