Abstract

Multimodal optimization problems (MMOPs) aim to simultaneously locate as many global optima as possible with high accuracy. Recently, many niching strategies have been wildly used in evolutionary algorithms to solve MMOPs due to the advantage of maintaining the diversity of population. However, most multimodal algorithms are sensitive to the niching parameters and lack effective methods to update the “stagnant individuals”, including individuals that have trapped into local optima or converged to the same optima. In this paper, a minimum spanning tree niching-based differential evolution (TNDE) with knowledge-driven update (KDU) strategy is proposed to better solve the above challenges, where the “knowledge” includes historical evolutionary information, fitness distribution information, and individual distribution information. In TNDE, a minimum spanning tree niching (MSTN) strategy is proposed to adaptively divide the population, which can adjust the number of niches dynamically. Besides, the KDU strategy is proposed to utilize the knowledge to locate and update stagnant individuals. Lastly, an improved differential evolution with local stage-based mutation (LSM) and directional guidance selection (DGS) strategies is proposed to accelerate convergence and refine the accuracy of solutions, respectively. The comparison results with 16 state-of-the-art algorithms on CEC’2013 show that TNDE achieves significant advantages on high-dimensional problems or problems with many global optima.

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.