Influence of Reference Points on a Many-Objective Optimization Algorithm

被引:2
|
作者
Carvalho, Matheus [1 ]
Britto, Andre [2 ]
机构
[1] Univ Fed Sergipe, Elect Engn Dept, Sao Cristovao, Sergipe, Brazil
[2] Univ Fed Sergipe, Computat Dept, Sao Cristovao, Sergipe, Brazil
关键词
Many-Objective Optimization; Reference Points; NSGA-III;
D O I
10.1109/BRACIS.2018.00014
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Many-Objective Optimization Problems (MaOPs) are problems that have more than three objective functions to be optimized. Most Multi-Objective Evolutionary Algorithms scales poorly when the number of objective function increases. To face this limitation, new strategies have been proposed. One of them is the use of reference points to enhance the search of the algorithms. NSGA-III is a reference point based algorithm that has been successfully applied to solve MaOPs. NSGA-III uses a set of reference points placed on a normalized hyperplane which is equally inclined to all objective axes and has an intercept at 1 on each axis. Despite the good results of NSGA-III, the shape of the hyper-plane is not deeply explored in literature. This work studies the influence of the set of reference points on Many-Objective Optimization. Here, it is proposed three new transformations of the reference points set used by NSGA-III. Besides, the Vector Guided Adaptation procedure is also applied to modify original NSGA-III hyper-plane. Furthermore, an adaptation of NSGA-III algorithm is proposed and it is performed a set of experiments to evaluate the transformation procedures. Original and adapted versions of NSGA-III are faced over several benchmarking problems observing both convergence and diversity through the analysis of statistical tests.
引用
收藏
页码:31 / 36
页数:6
相关论文
共 50 条
  • [1] Many-objective evolutionary optimization based on reference points
    Liu, Yiping
    Gong, Dunwei
    Sun, Xiaoyan
    Zhang, Yong
    [J]. APPLIED SOFT COMPUTING, 2017, 50 : 344 - 355
  • [2] Entropy based evolutionary algorithm with adaptive reference points for many-objective optimization problems
    Zhou, Chong
    Dai, Guangming
    Zhang, Cuijun
    Li, Xiangping
    Ma, Ke
    [J]. INFORMATION SCIENCES, 2018, 465 : 232 - 247
  • [3] A decomposition-based many-objective ant colony optimization algorithm with adaptive reference points
    Zhao, Haitong
    Zhang, Changsheng
    Zhang, Bin
    [J]. INFORMATION SCIENCES, 2020, 540 (540) : 435 - 448
  • [4] Indicator and reference points co-guided evolutionary algorithm for many-objective optimization problems
    Dai, Guangming
    Zhou, Chong
    Wang, Maocai
    Li, Xiangping
    [J]. KNOWLEDGE-BASED SYSTEMS, 2018, 140 : 50 - 63
  • [5] A Many-Objective Evolutionary Algorithm With Pareto-Adaptive Reference Points
    Xiang, Yi
    Zhou, Yuren
    Yang, Xiaowei
    Huang, Han
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2020, 24 (01) : 99 - 113
  • [6] A Reference Vector Guided Evolutionary Algorithm for Many-Objective Optimization
    Cheng, Ran
    Jin, Yaochu
    Olhofer, Markus
    Sendhoff, Bernhard
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2016, 20 (05) : 773 - 791
  • [7] Many-objective optimization algorithm based on adaptive reference vector
    Hu, Ziyu
    Ma, Xuemin
    Sun, Hao
    Yang, Jingming
    Zhao, Zhiwei
    [J]. JOURNAL OF INTELLIGENT & FUZZY SYSTEMS, 2021, 40 (01) : 449 - 461
  • [8] A reference points and intuitionistic fuzzy dominance based particle swarm algorithm for multi/many-objective optimization
    Yang, Wusi
    Chen, Li
    Wang, Yi
    Zhang, Maosheng
    [J]. APPLIED INTELLIGENCE, 2020, 50 (04) : 1133 - 1154
  • [9] A reference points and intuitionistic fuzzy dominance based particle swarm algorithm for multi/many-objective optimization
    Wusi Yang
    Li Chen
    Yi Wang
    Maosheng Zhang
    [J]. Applied Intelligence, 2020, 50 : 1133 - 1154
  • [10] A novel two-archive strategy for evolutionary many-objective optimization algorithm based on reference points
    Ding, Rui
    Dong, Hongbin
    He, Jun
    Li, Tao
    [J]. APPLIED SOFT COMPUTING, 2019, 78 : 447 - 464