李庆华 杨世达 阮幼林. 基于水平集的遗传算法优化的改进[J]. 计算机研究与发展, 2006, 43(9): 1624-1629.
 引用本文: 李庆华 杨世达 阮幼林. 基于水平集的遗传算法优化的改进[J]. 计算机研究与发展, 2006, 43(9): 1624-1629.
Li Qinghua, Yang Shida, and Ruan Youlin. Improving Optimization for Genetic Algorithms Based on Level Set[J]. Journal of Computer Research and Development, 2006, 43(9): 1624-1629.
 Citation: Li Qinghua, Yang Shida, and Ruan Youlin. Improving Optimization for Genetic Algorithms Based on Level Set[J]. Journal of Computer Research and Development, 2006, 43(9): 1624-1629.

Improving Optimization for Genetic Algorithms Based on Level Set

• 摘要: 现有的遗传算法大多数没有给出收敛性准则，且存在早熟收敛和收敛速度较慢的难题，为此提出一类新型遗传算法.该算法首先从被优化函数的因变量出发，引入了水平集的新概念，对每一代种群进行分类，把与目标相关的所有信息有机地结合在一起，从而提高了算法的优化速度；其次通过对变异算子进行改进，提高了种群的多样性，有效地避免了遗传算法的早熟收敛；同时还证明了变异算子能提高种群多样性以及新算法能收敛于全局最优解，最后给出了算法的收敛准则.实验表明，该算法正确有效，搜索效率与精度均优于其他方法.

Abstract: Most genetic algorithms now available do not give a convergence rule, and there are difficult problems about premature and slow convergence. To solve these problems, a new kind of genetic algorithms is presented in this paper. Firstly, proceeding from dependent variables of optimized function, a new concept “level set” is introduced.This method can classify population of each generation and arrange all the aim relevant information effectively, so as to obtain the algorithm with high searching speed. Secondly, through the improvement of mutation operator, the diversity of population can be also improved, which avoids the premature convergence effectively. Meanwhile, the new mutation operator is also proved to be able to improve the diversity of population and the new algorithm can converge on the optimum solution. Finally a convergence rule of the algorithm is given. Computer simulations show that its convergence and search speed is faster and its efficiency is higher than other algorithms.

/

• 分享
• 用微信扫码二维码

分享至好友和朋友圈