Search Process Analysis of Multiobjective Evolutionary Algorithms using Convergence-Diversity Diagram

被引:0
作者
Kinoshita, Takato [1 ]
Masuyama, Naoki [2 ]
Nojima, Yusuke [2 ]
机构
[1] Osaka Prefecture Univ, Guraduate Sch Engn, Sakai, Osaka, Japan
[2] Osaka Metropolitan Univ, Grad Sch Informat, Sakai, Osaka, Japan
来源
2022 JOINT 12TH INTERNATIONAL CONFERENCE ON SOFT COMPUTING AND INTELLIGENT SYSTEMS AND 23RD INTERNATIONAL SYMPOSIUM ON ADVANCED INTELLIGENT SYSTEMS (SCIS&ISIS) | 2022年
基金
日本学术振兴会;
关键词
multi-objective optimization; multi-objective evolutionary algorithm; search process analysis; convergence; diversity;
D O I
10.1109/SCISISIS55246.2022.10001961
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Many tasks in the real world are multi-objective optimization problems (MOPs). Population-based approaches are promising for solving MOPs. In particular, multi-objective evolutionary algorithms (MOEAs) are popular and have been actively studied over the last two decades. However, since it is not easy to directly display and compare multi-dimensional solution sets, it is difficult to analyze the search process of MOEAs using direct visualization techniques such as scatter plots. This paper proposes an analytical method to compare multiple search processes in terms of convergence and diversity by extending the authors' previous work, i.e., Convergence-Diversity Diagram. Through computational experiments, the proposed method reveals characteristics and similarities in three representative MOEAs and six test problems. In addition, this paper provides discussions on algorithm design, biases in the DTLZ test suite, and the improvement of visualization based on experimental results.
引用
收藏
页数:6
相关论文
共 50 条
[41]   Inheritance-Based Diversity Measures for Explicit Convergence Control in Evolutionary Algorithms [J].
Gabor, Thomas ;
Belzner, Lenz ;
Linnhoff-Popien, Claudia .
GECCO'18: PROCEEDINGS OF THE 2018 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2018, :841-848
[42]   Running time analysis of evolutionary algorithms on a simplified multiobjective knapsack problem [J].
Laumanns M. ;
Thiele M. ;
Zitzler E. .
Natural Computing, 2004, 3 (1) :37-51
[43]   Using a Parallel Team of Multiobjective Evolutionary Algorithms to Solve the Motif Discovery Problem [J].
Gonzalez-Alvarez, David L. ;
Vega-Rodriguez, Miguel A. ;
Gomez-Pulido, Juan A. ;
Sanchez-Perez, Juan M. .
DISTRIBUTED COMPUTING AND ARTIFICIAL INTELLIGENCE, 2010, 79 :569-576
[44]   Multiobjective Optimization of a Pin-Fin Heat Sink Using Evolutionary Algorithms [J].
Kanyakam, Siwadol ;
Bureerat, Sujin .
JOURNAL OF ELECTRONIC PACKAGING, 2012, 134 (02)
[45]   Environmental/economic power dispatch using multiobjective evolutionary algorithms: A comparative study [J].
Abido, MA .
2003 IEEE POWER ENGINEERING SOCIETY GENERAL MEETING, VOLS 1-4, CONFERENCE PROCEEDINGS, 2003, :920-925
[46]   Running time analysis of multiobjective evolutionary algorithms on Pseudo-Boolean functions [J].
Laumanns, M ;
Thiele, L ;
Zitzler, E .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2004, 8 (02) :170-182
[47]   Exploring multiobjective evolutionary algorithms for designing Ribonucleic Acid sequences: An experimental analysis [J].
Rubio-Largo, Alvaro ;
Lozano-Garcia, Nuria ;
Granado-Criado, Jose M. .
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2025, 157
[48]   Comparative analysis of multiobjective evolutionary algorithms for random and correlated instances of multiobjective d-dimensional knapsack problems [J].
Shah, Ruchit ;
Reed, Patrick .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2011, 211 (03) :466-479
[49]   HC-MOEA: A hierarchical clustering approach for increasing the solution's diversity in multiobjective evolutionary algorithms [J].
Tahernezhad, Kamyab ;
Lari, Kimia Bazargan ;
Hamzeh, Ali ;
Hashemi, Sattar .
INTELLIGENT DATA ANALYSIS, 2015, 19 (01) :187-208
[50]   Analysis of the diversity of population and convergence of genetic algorithms based on Negentropy [J].
Zhang Lianying Wang AnminManagement School Tianjin University Tianjin P R China .
Journal of Systems Engineering and Electronics, 2005, (01) :215-219