Abstract
For several years the Differential Evolution (DE) algorithm has been an effective method for solving complex real-world optimization problems. However, when it comes to solving large-scale problems its performance deteriorates. In this paper, we propose five different dynamic center-based DE mutation schemes (DCDE) to solve large-scale optimization problems. In each generation, the proposed dynamic centerbased mutation strategies linearly divide the population into two different groups. Then, the first sub-population group utilizes center-based mutation scheme and the second sub-population employs the classical DE mutation. The proposed dynamic schemes are benchmarked on CEC 2013 large-scale optimization problems. The experimental results show that the overall performance of the proposed dynamic center-based mutation schemes better than the compared algorithms in solving LSGO 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.
