A Hybrid Approach for the Sudoku Problem: Using Constraint Programming in Iterated Local Search

Sudoku is not only a popular puzzle but also an interesting and challenging constraint satisfaction problem. Therefore, automatic solving methods have been the subject of several publications in the past two decades. Although current methods provide good solutions for small-sized puzzles, larger ins...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE intelligent systems Ročník 32; číslo 2; s. 52 - 62
Hlavní autoři: Musliu, Nysret, Winter, Felix
Médium: Journal Article
Jazyk:angličtina
Vydáno: Los Alamitos IEEE 01.03.2017
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
constraint programming
Cost function
Documents
Heuristic
Heuristic algorithms
heuristic methods
hybrid techniques
Intelligent systems
iterated local search
min-conflicts heuristic
Perturbation methods
Programming
Puzzles
Scheduling
Scheduling algorithms
Search problems
Searching
Stochastic processes
Sudoku
Theory of constraints
ISSN:1541-1672, 1941-1294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Sudoku is not only a popular puzzle but also an interesting and challenging constraint satisfaction problem. Therefore, automatic solving methods have been the subject of several publications in the past two decades. Although current methods provide good solutions for small-sized puzzles, larger instances remain challenging. This article introduces a new local search technique based on the min-conflicts heuristic for Sudoku. Furthermore, the authors propose an innovative hybrid search technique that exploits constraint programming as a perturbation technique within the iterated local search framework. They experimentally evaluate their methods on challenging benchmarks for Sudoku and report improvements over state-of-the-art solutions. To show the generalizability of the proposed approach, they also applied their method on another challenging scheduling problem. The results show that the proposed method is also robust in another problem domain.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1541-1672
1941-1294
DOI:10.1109/MIS.2017.29