Abstract

Differential evolution DE is an efficient population-based stochastic search algorithm, which has shown good search abilities on many real-world and benchmark optimisation problems. In this paper, we propose a new multi-population-based DE MDE algorithm. In MDE, the original population is divided into multiple subpopulations. For each subpopulation, two DE mutation schemes are alternatives to be conducted. Moreover, a Cauchy mutation operator is utilised to enhance the global search. To verify the performance of MDE, 12 well-known benchmark functions are used in the experiments. Simulation results show that MDE performs better than the standard DE and several other DE variants.

Full Text
Paper version not known

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

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.