Abstract
AbstractIn the present work we propose a modified variant of Differential Evolution (DE) algorithm named MDE. MDE differs from the basic DE in the manner in which the base vector is generated. While in simple/basic DE, base vector is usually randomly selected from the population of individuals, in MDE base vector is generated as convex linear combination (clc) of three randomly selected vectors out of which one is the one having best fitness value. This mutation scheme is used stochastically with mutation scheme in which the base generated using a clc of three randomly generated vectors. MDE is validated on a set of benchmark problems and is compared with basic DE and other DE variants. Numerical and statistical analysis shows the competence of proposed MDE.Keywordsdifferential evolutionmutation strategyglobal optimization
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
