Abstract

Differential Evolution (DE) is a highly competitive and powerful real parameter optimizer in the diverse community of evolutionary algorithms. The performance of DE depends largely upon its control parameters and is quite sensitive to their appropriate settings. One of those parameters commonly known as scale factor or F, controls the step size of the vector differentials during the search. During the exploration stage of the search, large step sizes may prove more conducive while during the exploitation stage, smaller step sizes might become favorable. This work proposes a simple and effective technique that alters F in stages, first through random perturbations and then through the application of an annealing schedule. We report the performance of the new variant on 20 benchmark functions of varying complexity and compare it with the classic DE algorithm (DE/Rand/1/bin), two other scale factor altering variants, and state of the art, SaDE.

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.