水准点(测量)
数学优化
粒子群优化
计算机科学
比例(比率)
聚类分析
变量(数学)
可变邻域搜索
进化算法
群体行为
转化(遗传学)
元启发式
算法
数学
人工智能
物理
数学分析
量子力学
基因
化学
大地测量学
地理
生物化学
作者
Ye Tian,Xiutao Zheng,Xingyi Zhang,Yaochu Jin
出处
期刊:IEEE transactions on cybernetics
[Institute of Electrical and Electronics Engineers]
日期:2020-08-01
卷期号:50 (8): 3696-3708
被引量:272
标识
DOI:10.1109/tcyb.2019.2906383
摘要
There exist many multi-objective 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 twostage strategy to update position, which can highly improve the search efficiency.Experimental results on large-scale benchmark MOPs and an application example demonstrate the superiority of the proposed algorithm over several stateof-the-art multi-objective evolutionary algorithms, including problem transformation based algorithm, decision variable clustering based algorithm, particle swarm optimization algorithm, and estimation of distribution algorithm.
科研通智能强力驱动
Strongly Powered by AbleSci AI