Development and analysis of genetic algorithms: Sudoku case study
Abstract
This paper discusses the design and subsequent analysis of software implementing a configurable genetic algorithm. The genetic algorithm is primarily targeted towards the solving of Sudoku puzzles. Sudoku is regarded as an ideal test-bed for algorithm development due to the fact that it is a constrained optimisation problem that belongs to the NP-complete class of computational problems. The aim of this paper is to outline the various features currently implemented in the software, and to present preliminary results of an analysis of various aspects of the underlying genetic algorithm.
Citation
Source Title
ISBN
Remarks
Copyright © 2012 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
Collection
Related items
Showing items related by title, author, creator and subject.
-
Venville, Grady J. (1997)A journey into the past century of genetics history reveals transformations of the concept of the gene through notions of discrete units that obeyed Mendelian laws to the modem bewildering gene concept. We can no longer ...
-
Kazem, A.; Sharifi, E.; Hussain, Farookh Khadeer; Saberi, Morteza; Hussain, Omar (2012)Due to the inherent non-linearity and non-stationary characteristics of financial stock market price time series, conventional modeling techniques such as the Box–Jenkins autoregressive integrated moving average (ARIMA) ...
-
Nabavi, S.; Masoum, Mohammad Sherkat; Kazemi, A. (2011)This article presents a fuzzy-based genetic algorithm to maximize total social welfare and alleviate congestion by placement and sizing of one static synchronous series compensator device, considering its investment cost ...