A dual-population paradigm for evolutionary multiobjective optimization

被引:44
作者
Li, Ke [1 ,2 ]
Kwong, Sam [1 ]
Deb, Kalyanmoy [2 ]
机构
[1] City Univ Hong Kong, Dept Comp Sci, Kowloon, Hong Kong, Peoples R China
[2] Michigan State Univ, Dept Elect & Comp Engn, E Lansing, MI 48824 USA
关键词
Dual-population paradigm; Pareto dominance; Decomposition; Evolutionary computation; Multiobjective optimization; MANY-OBJECTIVE OPTIMIZATION; ALGORITHM; DIVERSITY; SELECTION; MOEA/D; DECOMPOSITION; PERFORMANCE; PROXIMITY; NETWORK; BALANCE;
D O I
10.1016/j.ins.2015.03.002
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Convergence and diversity are two basic issues in evolutionary multiobjective optimization (EMO). However, it is far from trivial to address them simultaneously, especially when tackling problems with complicated Pareto-optimal sets. This paper presents a dual-population paradigm (DPP) that uses two separate and co-evolving populations to deal with convergence and diversity simultaneously. These two populations are respectively maintained by Pareto- and decomposition-based techniques, which arguably have complementary effects in selection. In particular, the so called Pareto-based archive is assumed to maintain a population with competitive selection pressure towards the Pareto-optimal front, while the so called decomposition-based archive is assumed to preserve a population with satisfied diversity in the objective space. In addition, we develop a restricted mating selection mechanism to coordinate the interaction between these two populations. DPP paves an avenue to integrate Pareto- and decomposition-based techniques in a single paradigm. A series of comprehensive experiments is conducted on seventeen benchmark problems with distinct characteristics and complicated Pareto-optimal sets. Empirical results fully demonstrate the effectiveness and competitiveness of the proposed algorithm. (C) 2015 Elsevier Inc. All rights reserved.
引用
收藏
页码:50 / 72
页数:23
相关论文
共 44 条
  • [21] Hughes EJ, 2005, IEEE C EVOL COMPUTAT, P222
  • [22] Evolutionary Many-Objective Optimization by NSGA-II and MOEA/D with Large Populations
    Ishibuchi, Hisao
    Sakane, Yuji
    Tsukamoto, Noritaka
    Nojima, Yusuke
    [J]. 2009 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN AND CYBERNETICS (SMC 2009), VOLS 1-9, 2009, : 1758 - 1763
  • [23] Combining convergence and diversity in evolutionary multiobjective optimization
    Laumanns, M
    Thiele, L
    Deb, K
    Zitzler, E
    [J]. EVOLUTIONARY COMPUTATION, 2002, 10 (03) : 263 - 282
  • [24] Multiobjective Optimization Problems With Complicated Pareto Sets, MOEA/D and NSGA-II
    Li, Hui
    Zhang, Qingfu
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2009, 13 (02) : 284 - 302
  • [25] Stable Matching-Based Selection in Evolutionary Multiobjective Optimization
    Li, Ke
    Zhang, Qingfu
    Kwong, Sam
    Li, Miqing
    Wang, Ran
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (06) : 909 - 923
  • [26] Adaptive Operator Selection With Bandits for a Multiobjective Evolutionary Algorithm Based on Decomposition
    Li, Ke
    Fialho, Alvaro
    Kwong, Sam
    Zhang, Qingfu
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (01) : 114 - 130
  • [27] Achieving balance between proximity and diversity in multi-objective evolutionary algorithm
    Li, Ke
    Kwong, Sam
    Cao, Jingjing
    Li, Miqing
    Zheng, Jinhua
    Shen, Ruimin
    [J]. INFORMATION SCIENCES, 2012, 182 (01) : 220 - 242
  • [28] Decomposition of a Multiobjective Optimization Problem into a Number of Simple Multiobjective Subproblems
    Liu, Hai-Lin
    Gu, Fangqing
    Zhang, Qingfu
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (03) : 450 - 455
  • [29] Luna F., 2015, COMPUT J, V58
  • [30] Decomposition-Based Memetic Algorithm for Multiobjective Capacitated Arc Routing Problem
    Mei, Yi
    Tang, Ke
    Yao, Xin
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2011, 15 (02) : 151 - 165