A multi-objective particle swarm algorithm based on hierarchical clustering reference point maintenance

一种基于层次聚类参考点维护的多目标粒子群算法

阅读:1

Abstract

In multi-objective particle swarm optimization (MOPSO), challenges persist, including low diversity in external archives, ambiguous individual optimal choice mechanisms, high sensitivity to parameter settings, and the arduous task of balancing global exploration and local exploitation capabilities. To address these issues, this paper introduces a novel multi-objective particle swarm optimization algorithm named HCRMOPSO. The proposed algorithm innovatively leverages hierarchical clustering based on Ward's linkage to generate the center of mass as reference points, which are then combined with the ideal point and crowding distance. This effectively maintains the external archive, thereby resolving the diversity deficiency commonly found in traditional MOPSO archives. Additionally, HCRMOPSO fuses multiple particles to update the personal best positions. It also adaptively tunes the flight parameters according to the diversity information within each particle's neighborhood, enhancing the algorithm's adaptability. Notably, a new strategy is designed for two specific types of particles, further optimizing the search process. The performance of HCRMOPSO is rigorously evaluated against ten existing algorithms on 22 standard test problems. Experimental results demonstrate that HCRMOPSO outperforms its counterparts on multiple benchmarks, showcasing superior effectiveness in handling multi-objective optimization tasks.

特别声明

1、本页面内容包含部分的内容是基于公开信息的合理引用;引用内容仅为补充信息,不代表本站立场。

2、若认为本页面引用内容涉及侵权,请及时与本站联系,我们将第一时间处理。

3、其他媒体/个人如需使用本页面原创内容,需注明“来源:[生知库]”并获得授权;使用引用内容的,需自行联系原作者获得许可。

4、投稿及合作请联系:info@biocloudy.com。