A Hyperheuristic Approach for Constraint Solving

Abstract

In this work we propose a Choice Function for guiding Constraint Programming in the resolution of Constraint Satisfaction Problems. We exploit some search process features to select on the fly the Enumeration Strategy (Variable + Value Selection Heuristics) in order to more efficiently solve the problem at hand. The main novelty of our approach is that we reconfigure the search based solely on performance data gathered while solving the current problem. We report encouraging results where our combination of strategies outperforms the use of individual strategies.