Improved Multi-Objective Particle Swarm Optimization Algorithm With Adaptive Strategies

For solving multi-objective optimization problems, we propose a multi-objective particle swarm optimization algorithm based on Adaptive Strategies (ASMOPSO). The algorithm evaluates the diversity of the external population in each iteration, and adaptively chooses whether to perform mutation operati...

Full description

Saved in:
Bibliographic Details
Published in2021 6th International Conference on Computational Intelligence and Applications (ICCIA) pp. 59 - 63
Main Authors Cai, Xiaohong, Ma, Jingang, Sheng, Hui, Liu, Jing, Cao, Hui, Zhuang, Xuqiang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.06.2021
Subjects
Adaptation models
Convergence
multi-objective optimization algorithm
Multi-objective Optimization Problems
multi-objective particle swarm optimization
Optimization
Particle swarm optimization
Sociology
Sorting
Statistics
Online AccessGet full text

Cover

More Information
Summary:For solving multi-objective optimization problems, we propose a multi-objective particle swarm optimization algorithm based on Adaptive Strategies (ASMOPSO). The algorithm evaluates the diversity of the external population in each iteration, and adaptively chooses whether to perform mutation operations on the external population and choose different particle population update methods according to the evaluation value. The method cooperates with crowding distance and non-dominant sorting. In each round of iteration, different particles before and after sorting are changed to different scales to avoid the algorithm from falling into premature convergence and falling into the local optimum. It can be found through experimental simulation that the performance of the algorithm is better. Compared with evolutionary algorithm and general multi-objective particle swarm algorithm, it is greatly improved, and it shows better results on multiple test functions.
DOI:10.1109/ICCIA52886.2021.00019