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
来源
2020 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC) | 2020年
基金
中国国家自然科学基金;
关键词
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
相关论文
共 33 条
[1]  
[Anonymous], 2006, FIELDS MITACS IND PR
[2]   A Decomposition-Based Evolutionary Algorithm for Many Objective Optimization [J].
Asafuddoula, M. ;
Ray, Tapabrata ;
Sarker, Ruhul .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (03) :445-460
[3]  
Asafuddoula M, 2013, LECT NOTES COMPUT SC, V7811, P413, DOI 10.1007/978-3-642-37140-0_32
[4]  
Blank J, 2019, P EV MULT OPT E LANS, V11411, P229, DOI 10.1007/978-3-030-12598-1_19.
[5]  
Deb K, 2002, IEEE C EVOL COMPUTAT, P825, DOI 10.1109/CEC.2002.1007032
[6]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[7]   An Evolutionary Many-Objective Optimization Algorithm Using Reference-Point-Based Nondominated Sorting Approach, Part I: Solving Problems With Box Constraints [J].
Deb, Kalyanmoy ;
Jain, Himanshu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2014, 18 (04) :577-601
[8]   Toward an Estimation of Nadir Objective Vector Using a Hybrid of Evolutionary and Local Search Approaches [J].
Deb, Kalyanmoy ;
Miettinen, Kaisa ;
Chaudhuri, Shamik .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2010, 14 (06) :821-841
[9]  
Deb S, 2009, FIFTEENTH ACM INTERNATIONAL CONFERENCE ON MOBILE COMPUTING AND NETWORKING (MOBICOM 2009), P1
[10]   Approximating Complex Pareto Fronts With Predefined Normal-Boundary Intersection Directions [J].
Elarbi, Maha ;
Bechikh, Slim ;
Coello Coello, Carlos A. ;
Makhlouf, Mohamed ;
Ben Said, Lamjed .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (05) :809-823