Title :
A Novel Assembly Evolutionary Algorithm for n-Queens Problem
Author :
Zeng, Congwen ; Gu, Tianlong
Author_Institution :
Guilin Univ. of Electron. Technol., Guilin
Abstract :
Individuals in nowadays evolutionary algorithms for n-queens problem do not satisfy some basic constraint conditions. Motivated by self-assembly computing, a novel assembly evolutionary algorithm for n-queens problem is presented. Each individual is made up of assembly-parts, assembly-seeds and status information. Some important notions and rules regarding the novel assembly evolutionary algorithm are discussed. Experimental results show that the algorithm finds a solution faster than other latest evolutionary algorithms.
Keywords :
evolutionary computation; search problems; assembly evolutionary algorithm; assembly-parts; assembly-seeds; n-queens problem; search algorithm; self-assembly computing; Assembly; Biology computing; Computational intelligence; Computer science; Computer security; Evolutionary computation; Genetics; Optimization methods; Self-assembly; System recovery;
Conference_Titel :
Computational Intelligence and Security Workshops, 2007. CISW 2007. International Conference on
Conference_Location :
Heilongjiang
Print_ISBN :
978-0-7695-3073-4
DOI :
10.1109/CISW.2007.4425472
