A Novel Exponential-Weighted Method of the Antlion Optimization Algorithm for Improving the Convergence Rate

Abstract

The antlion optimization algorithm (ALO) is one of the most effective algorithms to solve combinatorial optimization problems, but it has some disadvantages, such as a long runtime. As a result, this problem impedes decision makers. In addition, due to the nature of the problem, the speed of convergence is a critical factor. As the size of the problem dimension grows, the convergence speed of the optimizer becomes increasingly significant. Many modified versions of the ALO have been developed in the past. Nevertheless, there are only a few research articles that discuss better boundary strategies that can increase the diversity of ants walking around an antlion to accelerate convergence. A novel exponential-weighted antlion optimization algorithm (EALO) is proposed in this paper to address slow convergence rates. The algorithm uses exponential functions and a random number in the interval 0, 1 to increase the diversity of the ant’s random walks. It has been demonstrated that by optimizing twelve classical objective functions of benchmark functions, the novel method has a higher convergence rate than the ALO. This is because it has the most powerful search capability and speed. In addition, the proposed method has also been compared to other existing methods, and it has obtained superior experimental results relative to compared methods. Therefore, the proposed EALO method deserves consideration as a possible optimization tool for solving combinatorial optimization problems, due to its highly competitive results.