Modified Archimedes optimization algorithm for global optimization problems: a comparative study

Abstract

AbstractArchimedes Optimization Algorithm (AOA) is a recent optimization algorithm inspired by Archimedes’ Principle. In this study, a Modified Archimedes Optimization Algorithm (MDAOA) is proposed. The goal of the modification is to avoid early convergence and improve balance between exploration and exploitation. Modification is implemented by a two phase mechanism: optimizing the candidate positions of objects using the dimension learning-based (DL) strategy and recalculating predetermined five parameters used in the original AOA. DL strategy along with problem specific parameters lead to improvements in the balance between exploration and exploitation. The performance of the proposed MDAOA algorithm is tested on 13 standard benchmark functions, 29 CEC 2017 benchmark functions, optimal placement of electric vehicle charging stations (EVCSs) on the IEEE-33 distribution system, and five real-life engineering problems. In addition, results of the proposed modified algorithm are compared with modern and competitive algorithms such as Honey Badger Algorithm, Sine Cosine Algorithm, Butterfly Optimization Algorithm, Particle Swarm Optimization Butterfly Optimization Algorithm, Golden Jackal Optimization, Whale Optimization Algorithm, Ant Lion Optimizer, Salp Swarm Algorithm, and Atomic Orbital Search. Experimental results suggest that MDAOA outperforms other algorithms in the majority of the cases with consistently low standard deviation values. MDAOA returned best results in all of 13 standard benchmarks, 26 of 29 CEC 2017 benchmarks (89.65%), optimal placement of EVCSs problem and all of five real-life engineering problems. Overall success rate is 45 out of 48 problems (93.75%). Results are statistically analyzed by Friedman test with Wilcoxon rank-sum as post hoc test for pairwise comparisons.