TY - GEN
T1 - An Improved Competitive Swarm Optimizer Based on Generalized Pareto Dominance for Large-scale Multi-objective and Many-objective Problems
AU - Cui, Meiji
AU - Li, Li
AU - Zhu, Shuwei
AU - Zhou, Mengchu
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - Large-scale multi-objective and many-objective problems are widely existing in the real-world. These problems are extremely challenging to deal with as a result of exponentially expanded search space as well as complicated conflicting objectives. Most existing algorithms focus either on large-scale decision variables or multiple objectives solely while few algorithms consider both of them. In this paper, we propose an improved competitive swarm optimization (ICSO) dedicated to deal with large-scale search space. Moreover, we incorporate ICSO into the MultiGPO framework, an efficient framework for many-objective problems, and name it as MultiGPO_ICSO. To validate the performance of MultiGPO_ICSO, we test all algorithms on LSMOP with dimensions varying from 100 to 500. Compared with other algorithms, MultiGPO_ICSO shows competitive performance on most problems with limited computational resources. Therefore, MultiGPO_ICSO is suitable to deal with large-scale multi-objective and many-objective problems.
AB - Large-scale multi-objective and many-objective problems are widely existing in the real-world. These problems are extremely challenging to deal with as a result of exponentially expanded search space as well as complicated conflicting objectives. Most existing algorithms focus either on large-scale decision variables or multiple objectives solely while few algorithms consider both of them. In this paper, we propose an improved competitive swarm optimization (ICSO) dedicated to deal with large-scale search space. Moreover, we incorporate ICSO into the MultiGPO framework, an efficient framework for many-objective problems, and name it as MultiGPO_ICSO. To validate the performance of MultiGPO_ICSO, we test all algorithms on LSMOP with dimensions varying from 100 to 500. Compared with other algorithms, MultiGPO_ICSO shows competitive performance on most problems with limited computational resources. Therefore, MultiGPO_ICSO is suitable to deal with large-scale multi-objective and many-objective problems.
KW - Large-scale optimization
KW - Pareto Dominance
KW - competitive swarm optimization
KW - many-objective optimization
KW - multi-objective optimization
UR - http://www.scopus.com/inward/record.url?scp=85126682410&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85126682410&partnerID=8YFLogxK
U2 - 10.1109/ICNSC52481.2021.9702169
DO - 10.1109/ICNSC52481.2021.9702169
M3 - Conference contribution
AN - SCOPUS:85126682410
T3 - ICNSC 2021 - 18th IEEE International Conference on Networking, Sensing and Control: Industry 4.0 and AI
BT - ICNSC 2021 - 18th IEEE International Conference on Networking, Sensing and Control
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 18th IEEE International Conference on Networking, Sensing and Control, ICNSC 2021
Y2 - 3 December 2021 through 5 December 2021
ER -