This work introduces a novel methodology to perform the comparative analysis of evolutionary optimization algorithms. The methodology relies simply on linear regression and quantile–quantile plots. The methodology is extrapolated as… Click to show full abstract
This work introduces a novel methodology to perform the comparative analysis of evolutionary optimization algorithms. The methodology relies simply on linear regression and quantile–quantile plots. The methodology is extrapolated as the one-to-one comparison, one-to-many comparison and many-to-many comparison of solution quality and convergence rate. Most of the existing approaches utilize both solution quality and convergence rate to perform comparative analysis. However, many-to-many comparison, i.e., ranking of algorithms is done only in terms of solution quality. The proposed method is capable of ranking algorithms in terms of both solution quality and convergence rate. Method is analyzed with well-established algorithms and real data obtained from 25 benchmark functions.
               
Click one of the above tabs to view related content.