Abstract
An adaptive genetic algorithm with diversity-guided mutation, which combines adaptive probabilities of crossover and mutation was proposed. By means of homogeneous finite Markov chains, it is proved that adaptive genetic algorithm with diversity-guided mutation and genetic algorithm with diversity-guided mutation converge to the global optimum if they maintain the best solutions, and the convergence of adaptive genetic algorithms with adaptive probabilities of crossover and mutation was studied. The performances of the above algorithms in optimizing several unimodal and multimodal functions were compared. The results show that for multimodal functions the average convergence generation of the adaptive genetic algorithm with diversity-guided mutation is about 900 less than that of adaptive genetic algorithm with adaptive probabilities and genetic algorithm with diversity-guided mutation, and the adaptive genetic algorithm with diversity-guided mutation does not lead to premature convergence. It is also shown that the better balance between overcoming premature convergence and quickening convergence speed can be gotten.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Srinivas M, Patnai L M. Adaptive probabilities of crossover and mutation in genetic algorithms [J]. IEEE Trans Syst, Man, and Cybern, 1994, 24(4): 656–666.
ZONG Jing-qun. A kind of mixture adaptive genetic algorithm and analysis of property [J]. Systems Engineering: Theory & Practice, 2001 21 (4): 14–18 (in Chinese).
ZHOU Ming, SUN Shu-dong. Genetic Algorithms: Theory and Applications [M]. Beijing: National Defence Industry Press, 1999. (in Chinese).
Rudolph G. Self-adaptive mutations may lead to premature convergence [J]. IEEE Transactions on Evolutionary Computation, 1998, 5(4): 410–414.
Burke E, Gustafson S, Kendall G. A survey and analysis of diversity measures in genetic programming [A]. The Genetic and Evolutionary Computation Conference 2002 [C]. New York, 2001.
Burke E, Gustafson S, Kendall G, et al. Advanced population diversity measures in genetic programming [A]. The Parallel Problem Solving from Nature Conference, 7th International Conference [C]. Granada, 2002.
Shimodaira H. A diversity control oriented genetic algorithm (DCGA): development and experimental results [A]. The Genetic and Evolutionary Computation Conference [C]. Florida, 1999.
Bosman P A N, Thierens D. The balance between proximity and diversity in multi-objective evolutionary algorithms [J]. IEEE Transactions on Evolutionary Computation, 2003, 7(2): 174–188.
Iosifescu M. Finite Markov Processes and their Applications [M]. Chichester: Wiley, 1980.
Rudolph G. Convergence properties of canonical genetic algorithms [J]. IEEE Transactions on Neural Networks, 1994, 5(1): 96–101.
HE Lin, WANG Ke-jun, LI Guo-bin, et al. The discussion about the paper “the analysis of global convergence and computational efficiency for genetic algorithm” [J]. Control Theory and Applications, 2001, 18(1): 141–144. (in Chinese)
Author information
Authors and Affiliations
Corresponding author
Additional information
Foundation item: Project (60234030) supported by the National Natural Science Foundation of China
Rights and permissions
About this article
Cite this article
Li, My., Cai, Zx. & Sun, Gy. An adaptive genetic algorithm with diversity-guided mutation and its global convergence property. J Cent. South Univ. Technol. 11, 323–327 (2004). https://doi.org/10.1007/s11771-004-0066-6
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/s11771-004-0066-6