粒子群优化
计算机科学
聚类分析
多群优化
多目标优化
数学优化
惯性
期限(时间)
算法
人工智能
数学
机器学习
量子力学
经典力学
物理
作者
Yang Yang,Qianfeng Liao,Jiang Wang,Yuan Wang
标识
DOI:10.1016/j.engappai.2022.104866
摘要
To solve the multi-modal multi-objective optimization problems in which the same Pareto Front (PF) may correspond to multiple different Pareto Optimal Sets (PSs), an improved multi-objective particle swarm optimizer with short-term memory and K-means clustering (MOPSO-SMK) is proposed in this paper. According to the framework of multi-objective particle swarm optimization (MOPSO) algorithm, the designs of updating mechanism and population maintenance mechanism are the keys to obtain the optimal solutions. As a significant influence factor of the updating mechanism, the inertia weight has been discussed in this paper. In the improved algorithm, a new update model for the value of pbest based on short-term memory is proposed. The update strategies based on K-means clustering are adopted to obtain the better gbest and elite archive. 16 multi-modal multi-objective optimization functions are used to verify the feasibility and effectiveness of the proposed MOPSO-SMK. As the results show, MOPSO-SMK has more advantages in four indexes (1/PSP, 1/HV, IGDX, and IGDF) compared with other three multi-objective optimization algorithms.
科研通智能强力驱动
Strongly Powered by AbleSci AI