Show simple item record

dc.contributor.authorCrawford B.
dc.contributor.authorCastro C.
dc.contributor.authorMonfroy E.
dc.contributor.authorSoto R.
dc.contributor.authorPalma W.
dc.contributor.authorParedes F.
dc.date.accessioned2020-09-02T22:15:34Z
dc.date.available2020-09-02T22:15:34Z
dc.date.issued2012
dc.identifier.citation15, 2, 106-128
dc.identifier.issn14538245
dc.identifier.urihttps://hdl.handle.net/20.500.12728/4109
dc.descriptionThe main goal concerning Constraint Satisfaction Problems is to determine a value assignment for variables satisfying a set of constraints, or otherwise, to conclude that such an assignment does not exist (the set of constraints is unsatisfiable). In the Constraint Programming resolution process, it is known that the order in which the variables are assigned have a significant impact in terms of computational cost. In this paper we propose a new framework for guiding the classical Constraint Programming resolution process. Such a framework is able to measure the resolution process, using some indicators, in order to perform on-the-fly replacements of variable/value ordering heuristics exhibiting poor performances. The replacement is performed depending on a quality rank, which is computed by means of a choice function-based Hyperheuristic, where its parameters are fine-tuned by a Genetic Algorithm which trains the choice function carrying out a sampling phase. The experimental results show the effectiveness of our approach where our combination of strategies outperforms the use of individual strategies.
dc.language.isoen
dc.titleDynamic selection of enumeration strategies for solving constraint satisfaction problems
dc.typeArticle


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record