Genetic algorithm is an evolutionary algorithm. It is particularly suitable for solving NP-complete optimization problems. In this paper, we propose a rapid genetic algorithm based on chaos mechanism. We introduce the chaos mechanism into the genetic algorithm. Using the ergodic property of the chaos movement, this method can remedy the defect of premature convergence in the genetic algorithm. In the search, this method continuously compresses the searching intervals of the optimization variable for increasing convergence speed. Experiments indicate that this method is a rapid and effective evolutionary algorithm. © 2010 Springer-Verlag.
CITATION STYLE
Gao, J., Xiao, M., & Zhang, W. (2010). A rapid chaos genetic algorithm. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6145 LNCS, pp. 425–431). https://doi.org/10.1007/978-3-642-13495-1_52
Mendeley helps you to discover research relevant for your work.