4.7 Article

Large-scale multiobjective optimization with adaptive competitive swarm optimizer and inverse modeling

期刊

INFORMATION SCIENCES
卷 608, 期 -, 页码 1441-1463

出版社

ELSEVIER SCIENCE INC
DOI: 10.1016/j.ins.2022.07.018

关键词

Large-scale optimization; Inverse model; Nondominated solutions; Competitive swarm optimizer

资金

  1. National Natural Science Foundation of China [61976101, 62006091]
  2. plan for scientific research activities of academic and technical leaders and reserve candidates in Anhui Province [2021H264]
  3. top talent project of disciplines (majors) in Colleges and uni- versities in Anhui Province [gxbjzd2022087]
  4. Natural Science Foundation of Anhui Province, China [1808085MF174]
  5. graduate innovation fund of huaibei normal university [yx2021023]

向作者/读者索取更多资源

The competitive swarm optimizer (CSO) is an efficient algorithm for solving larger-scale multiobjective optimization problems (LSMOPs). In this study, an adaptive competitive swarm optimizer with inverse modeling is proposed to improve the performance of CSO. The winners are updated using inverse modeling and an adjacent individual competition method is introduced to enhance the distribution of solutions. Experimental results demonstrate that the proposed algorithm outperforms other compared algorithms on benchmark optimization problems.
Competitive swarm optimizer (CSO) is an efficient algorithm for solving larger-scale mul-tiobjective optimization problems (LSMOPs). However, the winners are not updated in original algorithm, and the random parameters model affects the convergence speed. To improve the performance of CSO for solving LSMOPs, an adaptive competitive swarm opti-mizer with inverse modeling is developed. In the method, an adaptive parameter model is designed to accelerate the convergence speed when the population not traps in local con-vergence, and the random parameter model is used to help the losers jump out of local con-vergence when the population traps in stagnation. Moreover, inverse modeling is used to update the winners, and the number of them is maintained by a new designed environ-ment selection method. The exploitation ability of algorithm is improved and the drawback that convergence speed of the algorithm might be slowed by few winners in the early stage of evolution is avoided. In addition, an adjacent individual competition method is proposed to improve the distribution of solutions. Finally, the proposed algorithm is tested on nine benchmark optimization problems, and the results indicate that the average ranks in terms of IGD and HV of the proposed algorithm outperform those of seven compared algorithms. (c) 2022 Elsevier Inc. All rights reserved.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.7
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据