Abstract

Multimodal optimization problems, which involve multiple global optima, are common in real-world applications. So far, plenty of multimodal evolutionary algorithms (MMEAs) have been proposed, where niching techniques are widely utilized to locate different optima by trying to cover each modality with an exclusive niche. However, most existing MMEAs deal with niches independently without considering their similarity and redundancy, which greatly limits the performance of the algorithms. Directing against this issue, this study proposes a multi-niche cooperation based MMEA, where a knowledge transfer strategy (KTS) and a collaborative search mechanism (CSM) are designed. Specifically, given the high similarity shared by different modalities, KTS cooperatively evolves the corresponding niches by transferring knowledge among them, thereby accelerating their convergence. For niches possibly covering the same modality, CSM explicitly measures the search intensity on the modality and adaptively deactivates redundant niches, so that excessive searches on the modality can be avoided. This study incorporates the above two strategies into a classic MMEA named NEA2, and thus leads to a multi-niche cooperation based NEA (MNC-NEA). Experiments conducted on 20 benchmark functions demonstrate that KTS and CSM are efficient and complementary, and they together endow MNC-NEA with a significant competitive advantage over 11 state-of-the-art MMEAs.

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.