Analyzing convergence performance of evolutionary algorithms: A statistical approach

被引:135
作者
Derrac, Joaquin [1 ]
Garcia, Salvador [2 ]
Hui, Sheldon [3 ]
Suganthan, Ponnuthurai Nagaratnam [3 ]
Herrera, Francisco [4 ,5 ]
机构
[1] Cardiff Univ, Sch Comp Sci & Informat, Cardiff CF24 3AA, S Glam, Wales
[2] Univ Jaen, Dept Comp Sci, Jaen 23071, Spain
[3] Nanyang Technol Univ, Sch Elect & Elect Engn, Singapore 639798, Singapore
[4] Univ Granada, Dept Comp Sci & Artificial Intelligence, E-18071 Granada, Spain
[5] King Abdulaziz Univ, Fac Comp & Informat Technol North Jeddah, Jeddah 21589, Saudi Arabia
关键词
Page's trend test; Nonparametric tests; Convergence-based algorithmic comparison; Evolutionary algorithms; DIFFERENTIAL EVOLUTION; MAIN PARAMETERS; TESTS; INTELLIGENCE; DESIGN;
D O I
10.1016/j.ins.2014.06.009
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The analysis of the performance of different approaches is a staple concern in the design of Computational Intelligence experiments. Any proper analysis of evolutionary optimization algorithms should incorporate a full set of benchmark problems and state-of-the-art comparison algorithms. For the sake of rigor, such an analysis may be completed with the use of statistical procedures, supporting the conclusions drawn. In this paper, we point out that these conclusions are usually limited to the final results, whereas intermediate results are seldom considered. We propose a new methodology for comparing evolutionary algorithms' convergence capabilities, based on the use of Page's trend test. The methodology is presented with a case of use, incorporating real results from selected techniques of a recent special issue. The possible applications of the method are highlighted, particularly in those cases in which the final results do not enable a clear evaluation of the differences among several evolutionary techniques. (C) 2014 Published by Elsevier Inc.
引用
收藏
页码:41 / 58
页数:18
相关论文
共 43 条
[1]  
[Anonymous], 2003, Introduction to modern nonparametric statistics
[2]  
[Anonymous], 2005, NAT COMPUT
[3]  
[Anonymous], IEEE T EVOL COMPUT
[4]  
[Anonymous], P 13 ANN C GEN EV CO
[5]  
[Anonymous], 2011, INT ENCY STAT SCI
[6]  
[Anonymous], P IEEE C EV COMP CEC
[7]  
[Anonymous], P 14 ANN C GEN EV CO
[8]   Using statistical tools to determine the significance and relative importance of the main parameters of an evolutionary algorithm [J].
Arenas, M. G. ;
Rico, N. ;
Mora, A. M. ;
Castillo, P. A. ;
Merelo, J. J. .
INTELLIGENT DATA ANALYSIS, 2013, 17 (05) :771-789
[9]  
Bartz-Beielstein T., 2006, EXPT RES EVOLUTIONAR
[10]   On Gradients and Hybrid Evolutionary Algorithms for Real-Valued Multiobjective Optimization [J].
Bosman, Peter A. N. .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2012, 16 (01) :51-69