Oriented multi-mutation strategy in a many-objective evolutionary algorithm

被引:6
作者
Wang, Hongbo [1 ]
Wang, Jin [1 ]
Zhen, Xiaoxiao [1 ]
Zeng, Fanbing [1 ]
Tu, Xuyan [1 ]
机构
[1] Univ Sci & Technol, Sch Comp & Commun Engn, Beijing Key Lab Knowledge Engn Mat Sci, Beijing 100083, Peoples R China
基金
中国国家自然科学基金;
关键词
Multi-mutation; Many-objective optimisation; Ensemble strategy; NONDOMINATED SORTING APPROACH; OPTIMIZATION; SEARCH;
D O I
10.1016/j.ins.2018.11.042
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Reference-point-based many objective optimisation is recognised to be a promising method with various applications. To mitigate the loss of selection pressure, most existing works try to discover a new preference relation and promote active diversity in its decisive space. However, with regard to breeding their off-springs, maintaining a good balance between convergence and diversity remains a dilemma. This paper suggests a novel theta dominance-based evolutionary algorithm (abbreviated as NUM-theta-DEA), which uses non-uniform mutation (NUM) instead of polynomial mutation. Its hybrid variant with a dual-stage model is also proposed. The technique focuses on rational exploitation and makes comprehensive use of the merits of non-uniform mutation, simulating binary crossover and differential evolution strategy. An extensive comparison with other many-objective optimisers was conducted in all the test benchmark problems with 3, 5, 8, 10, or 15 objectives. Experimental results and their relevant analyses illustrate that a very encouraging target can be achieved by NUM-theta-DEA with a multi-strategy switching mechanism. (C) 2018 Elsevier Inc. All rights reserved.
引用
收藏
页码:391 / 407
页数:17
相关论文
共 41 条
  • [1] MOTGA: A multiobjective Tchebycheff based genetic algorithm for the multidimensional knapsack problem
    Alves, Maria Joao
    Almeida, Marla
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2007, 34 (11) : 3458 - 3470
  • [2] HypE: An Algorithm for Fast Hypervolume-Based Many-Objective Optimization
    Bader, Johannes
    Zitzler, Eckart
    [J]. EVOLUTIONARY COMPUTATION, 2011, 19 (01) : 45 - 76
  • [3] A jumping gene paradigm for evolutionary multiobjective optimization
    Chan, T. M.
    Man, K. F.
    Kwong, S.
    Tang, K. S.
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2008, 12 (02) : 143 - 159
  • [4] Corne David W., 1999, P C EV COMP CEC 99, P98, DOI [DOI 10.1109/CEC.1999.781913, 10.1109/CEC.1999.781913]
  • [5] A novel harmony search algorithm with gaussian mutation for multi-objective optimization
    Dai, Xiangshan
    Yuan, Xiaofang
    Wu, Lianghong
    [J]. SOFT COMPUTING, 2017, 21 (06) : 1549 - 1567
  • [6] DAVIS L, 1989, PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON GENETIC ALGORITHMS, P61
  • [7] Deb Kalyanmoy, 2014, International Journal of Artificial Intelligence and Soft Computing, V4, P1, DOI 10.1504/IJAISC.2014.059280
  • [8] Deb K, 2004, ADV INFO KNOW PROC, P105
  • [9] A fast and elitist multiobjective genetic algorithm: NSGA-II
    Deb, K
    Pratap, A
    Agarwal, S
    Meyarivan, T
    [J]. IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) : 182 - 197
  • [10] Deb K., 1995, Complex Systems, V9, P115