A hyperheuristic approach for constraint solving

Broderick Crawford, Carlos Castro, Eric Monfroy

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

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.

Original languageEnglish
Title of host publicationProceedings - 2010 IEEE Electronics, Robotics and Automotive Mechanics Conference, CERMA 2010
Pages168-173
Number of pages6
DOIs
StatePublished - 2010
Event2010 7th IEEE Electronics, Robotics and Automotive Mechanics Conference, CERMA 2010 - Cuernavaca, Mexico
Duration: 28 Sep 20101 Oct 2010

Publication series

NameProceedings - 2010 IEEE Electronics, Robotics and Automotive Mechanics Conference, CERMA 2010

Conference

Conference2010 7th IEEE Electronics, Robotics and Automotive Mechanics Conference, CERMA 2010
Country/TerritoryMexico
CityCuernavaca
Period28/09/101/10/10

Fingerprint

Dive into the research topics of 'A hyperheuristic approach for constraint solving'. Together they form a unique fingerprint.

Cite this