Dynamic Normalization in MOEA/D for Multiobjective Optimization

被引:0
|
作者
He, Linjun [1 ,2 ]
Ishibuchi, Hisao [1 ]
Trivedit, Anupam [2 ]
Srinivasant, Dipti [2 ]
机构
[1] Southern Univ Sci & Technol, Univ Key Lab Evolving Intelligent Syst Guangdong, Dept Comp Sci & Engn, Shenzhen Key Lab Computat Intelligence, Shenzhen, Peoples R China
[2] Natl Univ Singapore, Dept Elect & Comp Engn, Singapore, Singapore
基金
中国国家自然科学基金;
关键词
Objective space normalization; decomposition-based algorithms; MOEA/D; evolutionary multiobjective optimization; MANY-OBJECTIVE OPTIMIZATION; EVOLUTIONARY ALGORITHM; CONVERGENCE; DIVERSITY; SEARCH;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Objective space normalization is important since a real-world multiobjective problem usually has differently scaled objective functions. Recently, bad effects of the commonly used simple normalization method have been reported for the popular decomposition-based algorithm MOEA/D. However, the effects of recently proposed sophisticated normalization methods have not been investigated. In this paper, we examine the effectiveness of these normalization methods in MOEA/D. We find that these normalization methods can cause performance deterioration. We also find that the sophisticated normalization methods are not necessarily better than the simple one. Although the negative effects of inaccurate estimation of the nadir point are well recognized in the literature, no solution has been proposed. In order to address this issue, we propose two dynamic normalization strategies which dynamically adjust the extent of normalization during the evolutionary process. Experimental results clearly show the necessity of considering the extent of normalization.
引用
收藏
页数:8
相关论文
共 50 条
  • [41] A GPU Implementation of MOEA/D-ACO for the Multiobjective Traveling Salesman Problem
    de Souza, Murilo Zangari
    Ramirez Pozo, Aurora Trinidad
    2014 BRAZILIAN CONFERENCE ON INTELLIGENT SYSTEMS (BRACIS), 2014, : 324 - 329
  • [42] Multiobjective Permutation Flow Shop Scheduling using MOEA/D with Local Search
    Chang, Yu-Teng
    Chiang, Tsung-Che
    2016 CONFERENCE ON TECHNOLOGIES AND APPLICATIONS OF ARTIFICIAL INTELLIGENCE (TAAI), 2016, : 262 - 269
  • [43] Control-structure integrated multiobjective design for flexible spacecraft using MOEA/D
    Feng, Zhiwei
    Zhang, Qingbin
    Tang, Qiangang
    Yang, Tao
    Ge, Jianquan
    STRUCTURAL AND MULTIDISCIPLINARY OPTIMIZATION, 2014, 50 (02) : 347 - 362
  • [44] Control-structure integrated multiobjective design for flexible spacecraft using MOEA/D
    Zhiwei Feng
    Qingbin Zhang
    Qiangang Tang
    Tao Yang
    Jianquan Ge
    Structural and Multidisciplinary Optimization, 2014, 50 : 347 - 362
  • [45] An Enhanced MOEA/D-DE and Its Application to Multiobjective Analog Cell Sizing
    Liu, Bo
    Fernandez, Francisco V.
    Zhang, Qingfu
    Pak, Murat
    Sipahi, Suha
    Gielen, Georges
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [46] Control-structure integrated multiobjective design for flexible spacecraft using MOEA/D
    Zhang, Q. (qingbinzhang@sina.com), 1600, Springer Verlag (50):
  • [47] MOEA/D-ACO: A Multiobjective Evolutionary Algorithm Using Decomposition and Ant Colony
    Ke, Liangjun
    Zhang, Qingfu
    Battiti, Roberto
    IEEE TRANSACTIONS ON CYBERNETICS, 2013, 43 (06) : 1845 - 1859
  • [48] ar-MOEA: A Novel Preference-Based Dominance Relation for Evolutionary Multiobjective Optimization
    Yi, Jun
    Bai, Junren
    He, Haibo
    Peng, Jun
    Tang, Dedong
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (05) : 788 - 802
  • [49] A Modified MOEA/D by Introducing an Invasive Weed Optimization Operator
    Liu, Ruochen
    Lian, Cheng
    Zhang, Langlang
    Wang, Xiao
    2017 13TH INTERNATIONAL CONFERENCE ON NATURAL COMPUTATION, FUZZY SYSTEMS AND KNOWLEDGE DISCOVERY (ICNC-FSKD), 2017, : 271 - 277
  • [50] A New Steady-State MOEA/D for Sparse Optimization
    Li, Hui
    Sun, Jianyong
    Fan, Yuanyuan
    Wang, Mingyang
    Zhang, Qingfu
    ADVANCES IN COMPUTATIONAL INTELLIGENCE SYSTEMS, 2018, 650 : 119 - 131