Abstract
Differential evolution (DE) algorithm is very simpe, robust but efficient. However, the convergence speed and solution accuracy of DE algorithm significantly lower when solving high-dimension(more than 100) optimization problems. for this problem, A novel local search operation was proposed. This local operation combines both advantage of orthogonal crossover and opposition-based learning strategy. In the new algorithm, only one random individual was chose to undergo the local search operation. The purpose of this operation is to improve the local search ability, at the same time without adding too much computing resources. The simulation experiments on 9 benchmark functions show that the new algorithm improved optimization ability for high-dimensional problem. Compared with DE and OXDE, the result show that the proposed algorithm is an efficient method for the high-dimensional optimization problem.
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.
