A Multi-Subgroup Competition Evolutionary Programming Algorithm
Min Zhang · Dianzi xuebao · 2004
Premature convergence is the fatal shortcoming of traditional evolutionary programming.Based on the analysis of premature convergence of traditional evolutionary programming,a novel Multi-subgroup Competition Evolutionary Programming (MCEP) algorithm is proposed.In the algorithm,evolutions of subgroups are parallely performed with the different mutation strategies.The mutation capability of an individual is determined by the competition among subgroups.The individual,together with information,is exchanged while subgroup is reorganized.The simulations based on benchmarks confirm that this algorithm is better than classical evolutionary programming algorithm in the aspects of global optimization,convergence speed and the robustness.