Abstract
Differential evolution (DE) is a simple yet pow- erful evolutionary algorithm for global numerical opti- mization. In this paper, we propose a novel hybrid DE variant to accelerate the convergence rate of the classical DE algorithm. The proposed algorithm is hybridized with a convex mutation. The convex mutation is able to utilize the information of the parents, and hence, provides faster convergence speed. Our proposal is referred to as Convex- DE. In order to verify our expectation, we test our approach on 13 widely used benchmark functions. The results indicate that our approach is better than the classical DE algorithm in terms of the convergence speed and the quality of final solution. Furthermore, the potential of our approach for real-world applications is evaluated on three real-world problems.
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 callDisclaimer: 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.
