The performance of individual evolutionary optimization algorithms is mostly measured in terms of statistics such as mean, median and standard deviation etc., computed over the best solutions obtained with few trails of the algorithm. To compare the performance of two algorithms, the values of these statistics are compared instead of comparing the solutions directly. This kind of comparison lacks direct comparison of solutions obtained with different algorithms. For instance, the comparison of best solutions (or worst solution) of two algorithms simply not possible. Moreover, ranking of algorithms is mostly done in terms of solution quality only, despite the fact that the convergence of algorithm is also an important factor. In this paper, a direct comparison approach is proposed to analyze the performance of evolutionary optimization algorithms. A direct comparison matrix called \emph{Prasatul Matrix} is prepared, which accounts direct comparison outcome of best solutions obtained with two algorithms for a specific number of trials. Five different performance measures are designed based on the prasatul matrix to evaluate the performance of algorithms in terms of Optimality and Comparability of solutions. These scores are utilized to develop a score-driven approach for comparing performance of multiple algorithms as well as for ranking both in the grounds of solution quality and convergence analysis. Proposed approach is analyzed with six evolutionary optimization algorithms on 25 benchmark functions. A non-parametric statistical analysis, namely Wilcoxon paired sum-rank test is also performed to verify the outcomes of proposed direct comparison approach.
Estimate Hitting Time by Hitting Probability for Elitist Evolutionary Algorithms
Nottingham Trent University(诺丁汉特伦特大学);Southern University of Science and Technology(南方科技大学);University of Nottingham Ningbo China(诺丁汉大学宁波校区);Lingnan University(岭南大学)
Large Language Model-Driven Surrogate-Assisted Evolutionary Algorithm for Expensive Optimization
Department of Electrical and Electronic Engineering, The Hong Kong Polytechnic University(香港理工大学电子与电气工程系);College of Computer Science and Software Engineering, Shenzhen University(深圳大学计算机科学与软件工程学院);School of Automation and Intelligent Manufacturing, Southern University of Science and Technology(南方科技大学自动化与智能制造学院);Academy of Artificial Intelligence, College of Mathematics Science, Inner Mongolia Normal University(内蒙古师范大学数学科学学院人工智能学院);Key Laboratory of Collaborative Intelligence Systems, Ministry of Education, Xidian University(西安电子科技大学教育部协同智能系统重点实验室)
Block-Bench: A Framework for Controllable and Transparent Discrete Optimization Benchmarking
LIACS, Leiden University(莱顿大学);Optimisation and Logistics, School of Computer Science and Information Technology, Adelaide University(阿德莱德大学);Adelaide University(阿德莱德大学)
On the Effectiveness of Genetic Operations in Symbolic Regression
Heuristic and Evolutionary Algorithms Laboratory(启发式与进化算法实验室);University of Applied Sciences Upper Austria(上奥地利应用科学大学);Institute for Formal Models and Verification(形式模型与验证研究所);Johannes Kepler University Linz(林茨约翰开普勒大学)