基于遗忘策略的双群进化规划算法  

Forgetting Strategy Based Bi-Subgroup Evolutionary Programming Algorithm

作　　者：徐国顺[1] 李红江[1] 丁永忠[2] 范学鑫[1] 

机构地区：[1]海军工程大学电气工程系,武汉430033 [2]海军驻872厂军事代表室,西安710065

出　　处：《数据采集与处理》2005年第3期263-267,共5页Journal of Data Acquisition and Processing

摘　　要：在分析导致进化规划算法早熟原因的基础上,提出了一种基于遗忘策略的双群进化规划算法。在该算法中,进化在两个不同的子群间并行进行,其中一个子群使用遗忘策略不断淘汰和更新个体以实现在变量空间中足够分散的探索,另一个子群使用指数递减的高斯变异算子以实现在子群所在的局部尽可能细致搜索。通过种群重组实现子群间的个体与信息交流。基于典型算例的数字仿真证明该算法具有更好的全局收敛性,更快的收敛速度和更强的鲁棒性。Based on the analysis of the premature convergence of traditional evolutionary programming, a forgetting strategy based bi-subgroup evolutionary programming （FSBEP） algorithm is proposed. In this algorithm, the evolution of two subgroups is parallelly performed by different mutation strategies. One subgroup eliminates and updates individuals to explore the variable separately enough by the forgetting strategy, and another one searches the local part using the exponential degressive Gaussian mutation operator. Information, together with individual, is exchanged when the population is reorganized. Simulations based on benchmarks confirm that the FSBEP algorithm is better than classical evolutionary programming algorithm in the aspects of global optimization, the convergence speed and the robustness.

关 键 词：进化规划 双群 搜索 收敛 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]