Activity-Based Search for Black-Box Constraint Programming Solvers

Select |




Print


Michel, Laurent; Van Hentenryck, Pascal


2012-05-28


Conference Material


International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR)


Nantes, France


228-243


Robust search procedures are a central component in the de- sign of black-box constraint-programming solvers. This paper proposes activity-based search which uses the activity of variables during propaga- tion to guide the search. Activity-based search was compared experimen- tally to impact-based search and the wdeg heuristics but not to solu- tion counting heuristics. Experimental results on a variety of benchmarks show that activity-based search is more robust than other heuristics and may produce signicant improvements in performance.


http://www.emn.fr/z-info/cpaior-2012/


nicta:5862


Michel, Laurent; Van Hentenryck, Pascal. Activity-Based Search for Black-Box Constraint Programming Solvers. In: International Conference on Integration of Artificial Intelligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems (CPAIOR); Nantes, France. 2012-05-28. 228-243. http://hdl.handle.net/102.100.100/100681?index=1



Loading citation data...

Citation counts
(Requires subscription to view)