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 条
  • [31] Environmental/economic power dispatch using multiobjective evolutionary algorithms
    Abido, MA
    IEEE TRANSACTIONS ON POWER SYSTEMS, 2003, 18 (04) : 1529 - 1537
  • [32] MULTIOBJECTIVE TUNING OF ROBUST GPC CONTROLLERS USING EVOLUTIONARY ALGORITHMS
    Herrero, J. M.
    Blasco, X.
    Martinez, M.
    Sanchis, J.
    IJCCI 2009: PROCEEDINGS OF THE INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL INTELLIGENCE, 2009, : 263 - 268
  • [33] Search Trajectories Networks of Multiobjective Evolutionary Algorithms
    Lavinas, Yuri
    Aranha, Claus
    Ochoa, Gabriela
    APPLICATIONS OF EVOLUTIONARY COMPUTATION (EVOAPPLICATIONS 2022), 2022, : 223 - 238
  • [34] Multiobjective evolutionary algorithms: A survey of the state of the art
    Zhou, Aimin
    Qu, Bo-Yang
    Li, Hui
    Zhao, Shi-Zheng
    Suganthan, Ponnuthurai Nagaratnam
    Zhang, Qingfu
    SWARM AND EVOLUTIONARY COMPUTATION, 2011, 1 (01) : 32 - 49
  • [35] Robust Multiobjective Optimization via Evolutionary Algorithms
    He, Zhenan
    Yen, Gary G.
    Yi, Zhang
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2019, 23 (02) : 316 - 330
  • [36] A Survey of Multiobjective Evolutionary Algorithms Based on Decomposition
    Trivedi, Anupam
    Srinivasan, Dipti
    Sanyal, Krishnendu
    Ghosh, Abhiroop
    IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2017, 21 (03) : 440 - 462
  • [37] Multiobjective Evolutionary Algorithms: Applications in Real Problems
    Berlanga, Antonio
    Garcia Herrero, Jess
    Manuel Molina, Jose
    BIO-INSPIRED SYSTEMS: COMPUTATIONAL AND AMBIENT INTELLIGENCE, PT 1, 2009, 5517 : 714 - 719
  • [38] A survey of decomposition approaches in multiobjective evolutionary algorithms
    Wang, Jia
    Su, Yuchao
    Lin, Qiuzhen
    Ma, Lijia
    Gong, Dunwei
    Li, Jianqiang
    Ming, Zhong
    NEUROCOMPUTING, 2020, 408 (408) : 308 - 330
  • [39] Designing Ionic Materials Through Multiobjective Genetic Algorithms
    Sreevathsan, R.
    Bhattacharya, B.
    Chakraborti, N.
    MATERIALS AND MANUFACTURING PROCESSES, 2009, 24 (02) : 162 - 168
  • [40] Multiobjective Evolutionary Algorithms for Intradomain Routing Optimization
    Rocha, Miguel
    Sa, Tiago
    Sousa, Pedro
    Cortez, Paulo
    Rio, Miguel
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 2272 - 2279