Sudoku using parallel simulated annealing

Authors:
Zahra Karimi-Dehkordi;Kamran Zamanifar;Ahmad Baraani-Dastjerdi;Nasser Ghasem-Aghaee
Affiliations:
Department of Computer Engineering, University of Isfahan (UI), Isfahan, Iran;Department of Computer Engineering, University of Isfahan (UI), Isfahan, Iran;Department of Computer Engineering, University of Isfahan (UI), Isfahan, Iran;Department of Computer Engineering, University of Isfahan (UI), Isfahan, Iran
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part II
Year:
2010

Citing 3
Cited 0

Simulated annealing: theory and applications

Simulated annealing: theory and applications
Metaheuristics can solve sudoku puzzles

Journal of Heuristics
Parallelizing simulated annealing algorithms based on high-performance computer

Journal of Global Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

Parallel Simulated Annealing was applied to solving Sudoku puzzle. Simulated annealing is a stochastic search strategy which is best known for not getting trapped at the local optimums. Although SA suffers from low efficiency, it has been recognized as one of successful solutions in Sudoku. Sudoku puzzles in this study were formulated as an optimization problem in multi-agent environments. Variants of parallel SA could successfully solve this optimization problem. In this paper we implemented 3 different parallel SA in JADE and compared them. The results show that parallel search with periodic jumps gets better efficiency and success rate.