Abstract
As a powerful evolutionary algorithm for solving the tough global optimization problems, differential evolution (DE) has drawn more and more attention. However, how to make a proper balance between the global and local search is a perplexing question and greatly limit the optimization performance of DE. As we all known, there are two classical mutation strategies in DE, i.e., DE/rand/1 and DE/best/1. In DE/rand/1 strategy, the base vector is chosen from the population randomly, this means its better exploration and poor exploitation. The base vector of DE/best/1 strategy is the best one of the population and the strategy has better exploitation and poor exploration. To overcome these problems, this paper proposed a random neighbor based mutation strategy (DE/neighbor/1). For each individual of the population at each generation, the neighbors are chosen from the population in a random manner. The base vector of DE/neighbor/1 mutation strategy is the best one in the neighbors. On the basis of the new strategy, an enhancing differential evolution with DE/neighbor/1 (RNDE) is proposed. The experimental studies have been tested on 27 widely used benchmark functions and the results have proved that the proposed algorithm is competitive and promising.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.