A new genetic operator to improve the diversity of the Multiobjective Evolutionary Algorithms

被引:0
|
作者
Freitas, Jamisson [1 ]
Garrozi, Cicero [2 ]
Valenca, Meuser [1 ]
机构
[1] Univ Pernambuco UPE, Dept Comp Engn, Recife, PE, Brazil
[2] Fed Rural Univ Pernambuco UFRPE, Dept Stat & Informat, Recife, PE, Brazil
来源
2015 IEEE INTERNATIONAL CONFERENCE ON SYSTEMS, MAN, AND CYBERNETICS (SMC 2015): BIG DATA ANALYTICS FOR HUMAN-CENTRIC SYSTEMS | 2015年
关键词
component; Evolutionary Algorithms; Artificial Neural Networks; Multiobjective Optimization; diversity improvement;
D O I
10.1109/SMC.2015.370
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
The optimization of many objectives requires a set of optimal solutions known as Pareto solutions. Similarly to the optimization of single objective in Evolutionary Algorithms (EAs), the Multiobjective Evolutionary Algorithms (MOEAs) also suffer from loss of genetic diversity, allowing the appearance of sparse regions along the Pareto frontier. A mechanism to maintain the population diversity along generations is needed. It is expected that, if diversity is controlled effectively, at the end of the evolutionary process, the Pareto Front optimum will be as uniformly distributed as possible. This paper proposes a new diversity operator that generates artificial solutions to fill sparse regions of the non-dominated set of solutions found by the MOEA. It uses artificial neural networks (ANN) to perform a reverse mapping from the phenotype to the corresponding genotype of an inserted artificial solution. This mechanism was tested with NSGA-II and SPEA2 algorithms. The addition of the diversity operator reached significant improvements in the hypervolume and the spread metrics of the obtained set of solutions non-dominated.
引用
收藏
页码:2118 / 2123
页数:6
相关论文
共 50 条
  • [41] Convergence analysis of some multiobjective evolutionary algorithms when discovering motifs
    David L. González-Álvarez
    Miguel A. Vega-Rodríguez
    Álvaro Rubio-Largo
    Soft Computing, 2014, 18 : 853 - 869
  • [42] Convergence analysis of some multiobjective evolutionary algorithms when discovering motifs
    Gonzalez-Alvarez, David L.
    Vega-Rodriguez, Miguel A.
    Rubio-Largo, Alvaro
    SOFT COMPUTING, 2014, 18 (05) : 853 - 869
  • [43] Multiobjective shape optimization of selected coupled problems by means of evolutionary algorithms
    Dlugosz, A.
    Burczynski, T.
    BULLETIN OF THE POLISH ACADEMY OF SCIENCES-TECHNICAL SCIENCES, 2012, 60 (02) : 215 - 222
  • [44] Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem
    Laumanns M.
    Thiele M.
    Zitzler E.
    Natural Computing, 2004, 3 (1) : 37 - 51
  • [45] Effects of Noisy Multiobjective Test Functions Applied to Evolutionary Optimization Algorithms
    Ryter, Remo
    Hanne, Thomas
    Dornberger, Rolf
    JOURNAL OF ADVANCES IN INFORMATION TECHNOLOGY, 2020, 11 (03) : 128 - 134
  • [46] HC-MOEA: A hierarchical clustering approach for increasing the solution's diversity in multiobjective evolutionary algorithms
    Tahernezhad, Kamyab
    Lari, Kimia Bazargan
    Hamzeh, Ali
    Hashemi, Sattar
    INTELLIGENT DATA ANALYSIS, 2015, 19 (01) : 187 - 208
  • [47] Controlling diversity of evolutionary algorithms
    Nguyen, DHM
    Wong, KP
    2003 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-5, PROCEEDINGS, 2003, : 775 - 780
  • [48] RECENT CHALLENGES IN THE USE OF EVOLUTIONARY ALGORITHMS FOR MULTIOBJECTIVE OPTIMISATION
    Janssens, Gerrit K.
    INTERNATIONAL JOURNAL ON INFORMATION TECHNOLOGIES AND SECURITY, 2009, 1 (01): : 3 - 12
  • [49] Multiobjective Evolutionary Algorithms: Analyzing the State-of-the-Art
    Van Veldhuizen, David A.
    Lamont, Gary B.
    EVOLUTIONARY COMPUTATION, 2000, 8 (02) : 125 - 147
  • [50] Multiobjective evolutionary algorithms for complex portfolio optimization problems
    Anagnostopoulos K.P.
    Mamanis G.
    Computational Management Science, 2011, 8 (3) : 259 - 279