A hyperheuristic approach to select enumeration strategies in constraint programming

BRODERICK CRAWFORD LABRIN, Mauricio Montecinos, Carlos Castro, Eric Monfroy

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

2 Scopus citations

Abstract

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 stretegies 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.

Original languageEnglish
Title of host publicationACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies
Pages265-267
Number of pages3
DOIs
StatePublished - 1 Dec 2009
EventInternational Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009 - Trivandrum, Kerala, India
Duration: 28 Dec 200929 Dec 2009

Publication series

NameACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies

Conference

ConferenceInternational Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009
CountryIndia
CityTrivandrum, Kerala
Period28/12/0929/12/09

Keywords

  • Constraint programming
  • Constraint satisfaction problems
  • Enumeration strategies
  • Value ordering heuristics
  • Variable ordering heuristics

Fingerprint Dive into the research topics of 'A hyperheuristic approach to select enumeration strategies in constraint programming'. Together they form a unique fingerprint.

Cite this