Abstract
In this paper, we extend the dynamicity of differential evolution (DE) proposed for DE/rand/1/bin and DE/best/1/bin to five more variants DE/rand/2, DE/best/2, DE/current-to-rand/1, DE/current-to-best/1 and DE/rand-to-best/1. We present an empirical, comparative performance, analysis of 14 variants of DE and dynamic differential evolution (DDE) algorithms (7 variants with two crossovers – binomial and exponential) to solve unconstrained global optimization problems. The aim of this paper is to identify competitive DE and DDE variants which perform well on different problems, and to compare the performance of DDE variants with DE variants. The performance of 14 variants of DE and DDE are analyzed by implementing them on 14 test functions. The analysis (done based on mean objective function value, probability of convergence and success performance) shows the superiority of DDE variants and identifies the competitive DE and DDE variants.
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 callMore From: International Journal of Computers and Applications
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
