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

Musliu, Nysret; Winter, Felix

doi:10.1109/mis.2017.29

Cited by 17 publications

(24 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For the purposes of comparison, in this paper we focus mainly on the work of Musliu, et al [26], who present an iterated local search algorithm with constraint programming which represents the state-of-the-art in stochastic search algorithms for the Sudoku problem, plus the algorithms of Knuth and Norvig [19,27].…”

Section: Related Workmentioning

confidence: 99%

“…Following [21] and [26], we generated random instances for the 9 × 9, 16 × 16 and 25 × 25 Sudoku problem. These were generated by running the ACS code with an initially blank grid, to produce a set of Sudoku solutions.…”

Section: General Instancesmentioning

confidence: 99%

“…Figures 5, 6 and 7 show the results for average execution time (for successful runs) and success rate for the four algorithms. As in [26] and [21], we Figure 4: Solution times over 100 runs for ACS, ILS, BS and DLX for the sixteen named logic-solvable 9 × 9 instances. In all cases ACS is plotted on the left side of the band corresponding to an instance, and ILS (the previous best stochastic algorithm) on the right.…”

Section: General Instancesmentioning

confidence: 99%

See 2 more Smart Citations

Solving Sudoku With Ant Colony Optimization

Lloyd

Amos

2020

IEEE Trans. Games

View full text Add to dashboard Cite

show abstract

Section: Related Workmentioning

confidence: 99%

Section: General Instancesmentioning

confidence: 99%

Section: General Instancesmentioning

confidence: 99%

See 1 more Smart Citation

Solving Sudoku With Ant Colony Optimization

Lloyd

Amos

2020

IEEE Trans. Games

View full text Add to dashboard Cite

show abstract

“…The Gurobi solver results are the recent results reported in [8]. The results of the CP-ILS approach was reported in [25]. The comparison shows that the proposed VNS-DP approach outperformed the ejection chain heuristic in 22 instances out of the 24 instances, produced the same result for the first instance, and failed to outperform it in the last instance only.…”

mentioning

confidence: 85%

A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem

Abdelghany¹,

Eltawil²,

Yahia³

et al. 2021

JIMO

View full text Add to dashboard Cite

Nurse Rostering is the activity of assigning nurses to daily shifts in order to satisfy the cover requirements, taking into account the operational requirements and nurses' preferences. The problem is usually modeled as sets of hard and soft constraints with an objective function to minimize violations of soft constraints. The nurse rostering problem is known to be NP-hard. Many metaheuristics were used to tackle this problem. One of the frequently used heuristics is the Variable Neighbourhood Search (VNS). The VNS is usually used as a standalone method or in integration with another exact or heuristic method. In this paper, a new hybrid VNS and Dynamic Programming based heuristic approach is proposed to handle the nurse rostering problem. In the proposed approach, two perturbation mechanisms are adopted simultaneously. The proposed approach is tested on two different benchmark data sets. A comparison with state-of-the-art methods from literature revealed the competitive performance of the proposed approach.2010 Mathematics Subject Classification. Primary: 90B35; Secondary: 90C59, 90C39.

show abstract

“…Sudoku is a popular reasoning game that has been around the world in recent years (Aaronson, 2006;Crook, 2007;Lynce & Ouaknine, 2006). From a scientific point of view, some experts treat sudoku as a part of the Constraint Satisfaction Problems category (Musliu & Winter, 2017;Simonis, 2005). Such problems are those that restrict individuals in terms of the values that are not given, but necessitate having a response within the given data.…”

Section: Sudokumentioning

confidence: 99%

Comparison of Sudoku Solving Skills of Preschool Children Enrolled in the Montessori Approach and the National Education Programs Yıldız Güven1, Cihat Gültekin1, A. Beyzanur Dedeoğlu1

Güven

Gültekin²,

Dedeoğlu³

2020

JETS

View full text Add to dashboard Cite

According to Johnson-Laird (2010), sudoku, a mind game, is based on a pure deduction and reasoning processes. This study analyzed sudoku solving skills of preschool children and to ascertain whether there was a difference between children who were educated according to the Ministry of Education preschool education program and the Montessori approach. Sudoku skills of children were analyzed by gender, age, duration of preschool attendance, mother’s and father’s education level and previous experience of playing sudoku using a 12-question Sudoku Skills Measurement Tool developed for this research study.The study sample of the study consisted of 118 children (57 girls, 61 boys) aged between 54-77 months. The findings showed that there was no significant difference in sudoku skills by gender. However, sudoku skills varied with age (54-65 months and 66-77 months) in favor of older groups. Children's sudoku skills were more developed with an increase in education level of either parent. Children who had been in preschool for longer had higher sudoku scores. A previous experience of playing sudoku did not impact sudoku scores. Sudoku skills of children who were educated according to the Montessori program were more developed compared to those of children educated according to Ministry of National Education program.

show abstract

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

Cited by 17 publications

References 9 publications

Solving Sudoku With Ant Colony Optimization

Solving Sudoku With Ant Colony Optimization

A hybrid variable neighbourhood search and dynamic programming approach for the nurse rostering problem

Comparison of Sudoku Solving Skills of Preschool Children Enrolled in the Montessori Approach and the National Education Programs Yıldız Güven1, Cihat Gültekin1, A. Beyzanur Dedeoğlu1

Contact Info

Product

Resources

About