Research of Hybrid Genetic Algorithm in N-Queen Problem Based on HCI

Author

Meng, Fanlin ; Wu, Shunxiang

Author_Institution

Dept. of Autom., Xiamen Univ., Xiamen

Volume

2

fYear

2008

fDate

20-22 Dec. 2008

Firstpage

3

Lastpage

7

Abstract

N-Queen problem is a typical combination optimization problem and it belongs among NP-hard problems. Its common solution is recursive algorithm. When the problem is complex, it will cost much more time for solution. Compared with the recursive algorithm, genetic algorithm can be component for the complex situation. In view of this, a hybrid genetic algorithm was presented in this paper to solve the problem. Besides, a Human Computer Interaction platform based on hybrid genetic algorithm was designed here to improve the efficiency of research. Resolution of N-Queen problem was conducted on this HCI platform. The simulation and analysis of the experiment results showed us the good performance of hybrid genetic algorithm and proved the validness and convenience of the HCI platform.

Keywords

combinatorial mathematics; computational complexity; genetic algorithms; human computer interaction; mathematics computing; N-Queen problem; NP-hard problem; combination optimization problem; human computer interaction; hybrid genetic algorithm; recursive algorithm; Algorithm design and analysis; Analytical models; Automation; Biological cells; Computational modeling; Costs; Genetic algorithms; Human computer interaction; Information technology; NP-hard problem; HCI platform; Hybrid genetic algorithm; N-Queen problem;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Information Technology Application, 2008. IITA '08. Second International Symposium on

Conference_Location

Shanghai

Print_ISBN

978-0-7695-3497-8

Type

conf

DOI

10.1109/IITA.2008.137

Filename

4739715