4.7 Article

A self -organizing weighted optimization based framework for large -scale multi-objective optimization

期刊

SWARM AND EVOLUTIONARY COMPUTATION
卷 72, 期 -, 页码 -

出版社

ELSEVIER
DOI: 10.1016/j.swevo.2022.101084

关键词

Large-scale optimization; Weighted optimization; Competitive swarm optimizer (CSO)

资金

  1. National Natural Science Foundation of China (NSFC) [61876110]
  2. NSFC [U1713212]
  3. Shenzhen Scientific Research and Development Funding Program [JCYJ20190808164211203]
  4. Pearl River Talent Recruitment Program ? [2019ZT08 ?, 603]
  5. Shenzhen Science and Technology Innovation Commission [R2020A045]
  6. CONACyT [2016-01-1920]
  7. Basque Government through the BERC [2022-2025]
  8. Spanish Ministry of Economy and Competitiveness MINECO: BCAM Severo Ochoa excellence accreditation [SEV-2017-0718]

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

This paper proposes a self-organizing weighted optimization based framework (S-WOF) for solving large-scale multi-objective optimization problems (LSMOPs). The S-WOF achieves a dynamic trade-off between convergence and diversity by adjusting the weights and evaluation numbers. In addition, an efficient competitive swarm optimizer (CSO) is implemented to improve the search ability. Experimental results demonstrate the superiority of S-WOF over several state-of-the-art large-scale evolutionary algorithms.
The solving of large-scale multi-objective optimization problem (LSMOP) has become a hot research topic in evolutionary computation. To better solve this problem, this paper proposes a self-organizing weighted optimization based framework, denoted S-WOF, for addressing LSMOPs. Compared to the original framework, there are two main improvements in our work. Firstly, S-WOF simplifies the evolutionary stage into one stage, in which the evaluating numbers of weighted based optimization and normal optimization approaches are adaptively adjusted based on the current evolutionary state. Specifically, regarding the evaluating number for weighted based optimization (i.e., t(1) ), it is larger when the population is in the exploitation state, which aims to accelerate the convergence speed, while t(1) is diminishing when the population is switching to the exploration state, in which more attentions are put on the diversity maintenance. On the other hand, regarding the evaluating number for original optimization (i.e., t(2) ), which shows an opposite trend to t(1) , it is small during the exploitation stage but gradually increases later. In this way, a dynamic trade-off between convergence and diversity is achieved in SWOF. Secondly, to further improve the search ability in the large-scale decision space, an efficient competitive swarm optimizer (CSO) is implemented in S-WOF, which shows efficiency for solving LSMOPs. Finally, the experimental results have validated the superiority of S-WOF over several state-of-the-art large-scale evolutionary algorithms.

作者

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

评论

主要评分

4.7
评分不足

次要评分

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

推荐

暂无数据
暂无数据