A hyperheuristic approach to select enumeration strategies in constraint programming

Broderick Crawford; Mauricio Montecinos; Carlos Castro; Eric Monfroy

doi:10.1109/ACT.2009.73

A hyperheuristic approach to select enumeration strategies in constraint programming

Broderick Crawford, Mauricio Montecinos, Carlos Castro, Eric Monfroy

SCHOOL OF COMPUTER ENGINEERING

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English
Title of host publication	ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies
Pages	265-267
Number of pages	3
DOIs	https://doi.org/10.1109/ACT.2009.73
State	Published - 2009
Event	International Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009 - Trivandrum, Kerala, India Duration: 28 Dec 2009 → 29 Dec 2009

Publication series

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

Conference

Conference	International Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009
Country/Territory	India
City	Trivandrum, Kerala
Period	28/12/09 → 29/12/09

Keywords

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

Access to Document

10.1109/ACT.2009.73

Cite this

Crawford, B., Montecinos, M., Castro, C., & Monfroy, E. (2009). A hyperheuristic approach to select enumeration strategies in constraint programming. In ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies (pp. 265-267). Article 5376709 (ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies). https://doi.org/10.1109/ACT.2009.73

Crawford, Broderick ; Montecinos, Mauricio ; Castro, Carlos et al. / A hyperheuristic approach to select enumeration strategies in constraint programming. ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies. 2009. pp. 265-267 (ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies).

@inproceedings{3adc3c63bac54689a292e82729a8b5a7,

title = "A hyperheuristic approach to select enumeration strategies in constraint programming",

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.",

keywords = "Constraint programming, Constraint satisfaction problems, Enumeration strategies, Value ordering heuristics, Variable ordering heuristics",

author = "Broderick Crawford and Mauricio Montecinos and Carlos Castro and Eric Monfroy",

year = "2009",

doi = "10.1109/ACT.2009.73",

language = "English",

isbn = "9780769539157",

series = "ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies",

pages = "265--267",

booktitle = "ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies",

note = "International Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009 ; Conference date: 28-12-2009 Through 29-12-2009",

}

Crawford, B, Montecinos, M, Castro, C & Monfroy, E 2009, A hyperheuristic approach to select enumeration strategies in constraint programming. in ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies., 5376709, ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies, pp. 265-267, International Conference on Advances in Computing, Control and Telecommunication Technologies, ACT 2009, Trivandrum, Kerala, India, 28/12/09. https://doi.org/10.1109/ACT.2009.73

A hyperheuristic approach to select enumeration strategies in constraint programming. / Crawford, Broderick; Montecinos, Mauricio; Castro, Carlos et al.
ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies. 2009. p. 265-267 5376709 (ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - A hyperheuristic approach to select enumeration strategies in constraint programming

AU - Crawford, Broderick

AU - Montecinos, Mauricio

AU - Castro, Carlos

AU - Monfroy, Eric

PY - 2009

Y1 - 2009

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

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

KW - Constraint programming

KW - Constraint satisfaction problems

KW - Enumeration strategies

KW - Value ordering heuristics

KW - Variable ordering heuristics

UR - http://www.scopus.com/inward/record.url?scp=77949295946&partnerID=8YFLogxK

U2 - 10.1109/ACT.2009.73

DO - 10.1109/ACT.2009.73

M3 - Conference contribution

AN - SCOPUS:77949295946

SN - 9780769539157

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

SP - 265

EP - 267

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

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

Y2 - 28 December 2009 through 29 December 2009

ER -

Crawford B, Montecinos M, Castro C, Monfroy E. A hyperheuristic approach to select enumeration strategies in constraint programming. In ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies. 2009. p. 265-267. 5376709. (ACT 2009 - International Conference on Advances in Computing, Control and Telecommunication Technologies). doi: 10.1109/ACT.2009.73

A hyperheuristic approach to select enumeration strategies in constraint programming

Abstract

Publication series

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this