期刊
IEEE TRANSACTIONS ON CYBERNETICS
卷 50, 期 8, 页码 3696-3708出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TCYB.2019.2906383
关键词
Optimization; Clustering algorithms; Particle swarm optimization; Computer science; Sociology; Statistics; Trajectory; Competitive swarm optimizer (CSO); evolutionary multiobjective optimization; large-scale multiobjective optimization problem; particle swarm optimization (PSO)
类别
资金
- National Natural Science Foundation of China [61672033, 61822301, 61876123, U1804262]
- State Key Laboratory of Synthetical Automation for Process Industries [PAL-N201805]
- Anhui Provincial Natural Science Foundation [1808085J06, 1908085QF271]
There exist many multiobjective optimization problems (MOPs) containing a large number of decision variables in real-world applications, which are known as large-scale MOPs. Due to the ineffectiveness of existing operators in finding optimal solutions in a huge decision space, some decision variable division-based algorithms have been tailored for improving the search efficiency in solving large-scale MOPs. However, these algorithms will encounter difficulties when solving problems with complicated landscapes, as the decision variable division is likely to be inaccurate and time consuming. In this paper, we propose a competitive swarm optimizer (CSO)-based efficient search for solving large-scale MOPs. The proposed algorithm adopts a new particle updating strategy that suggests a two-stage strategy to update position, which can highly improve the search efficiency. The experimental results on large-scale benchmark MOPs and an application example demonstrate the superiority of the proposed algorithm over several state-of-the-art multiobjective evolutionary algorithms, including problem transformation-based algorithm, decision variable clustering-based algorithm, particle swarm optimization algorithm, and estimation of distribution algorithm.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据