Abstract

Differential evolution DE is a population-based random optimisation algorithm, which has been used to solve benchmark functions and real-world optimisation problems. The DE has three important operators: mutation, crossover, and selection. The mutation operator in the original DE can hardly balance the exploitation and exploration of the search. In this paper, we design a new mutation operator to improve the exploitation ability of DE. Experiments are carried out on 13 classical test functions. Simulation results show that the new mutation scheme can help DE to find better solutions than three other classical DE mutation strategies.

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.