Multi-subgroup Evolutionary Programming
Dou Ji · Shuju caiji yu chuli · 2004
An improved multi-subgroup evolutionary programming(MEP) algorithm is proposed based on the analysis of traditional evolutionary programming premature convergence. In MEP algorithm, evolutions of many subgroups are parallelly performed with different mutation strategies, and then the population can separately explore the solution space and detailedly search the local part all together. Information is exchanged when subgroups are reorganized. Simulations based on benchmarks confirm that MEP algorithm is better than classic evolutionary programming algorithm in the aspects of global optimization, convergence speed and the robustness.