A Hyperheuristic Approach to Select Enumeration Strategies in Constraint Programming

This work is focused on the Enumeration phase of Constraint Programming to solve Constraint Satisfaction Problems, an enumeration strategy is constituted by a variable selection heuristic and a value selection heuristic. A suitable definition and use of the enumeration strategy can strongly improve the resolution process. In order to select the enumeration strategies dynamically here we present a hyperheuristic approach using information about the search process. We report encouraging results where our combination of strategies outperforms the use of individual strategies.