TY - JOUR
T1 - Intelligent bionic genetic algorithm (IB-GA) and its convergence
AU - Li, Fachao
AU - Xu, Li Da
AU - Jin, Chenxia
AU - Wang, Hong
PY - 2011/7/1
Y1 - 2011/7/1
N2 - As a new kind of intelligence optimization method, genetic algorithms, with the features of simple structure and strong adaptability, achieves great success in many real applications. However, it has many shortcomings such as a greater computation complexity and more chance of being trapped in local states. In this paper, through analyzing the deficiency of the existing genetic operation and the essential characteristics of creature evolution from the angle of improving evolution efficiency, we propose a compound mutation strategy based on mutation criteria function, a multi-reserved strategy based on intelligence evolution, and a weak arithmetic crossover strategy reflecting different evolution modes. Furthermore, we establish an intelligent bionic genetic algorithm with structural features (denoted by IB-GA, for short). Finally, we analyze the performances of IB-GA with the theory of Markov chains and simulation technology. The results indicate that IB-GA is essentially an extension of ordinary GA and obviously better than ordinary GA in terms of computation efficiency and convergence performance. © 2011 Elsevier Ltd. All rights reserved.
AB - As a new kind of intelligence optimization method, genetic algorithms, with the features of simple structure and strong adaptability, achieves great success in many real applications. However, it has many shortcomings such as a greater computation complexity and more chance of being trapped in local states. In this paper, through analyzing the deficiency of the existing genetic operation and the essential characteristics of creature evolution from the angle of improving evolution efficiency, we propose a compound mutation strategy based on mutation criteria function, a multi-reserved strategy based on intelligence evolution, and a weak arithmetic crossover strategy reflecting different evolution modes. Furthermore, we establish an intelligent bionic genetic algorithm with structural features (denoted by IB-GA, for short). Finally, we analyze the performances of IB-GA with the theory of Markov chains and simulation technology. The results indicate that IB-GA is essentially an extension of ordinary GA and obviously better than ordinary GA in terms of computation efficiency and convergence performance. © 2011 Elsevier Ltd. All rights reserved.
KW - Compound mutation strategy
KW - Genetic algorithm
KW - Markov chain
KW - Multi-reserved strategy
KW - Real coding
KW - Weak arithmetic crossover
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=79952444123&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=79952444123&origin=inward
U2 - 10.1016/j.eswa.2011.01.091
DO - 10.1016/j.eswa.2011.01.091
M3 - Article
SN - 0957-4174
VL - 38
SP - 8804
EP - 8811
JO - Expert Systems with Applications
JF - Expert Systems with Applications
IS - 7
ER -