Details
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | Information Science and Applications 2018 |
| Untertitel | ICISA 2018 |
| Herausgeber/-innen | Kuinam J. Kim, Nakhoon Baek |
| Herausgeber (Verlag) | Springer Singapore |
| Seiten | 369-375 |
| Seitenumfang | 7 |
| Auflage | 1. |
| ISBN (elektronisch) | 978-981-13-1056-0 |
| ISBN (Print) | 978-981-13-4557-9, 978-981-13-1055-3 |
| Publikationsstatus | Veröffentlicht - 24 Juli 2019 |
| Veranstaltung | International Conference on Information Science and Applications, ICISA 2018 - Kowloon, Hongkong Dauer: 25 Juni 2018 → 27 Juni 2018 |
Publikationsreihe
| Name | Lecture Notes in Electrical Engineering |
|---|---|
| Band | 514 |
| ISSN (Print) | 1876-1100 |
| ISSN (elektronisch) | 1876-1119 |
Abstract
In this work we improve previous approaches based on genetic algorithms (GA) to solve sudoku puzzles. Those approaches use random swap mutations and filtered mutations, where both operations result in relatively slow convergence, the latter suffering a bit less. We suggest to improve GA based approaches by an intermediate local optimization step of the population. Compared to the previous approaches our approach is superior in terms of convergence rate, success rate and speed. As consequence we find the optimum with one population member and within one generation in a few milliseconds instead of nearly one minute.
ASJC Scopus Sachgebiete
- Ingenieurwesen (insg.)
- Wirtschaftsingenieurwesen und Fertigungstechnik
Zitieren
- Standard
- Harvard
- Apa
- Vancouver
- BibTex
- RIS
Information Science and Applications 2018: ICISA 2018. Hrsg. / Kuinam J. Kim; Nakhoon Baek. 1. Aufl. Springer Singapore, 2019. S. 369-375 (Lecture Notes in Electrical Engineering; Band 514).
Publikation: Beitrag in Buch/Bericht/Sammelwerk/Konferenzband › Aufsatz in Konferenzband › Forschung › Peer-Review
}
TY - GEN
T1 - Improving an evolutionary approach to Sudoku Puzzles by intermediate optimization of the population
AU - Becker, Matthias
AU - Balci, Sinan
PY - 2019/7/24
Y1 - 2019/7/24
N2 - In this work we improve previous approaches based on genetic algorithms (GA) to solve sudoku puzzles. Those approaches use random swap mutations and filtered mutations, where both operations result in relatively slow convergence, the latter suffering a bit less. We suggest to improve GA based approaches by an intermediate local optimization step of the population. Compared to the previous approaches our approach is superior in terms of convergence rate, success rate and speed. As consequence we find the optimum with one population member and within one generation in a few milliseconds instead of nearly one minute.
AB - In this work we improve previous approaches based on genetic algorithms (GA) to solve sudoku puzzles. Those approaches use random swap mutations and filtered mutations, where both operations result in relatively slow convergence, the latter suffering a bit less. We suggest to improve GA based approaches by an intermediate local optimization step of the population. Compared to the previous approaches our approach is superior in terms of convergence rate, success rate and speed. As consequence we find the optimum with one population member and within one generation in a few milliseconds instead of nearly one minute.
KW - Criticism
KW - Genetic algorithms
KW - Sudoku
UR - http://www.scopus.com/inward/record.url?scp=85051077190&partnerID=8YFLogxK
U2 - 10.1007/978-981-13-1056-0_38
DO - 10.1007/978-981-13-1056-0_38
M3 - Conference contribution
AN - SCOPUS:85051077190
SN - 978-981-13-4557-9
SN - 978-981-13-1055-3
T3 - Lecture Notes in Electrical Engineering
SP - 369
EP - 375
BT - Information Science and Applications 2018
A2 - Kim, Kuinam J.
A2 - Baek, Nakhoon
PB - Springer Singapore
T2 - International Conference on Information Science and Applications, ICISA 2018
Y2 - 25 June 2018 through 27 June 2018
ER -