An Improved Arithmetic Optimization Algorithm and Its Application to Determine the Parameters of Support Vector Machine

Abstract

The arithmetic optimization algorithm (AOA) is a new metaheuristic algorithm inspired by arithmetic operators (addition, subtraction, multiplication, and division) to solve arithmetic problems. The algorithm is characterized by simple principles, fewer parameter settings, and easy implementation, and has been widely used in many fields. However, similar to other meta-heuristic algorithms, AOA suffers from shortcomings, such as slow convergence speed and an easy ability to fall into local optimum. To address the shortcomings of AOA, an improved arithmetic optimization algorithm (IAOA) is proposed. First, dynamic inertia weights are used to improve the algorithm’s exploration and exploitation ability and speed up the algorithm’s convergence speed; second, dynamic mutation probability coefficients and the triangular mutation strategy are introduced to improve the algorithm’s ability to avoid local optimum. In order to verify the effectiveness and practicality of the algorithm in this paper, six benchmark test functions are selected for the optimization search test verification to verify the optimization search ability of IAOA; then, IAOA is used for the parameter optimization of support vector machines to verify the practical ability of IAOA. The experimental results show that IAOA has a strong global search capability, and the optimization-seeking capability is significantly improved, and it shows excellent performance in support vector machine parameter optimization.