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.
A Hyperheuristic Approach for Constraint Solving
01.09.2010
246265 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
A General Approach for Constraint Solving by Local Search
British Library Online Contents | 2004
|Geometric Sketch Constraint Solving with User Feedback
British Library Conference Proceedings | 2013
|Geometric Sketch Constraint Solving with User Feedback
AIAA | 2014
|Solving Transient Scheduling Problems with Constraint Programming
British Library Online Contents | 2000
|