Local Neighborhood-Based Adaptation of Weights in Multi-Objective Evolutionary Algorithms Based on Decomposition

被引:1
作者
Junqueira, Paulo Pinheiro [1 ]
Meneghini, Ivan Reinaldo [2 ]
Guimaraes, Frederico Gadelha [3 ]
机构
[1] Univ Fed Minas Gerais, UFMG, Grad Program Elect Engn, Av Antonio Carlos 6627, BR-31270000 Belo Horizonte, MG, Brazil
[2] Fed Inst Educ Sci & Technol Minas Gerais, Ibirite, Brazil
[3] Univ Fed Minas Gerais, Machine Intelligence & Data Sci Lab MINDS, BR-31270000 Belo Horizonte, MG, Brazil
来源
2021 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC 2021) | 2021年
关键词
Multi-objective optimization; adaptive weight vector; evolutionary algorithm; decomposition; NONDOMINATED SORTING APPROACH; OPTIMIZATION; MOEA/D; PERFORMANCE;
D O I
10.1109/CEC45853.2021.9504688
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Multi-objective algorithms based on decomposition have become popular for the reason that a uniform distribution of weight vectors may result in a better distribution of solutions along the Pareto front. However, for more complex Pareto fronts with irregular shapes, the initial weight vectors may not be adequate. One alternative to overcome this problem, is to adapt the weight vectors during the evolutionary process. In this paper an adaptive version of Multi-Objective Evolutionary Algorithm based on Decomposition (MOEA/D) is proposed to change the weight vectors based on the concept of local neighborhoods. The proposed method is called MOEA/D with local-neighborhood-based adaptation (MOEA/D-LNA). The proposed method is compared against a number of famous variants of MOEA/D in the literature. Initial experimental results have shown promising effectiveness on problems with irregular Pareto shapes.
引用
收藏
页码:1454 / 1461
页数:8
相关论文
共 26 条
[1]  
Bhattacharjee K. S., 2017, 2017 IEEE C EV COMP
[2]   Generating Well-Spaced Points on a Unit Simplex for Evolutionary Many-Objective Optimization [J].
Blank, Julian ;
Deb, Kalyanmoy ;
Dhebar, Yashesh ;
Bandaru, Sunith ;
Seada, Haitham .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2021, 25 (01) :48-60
[3]   Pymoo: Multi-Objective Optimization in Python']Python [J].
Blank, Julian ;
Deb, Kalyanmoy .
IEEE ACCESS, 2020, 8 :89497-89509
[4]   An External Archive Guided Multiobjective Evolutionary Algorithm Based on Decomposition for Combinatorial Optimization [J].
Cai, Xinye ;
Li, Yexing ;
Fan, Zhun ;
Zhang, Qingfu .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2015, 19 (04) :508-523
[5]  
Camacho Auraham, 2019, Evolutionary Multi-Criterion Optimization. 10th International Conference, EMO 2019. Proceedings: Lecture Notes in Computer Science (LNCS 11411), P216, DOI 10.1007/978-3-030-12598-1_18
[6]   A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization [J].
Cheng, Ran ;
Jin, Yaochu ;
Olhofer, Markus ;
Sendhoff, Bernhard .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) :773-791
[7]   Normal-boundary intersection: A new method for generating the Pareto surface in nonlinear multicriteria optimization problems [J].
Das, I ;
Dennis, JE .
SIAM JOURNAL ON OPTIMIZATION, 1998, 8 (03) :631-657
[8]  
Deb K, 2004, ADV INFO KNOW PROC, P105
[9]   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
[10]   Towards Understanding the Cost of Adaptation in Decomposition-Based Optimization Algorithms [J].
Giagkiozis, Ioannis ;
Purshouse, Robin C. ;
Fleming, Peter J. .
2013 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2013), 2013, :615-620