DocumentCode
2326213
Title
Solving n-Queen problem using global parallel genetic algorithm
Author
Bozikovic, Marko ; Golub, Marin ; Budin, Leo
Author_Institution
Fac. of Electr. Eng. & Comput., Zagreb Univ., Croatia
Volume
2
fYear
2003
fDate
22-24 Sept. 2003
Firstpage
104
Abstract
This paper shows a way in which genetic algorithms can be used to solve the n-Queen problem. Custom chromosome representation, evaluation function and genetic operators are presented. A global parallel genetic algorithm is also demonstrated as a possible way to increase GA speed. Results are shown for several large values of n and several conclusions are drawn about solving NP problems with genetic algorithms.
Keywords
combinatorial mathematics; computational complexity; genetic algorithms; parallel algorithms; chromosome representation; combinatorial problem; deterministic method; evaluation function; genetic algorithm speed; genetic operator; global parallel genetic algorithm; heuristic method; multiprocessor system; n-Queen problem; thread context switching; Biological cells; Concurrent computing; Counting circuits; Genetic algorithms; Genetic engineering; Polynomials;
fLanguage
English
Publisher
ieee
Conference_Titel
EUROCON 2003. Computer as a Tool. The IEEE Region 8
Print_ISBN
0-7803-7763-X
Type
conf
DOI
10.1109/EURCON.2003.1248159
Filename
1248159
Link To Document