A Hyperheuristic Approach for Dynamic Enumeration Strategy Selection in Constraint Satisfaction
In this work we show a framework for guiding the classical constraint programming resolution process. Such a framework allows one to measure the resolution process state in order to perform an “on the fly”replacement of strategies exhibiting poor performances. The replacement is performed depending on a quality rank, which is computed by means of a choice function. The choice function determines the performance of a given strategy in a given amount of time through a set of indicators and control parameters. The goal is to select promising strategies to achieve efficient resolution processes. 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.
KeywordsConstraint Programming Reactive Search Heuristic Search
Unable to display preview. Download preview PDF.
- 1.Barták, R., Rudová, H.: Limited assignments: A new cutoff strategy for incomplete depth-first search. In: Proceedings of the 20th ACM Symposium on Applied Computing (SAC), pp. 388–392 (2005)Google Scholar
- 3.Boussemart, F., Hemery, F., Lecoutre, C., Sais, L.: Boosting systematic search by weighting constraints. In: Proceedings of the 16th Eureopean Conference on Artificial Intelligence (ECAI), pp. 146–150. IOS Press, Amsterdam (2004)Google Scholar
- 4.Chenouard, R., Granvilliers, L., Sebastian, P.: Search heuristics for constraint-aided embodiment design. AI EDAM 23(2), 175–195 (2009)Google Scholar