A rapid chaos genetic algorithm

Authors:
Jian Gao;Ming Xiao;Wei Zhang
Affiliations:
School of Computer science and technology, Yantai University, P.R China;School of Computer science and technology, Yantai University, P.R China;School of Computer science and technology, Yantai University, P.R China
Venue:
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
Year:
2010

Citing 2
Cited 0

An orthogonal genetic algorithm with quantization for globalnumerical optimization

IEEE Transactions on Evolutionary Computation
A hybrid of genetic algorithm and particle swarm optimization for recurrent network design

IEEE Transactions on Systems, Man, and Cybernetics, Part B: Cybernetics

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.