Abstract

Multimodal multi-objective optimization problems (MMOPs) are commonly seen in real-world applications and have attracted a growing attention in recent years. In this paper, a decomposition-based evolutionary algorithm using an estimation strategy is presented to handle MMOPs. In the proposed algorithm, multiple individuals who are assigned to the same weight vector form a subpopulation. Then, the estimation strategy is designed for estimating the amount of Pareto optimal sets (PSs), where the mean-shift algorithm is adopted to classify subpopulation into some clusters. In essence, the number of clusters is considered to be the estimated number of PSs. Finally, an environmental selection method, which combines the estimation strategy and the greedy selection, is adopted to dynamically adjust the subpopulation scale for maintaining the population diversity. The experimental results illustrate that the devised algorithm performs pass beyond the selected up-to-date competing algorithms.

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.