Abstract

This paper presents a niching-based evolutionary algorithm for optimizing multi-modal optimization function. Provided that the potential optima are characterized by a relatively smaller objective value than their neighbors and by a relatively large distance from points with smaller objective values, we identify potential optima from individuals. Using them as seeds, a population is decomposed into a number of subpopulations without introducing new parameters. Moreover, we present an adaptive allocating strategy of assigning different computational resources to different subpopulations upon the fact that discovering different optima may have different computational difficulty. The proposed method is compared with three state-of-the-art multi-modal optimization approaches on a benchmark function set. The extensive experimental results demonstrate its efficacy.

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.