HRA: A Multi-Criteria Framework for Ranking Metaheuristic Optimization Algorithms
This provides a practical tool for practitioners to simplify algorithm selection in optimization problems, though it is incremental as it builds on existing ranking and aggregation methods.
The paper tackles the difficulty of comparing metaheuristic optimization algorithms due to diverse performance metrics and problem dimensions by proposing the Hierarchical Rank Aggregation (HRA) framework, which efficiently ranks 13 algorithms across 30 benchmark functions using five indicators in four dimensions, demonstrating robustness on CEC 2017 data.
Metaheuristic algorithms are essential for solving complex optimization problems in different fields. However, the difficulty in comparing and rating these algorithms remains due to the wide range of performance metrics and problem dimensions usually involved. On the other hand, nonparametric statistical methods and post hoc tests are time-consuming, especially when we only need to identify the top performers among many algorithms. The Hierarchical Rank Aggregation (HRA) algorithm aims to efficiently rank metaheuristic algorithms based on their performance across many criteria and dimensions. The HRA employs a hierarchical framework that begins with collecting performance metrics on various benchmark functions and dimensions. Rank-based normalization is employed for each performance measure to ensure comparability and the robust TOPSIS aggregation is applied to combine these rankings at several hierarchical levels, resulting in a comprehensive ranking of the algorithms. Our study uses data from the CEC 2017 competition to demonstrate the robustness and efficacy of the HRA framework. It examines 30 benchmark functions and evaluates the performance of 13 metaheuristic algorithms across five performance indicators in four distinct dimensions. This presentation highlights the potential of the HRA to enhance the interpretation of the comparative advantages and disadvantages of various algorithms by simplifying practitioners' choices of the most appropriate algorithm for certain optimization problems.