Forgetting Strategy Based Bi-Subgroup Evolutionary Programming Algorithm
XU Guo-shun · Shuju caiji yu chuli · 2005
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.