Hybrid strategies of enumeration in constraint solving
Autor
Monfroy E.
Crawford B.
Soto R.
Paredes F.
Resumen
Enumeration strategies (that is, selection of a variable and a value of its domain) are crucial components of Constraint Programming: they significantly influence the performances of the solving process, sometimes of several orders of magnitude. In this paper, we propose to use Local Search in order to help and guide enumeration: we extend the usual variable selection strategies of constraint programming and we perform the value selection with respect to the results of some local search. The experimental results obtained are rather promising. © 2011 Academic Journals.
Colecciones
Ítems relacionados
Mostrando ítems relacionados por Título, autor o materia.
-
Conference Paper
Enumeration strategies for solving constraint satisfaction problems: A performance evaluation (2020)
Soto R.; Crawford B.; Olivares R.; Herrera R.; Johnson F.; Paredes F. (Springer Verlag, 2015) -
Article
Online control of enumeration strategies via bat algorithm and black hole optimization (2020)
Soto R.; Crawford B.; Olivares R.; Niklander S.; Johnson F.; Paredes F.; Olguín E. (Springer Netherlands, 2017) -
Article
A hybrid AC3-tabu search algorithm for solving Sudoku puzzles (2020)
Soto R.; Crawford B.; Galleguillos C.; Monfroy E.; Paredes F. (2013)