摘要

Dynamic differential evolution (DDE) has been proposed to improve the performance of Differential evolution (DE) by dynamic updating of population. However, the convergence rate of DDE in optimizing a computationally expensive objective function still does not meet all our requirements. A new local search operation, greedy mutation operation, is proposed and embedded into DDE. The greedy mutation operation differs itself from the purely random mutation by considering fitness information. Modifications in mutation ensure that the fitness of base vector is superior to the average fitness of population, which leads to develop offspring that are more fit to survive than those generated from purely random operators. The modified DDE was tested against DE and DDE using five benchmark functions. The results show that the modified DDE converges faster without compromising solution quality.