• Complex
  • Title
  • Keyword
  • Abstract
  • Scholars
  • Journal
  • ISSN
  • Conference
搜索

Author:

Xie, Yingbo (Xie, Yingbo.) | Qiao, Junfei (Qiao, Junfei.) | Wang, Ding (Wang, Ding.) | Yin, Baocai (Yin, Baocai.)

Abstract:

In the last decade, the decomposition-based multiobjective optimization evolutionary algorithm (MOEA/D) has displayed promising performance when dealing with multiobjective optimization problems (MOPs). However, for some complex MOPs, the conventional MOEA/D often leads to the loss of population diversity in the iterative process, and the convergence performance of the population is weakened in the mean time. In this paper, a novel MOEA/D, based on improved multiple adaptive dynamic selection strategies and elite archive strategy (MOEA/D-IMA), is proposed to improve the population diversity and convergence. First, a novel differential evolution (DE) operator is constructed, which constitutes an operator pool with other DE operators. According to the search information of the current population, an adaptive dynamic selection strategy is proposed, which is used by MOEA/D-IMA to select a suitable DE operator to replace the simulated binary crossover (SBX) operator. Second, a parameter adaptive dynamic selection strategy is proposed to enhance the robustness of MOEA/D-IMA by using the information of population evolution state. Third, an elite archive strategy is introduced to improve the convergence and diversity of the population where mutual dominance of individuals and their aggregation distance is employed. Finally, the proposed MOEA/D-IMA is compared with several state-ofthe-art algorithms on three suits of 18 test problems. Experimental results indicate that the proposed MOEA/D-IMA can significantly improve the optimization performance when coping with MOPs. (C) 2020 Elsevier Inc. All rights reserved.

Keyword:

Multiobjective evolutionary algorithm based on decomposition Multiobjective optimization Differential evolution Adaptive dynamic selection Elite archive

Reprint Author's Address:

Email:

Show more details

Related Keywords:

Source :

Information Sciences: An International Journal

ISSN: 0020-0255

Year: 2021

Volume: 556

Page: 472-494

8 . 1 0 0

JCR@2022

ESI Discipline: COMPUTER SCIENCE;

ESI HC Threshold:87

JCR Journal Grade:1

Cited Count:

WoS CC Cited Count: 0

SCOPUS Cited Count:

ESI Highly Cited Papers on the List: 0 Unfold All

WanFang Cited Count: -1

Chinese Cited Count:

30 Days PV: 8

Affiliated Colleges:

Online/Total:545/10583119
Address:BJUT Library(100 Pingleyuan,Chaoyang District,Beijing 100124, China Post Code:100124) Contact Us:010-67392185
Copyright:BJUT Library Technical Support:Beijing Aegean Software Co., Ltd.