# An Improved Beetle Antennae Search Algorithm Based on Inertia Weight and Attenuation Factor

Authors: Hongmei Zhao; Heming Yao; Yuzhao Jiao; Taishan Lou; Yunfei Wang
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

The beetle antennae search algorithm is an effective bio-inspired algorithm. However, the algorithm is easy to fall into local optimal solution when dealing with high-dimensional and multimodal problems. An improved beetle antennae search algorithm based on inertia weight and attenuation factor was proposed in order to solve the problems. The inertia weights of normal distribution, versoria distribution, and random distribution are introduced into the weight to improve the search strategy, which was introduced to control the proportion of global search and local search so that the algorithm will escape the local optimum. Meanwhile, the randomness is introduced in the process of beetle’s step-size update, which can better help beetle to escape from the local optimum. Experiments on some benchmarks show that the algorithm has obvious performance improvement in dealing with high-dimensional and multimodal problems.


---

## Body

## 1. Introduction

The optimization problem has always been one of the most widely concerned problem [1]. It can be divided into convex optimization [2] and nonconvex optimization [3]. For the traditional convex optimization problem, any local optimal solution is chosen as being the global optimal solution. However, nonconvex problems may have an infinite number of locally optimal solutions and it is not differentiable in the feasible region. Researchers have been searching for a better method to deal with them. The effective results have been obtained from the steepest descent method [4], conjugate gradient method [5], Newton method [6], quasi-Newton method [7], and trust region method [8] in convex optimization.For nonconvex optimization problems, there are a lot of optimization algorithms that can solve it such as projected gradient descent [9], alternating minimization [10], expectation-maximization [11], and stochastic optimization [12]. However, these algorithms are all for a kind of structure. Convex relaxation [13] is also an effective method, which releases some constraints and transforms the nonconvex optimization problem into the convex optimization problem. In addition, the Monte Carlo method [14] is a classical method to solve nonconvex problems. However, when dealing with a slightly more complex problem, it will face a lot of computation load. In order to overcome the weakness of traditional optimization algorithms on nonconvex problems, bio-inspired algorithms [15–17] had gradually appeared in our field of vision. Bio-inspired algorithms are becoming popular because of their flexibility, robustness, and ability to escape local optimum. At present, common bio-inspired algorithms include particle swarm optimization algorithm [18], bee colony optimization algorithm [19], ant colony optimization algorithm [20], genetic optimization algorithm [21], chicken optimization algorithm [22], firefly optimization algorithm [23], butterfly optimization algorithm [24], and gray wolf optimization algorithm [25]. These algorithms have achieved remarkable results in solving nonconvex problems of modern engineering applications [26]. These algorithms all belong to the swarm algorithm, and they are all in the swarm to complete the search task, which has a large amount of calculation and does not have a good real-time performance. However, the individual algorithm can make up for those shortcomings.The beetle antennae search (BAS) algorithm [27] was proposed by Jiang in 2017, which is an individual algorithm. The algorithm is inspired by beetle searching for food. The proposed BAS algorithm can better solve the problem of the global optimal solution of nonconvex function under low dimensions and has a faster convergence. The BAS algorithm has fewer initial parameters and is less affected by parameter sensitivity. At the same time, the BAS algorithm is only a single beetle during iteration, which is more efficient than current newer algorithms in terms of time and space complexity, such as the Harris Eagle algorithm [28], colony predation algorithm [29], moth search algorithm [30], and slime mould algorithm [31]. The BAS algorithm has been widely used in robot path planning and obstacle avoidance, PID parameter setting, image enhancement, fault diagnosis, neural network, etc. However, the BAS algorithm may have slow convergence speed, low iteration accuracy, and even divergence when dealing with complex multimodal and high-dimensional situations.In order to solve the problem that the algorithm is easy to fall into local optimum, Wang [32] proposes the beetle swarm antennae search (BSAS) algorithm, which combines swarm intelligence algorithm with a feedback-based step-size update strategy. But it ignored the influence of swarm on individuals and increased the calculation. The introduction of population quantitative characteristics does not guarantee computation. Therefore, it should be improved from the individual structure in order to reduce the computational burden. Ameer [33] proposed the BAS-ADAM to smooth the convergence behavior and avoid trapping in the local optimal solution for a highly nonconvex objective function by introducing the adaptive moment estimation from the structure of the BAS algorithm. It introduced the ADAM’s update rules into BAS to adjust the step size for each dimension separately instead of using the same step size. It has the characteristics of fast convergence, but the algorithm still falls into the local optimal solution, and its performance on nonconvex functions is mediocre. In order to solve the problem that the algorithm is easy to fall into local optimum on nonconvex functions, Xu [34] proposed the beetle antennae search algorithm based on lévy flights and adaptive strategy (LABAS). The algorithm turns the beetle into a population and updates the population with elite individuals’ information to improve the convergence rate and stability, but it can only be adapted to single-objective optimization problems. In order to further improve the objective optimization problems, Lin [35] introduced the inertia weight of linear decreasing into the process of beetle search to ensure that the early iteration speed was fast and the later iteration speed was slow in the process of beetle search. However, the change rate of linear decreasing weight is constant, which leads to the situation that the BAS algorithm will remain in the same number of iterations of global search and local development. This algorithm may not be able to obtain the optimal solution.For this problem of linear decreasing inertia weight may not be able to obtain the optimal solution, this study introduced three kinds of weight of inconstant change rate, namely, inertia weight by random distribution, inertia weight by versoria distribution, and inertia weight by normal distribution into position update of BAS. The improvement in inertia weight can avoid the situation that beetle is stuck in global search and local development in the process of optimization and improves the problem that the BAS algorithm is easy to fall into local optimum in the case of high-dimensional and multimodal function. At the same time, the idea of randomness is introduced in the step-size updating process to further enhance adaptability for complex problems. The main contributions of this study are as follows: (1) the inertia weight by random distribution, inertia weight by versoria distribution, and inertia weight by normal distribution are proposed to improve the search performance of BAS. (2) The randomness is introduced to improve the BAS step attenuation process.The structure of this study is as follows. The second section reviews the traditional BAS algorithm. The third section introduces the BAS algorithm based on improved inertia weight and attenuation factor. In the fourth section, the proposed algorithm is simulated and verified by standard test functions. In the fifth section, the proposed algorithm is summarized.


## 2. Brief Introduction of Beetle Antennae Search Algorithm

The BAS is an effective bio-inspired algorithm, which is inspired by the foraging behavior of beetle. The simplified model is shown in Figure1.Figure 1
The simplified model of BAS.The simplified model of beetle was divided into left and right antennae. The distance between the two antennae wasd. The distance between the two antennae and the beetle’s centroid is equal. The BAS algorithm is divided into three steps: searching, comparing, and updating behavior. The searching behavior is responsible for the collection of food smells, and the comparing behavior is responsible for the comparative analysis of the found smells and then selects the side with high smell concentration. Finally, the updating behavior updates the next step of the beetle according to the smell concentration. The specific BAS algorithm steps are as follows.First, the initial value of beetle optimization was definedxj=1, where j is the number of beetle optimization and j=1,2,3,……,J. j represents the total number of beetles searching for optimization. Based on the mechanism of the BAS algorithm, the unit random vector b⟶j is established by(1)b⟶j=rnds,1rnds,1,where rnd· is the random vector and s is the dimension of space. The unit random vector b⟶j and initial position xj=1 of beetle in equation (1) are used to establish left antennae coordinates xjleft and the right antennae coordinates xjright of beetle. The expressions of the right antennae coordinate and the left antennae coordinate of beetle are expressed by(2)xjright=xj+djb⟶j,xjleft=xj−djb⟶j,where xj is the centroid in the j iteration. dj is the distance in the j iteration. The update rules are as follows.(3)dj=dedj−1,where de is the attenuation factor of dj. The value is usually 0.95. According to the beetle detection mechanism, the following position update iterative model is established by(4)xj+1=xj+δjb⟶jsignfxjright−fxjleft,where sign· is the sign function. δj is the step length in j search. The updating rule of beetle step is expressed by(5)δj=δeδj−1,where δe is the attenuation factor of δj. fxjright represents the value of the fitness function of the right antennae. fxjleft represents the value of the fitness function of the right antennae. fxj represents the fitness function.


## 3. Improved Beetle Antennae Search Algorithm Based on Improved Inertia Weight and Attenuation Factor

This section will introduce the improved BAS algorithm, respectively, by whether the change rate of inertia weight regularly changes. The algorithm flowchart of NBAS, RBAS, and VBAS is shown in Figure2.Figure 2
The algorithm flowchart of NBAS, RBAS, and VBAS.


### 3.1. The Improved Bas in Which the Change Rate of Inertia Weight Regularly Changes

This section introduces two different mechanisms according to the change rate of inertia weight. One is the BAS algorithm based on a normal distribution of inertia weight and random attenuation factor. The other is the BAS algorithm based on versoria distribution. The inertia weight of the former is normal distribution, and the inertia weight of the latter is versoria distribution.


#### 3.1.1. Normal Distribution Inertia Weight and Random Attenuation Factor

This section proposes a normal beetle antennae search (NBAS) algorithm based on normal distribution inertia weight and random attenuation factor. The details are as follows.The normal distribution is a kind of continuous random variable probability distribution and a universal distribution. The function formula of normal distribution is as follows.(6)fx=12πθe−x−μ/2θ2,where x is the variable. The central tendency position of normal distribution is described for the mean value μ of normal distribution. The variance of normal distribution θ describes the dispersion degree of normal distribution data distribution.The normal distribution curve is a dynamic curve. It has the advantages of slow attenuation in the early stage, rapid attenuation in the middle stage, and gentle attenuation in the late stage. Due to the slow attenuation in the early stage, the inertia weight of the algorithm is slowly attenuated before reaching a certain number of iterations. It can keep good global search ability for the algorithm.After the middle of the iteration, the inertia weight will rapidly attenuate and lock to the local optimal value. Meanwhile, in the late iteration, the algorithm will slowly attenuate and keep iterating to achieve the strongest local search ability. This search strategy can greatly improve the search performance of BAS.The inertia weight of normal distribution attenuation is expressed as follows.(7)w=wmin+wmax−wmin12πθe−t/tmax/2θ2,where tmax is the maximum number of iterations, t is the current number of iterations, wmax is the maximum inertia weight, and wmin is the minimum inertia weight. According to the beetle detection mechanism, the inertia weight of normal distribution is introduced into BAS to establish a new position update iterative model.(8)xj+1=wxj+δjb⟶jsignfxjright−fxjleft,where the randomness is introduced into the step-size iteration formula is expressed by(9)δj=δnbasδj−1,where δnbas is a random distribution from 0 to 1.


#### 3.1.2. Versoria Distribution Inertia Weight and Random Attenuation Factor

In this section, a versoria beetle antennae search (VBAS) algorithm based on versoria distribution inertial weight and random attenuation factor is proposed.The introduction of versoria distribution can make the weight change rate of the algorithm slow in the early stage of iteration, which is helpful to search for the global optimal solution. In the later stage, the weight change rate of the BAS algorithm is faster, which can improve the local search ability. It is beneficial to improve the speed of BAS and jump out of local optimal solution when dealing with high-dimensional cases. The graph of versoria function is shown in Figure3.Figure 3
The graph of versoria function.In Figure3, OM=2a is the diameter of the circle x2+y2−2ay=0, where a is the radius. It can intersect the line y=2a with point N and the circle with point A by rotating the X-axis θ degrees counterclockwise about the origin O0,0. The paralleling lines of x and y crossing points A and N intersect at P. Then, the track of point P becomes a versoria line from 0° gradually increasing to 180°, where the rectangular coordinate equation of versoria line is as follows:(10)uj=umin+umax−umin2a8a3ηj/ηmax23/3a2+4a2−3,where umin and umax are minimum and maximum of inertia weight. ηmax is the maximum expected number of iterations. If let vj=ηj/ηmax, the expression can be simplified as(11)uj=umin+umax−umin12vj+3−3.The function property of versoria distribution is introduced into the update of beetle position. According to the beetle detection mechanism, the inertial weight distribution of versoria was introduced to establish the following position update iterative model.(12)xj+1=uxj+δjb⟶jsignfxjright−fxjleft.The iterative formula for introducing randomness step size is expressed by(13)δj=δvbasδj−1,where δvbas is a random number between 0 and 1.


### 3.2. The Improved Bas in Which the Change Rate of Inertia Weight Unregularly Changes

In this section, a random beetle antennae search (RBAS) algorithm based on random distribution inertia weight and random attenuation factor is proposed.Introducing random inertia weight can improve the global search performance of the algorithm. Beetle can not only get a large or small weight value at the beginning of operation, but also get a small or large weight value at the later stage of calculation, because of the randomness. When the beetle is near the optimal position, the inertia weight of random distribution can produce a relatively small value, which is beneficial to accelerate the convergence speed of the algorithm. If the random inertia weight takes a large value, the calculation of the adaptive function will get a large value, which is worse than the optimal value. At this time, when the large inertia weight will be eliminated, the algorithm will generate a new inertia weight value. Using the method of random distribution to generate the weight value can also ensure that the algorithm is not prone to the stagnation of adaptive function value in the late iteration. Meanwhile, the random attenuation factor is introduced to improve the global search ability of the algorithm. The formula of random inertia weight is as follows.(14)c=μmin+μmax−μminrand+σrandn,where μmin is the minimum of random inertia weight. μmax is a maximum of random inertia weight. rand· is the random distribution of a random number between 0 and 1, for the normal distribution of random numbers. σ is used to measure the deviation between the random variable weight and mathematical expectation, and the purpose is to control the weight value, which makes the choice of weights that is more advantageous to the direction of change. According to the normal condition, the experimental error obeys the normal distribution. Then, according to the beetle detection mechanism, the inertial random inertia weight is introduced to establish the following position update iterative model:(15)xj+1=cxj+δjb⟶jsignfxjright−fxjleft.The iteration formula of the attenuation factor is expressed by(16)δj=δrbasδj−1,where δrbas is a random number between 0 and 1.


### 3.3. Complexity Analysis of Algorithms

In this subsection, we present an analytical study on the computational complexity of the algorithm. According to the calculation method in [36], N is the number of populations. When the dimension of the optimization problem is K, the computational complexity of this algorithm is as follows.The computational complexity of initial BAS isOK. In the iterative process, the coordinates of two antennae and the fitness function value O2K were calculated, the location of beetle was updated, the fitness value was calculated, and the computational complexity is O2K. The computational complexity of the weight update process is O2K. The computational complexity of NBAS, VBAS, and RBAS is O6K, which is higher than the standard BAS algorithm O4K, and the computational complexity can be approximately OK. The computational complexities of the six algorithms are shown in Table 1.Table 1
The complexity comparison of algorithms.
AlgorithmBASWSBASPSONBASVBASRBASComputational complexityOKOKONK+N2OKOKOK


## 3.1. The Improved Bas in Which the Change Rate of Inertia Weight Regularly Changes

This section introduces two different mechanisms according to the change rate of inertia weight. One is the BAS algorithm based on a normal distribution of inertia weight and random attenuation factor. The other is the BAS algorithm based on versoria distribution. The inertia weight of the former is normal distribution, and the inertia weight of the latter is versoria distribution.


### 3.1.1. Normal Distribution Inertia Weight and Random Attenuation Factor

This section proposes a normal beetle antennae search (NBAS) algorithm based on normal distribution inertia weight and random attenuation factor. The details are as follows.The normal distribution is a kind of continuous random variable probability distribution and a universal distribution. The function formula of normal distribution is as follows.(6)fx=12πθe−x−μ/2θ2,where x is the variable. The central tendency position of normal distribution is described for the mean value μ of normal distribution. The variance of normal distribution θ describes the dispersion degree of normal distribution data distribution.The normal distribution curve is a dynamic curve. It has the advantages of slow attenuation in the early stage, rapid attenuation in the middle stage, and gentle attenuation in the late stage. Due to the slow attenuation in the early stage, the inertia weight of the algorithm is slowly attenuated before reaching a certain number of iterations. It can keep good global search ability for the algorithm.After the middle of the iteration, the inertia weight will rapidly attenuate and lock to the local optimal value. Meanwhile, in the late iteration, the algorithm will slowly attenuate and keep iterating to achieve the strongest local search ability. This search strategy can greatly improve the search performance of BAS.The inertia weight of normal distribution attenuation is expressed as follows.(7)w=wmin+wmax−wmin12πθe−t/tmax/2θ2,where tmax is the maximum number of iterations, t is the current number of iterations, wmax is the maximum inertia weight, and wmin is the minimum inertia weight. According to the beetle detection mechanism, the inertia weight of normal distribution is introduced into BAS to establish a new position update iterative model.(8)xj+1=wxj+δjb⟶jsignfxjright−fxjleft,where the randomness is introduced into the step-size iteration formula is expressed by(9)δj=δnbasδj−1,where δnbas is a random distribution from 0 to 1.


### 3.1.2. Versoria Distribution Inertia Weight and Random Attenuation Factor

In this section, a versoria beetle antennae search (VBAS) algorithm based on versoria distribution inertial weight and random attenuation factor is proposed.The introduction of versoria distribution can make the weight change rate of the algorithm slow in the early stage of iteration, which is helpful to search for the global optimal solution. In the later stage, the weight change rate of the BAS algorithm is faster, which can improve the local search ability. It is beneficial to improve the speed of BAS and jump out of local optimal solution when dealing with high-dimensional cases. The graph of versoria function is shown in Figure3.Figure 3
The graph of versoria function.In Figure3, OM=2a is the diameter of the circle x2+y2−2ay=0, where a is the radius. It can intersect the line y=2a with point N and the circle with point A by rotating the X-axis θ degrees counterclockwise about the origin O0,0. The paralleling lines of x and y crossing points A and N intersect at P. Then, the track of point P becomes a versoria line from 0° gradually increasing to 180°, where the rectangular coordinate equation of versoria line is as follows:(10)uj=umin+umax−umin2a8a3ηj/ηmax23/3a2+4a2−3,where umin and umax are minimum and maximum of inertia weight. ηmax is the maximum expected number of iterations. If let vj=ηj/ηmax, the expression can be simplified as(11)uj=umin+umax−umin12vj+3−3.The function property of versoria distribution is introduced into the update of beetle position. According to the beetle detection mechanism, the inertial weight distribution of versoria was introduced to establish the following position update iterative model.(12)xj+1=uxj+δjb⟶jsignfxjright−fxjleft.The iterative formula for introducing randomness step size is expressed by(13)δj=δvbasδj−1,where δvbas is a random number between 0 and 1.


## 3.1.1. Normal Distribution Inertia Weight and Random Attenuation Factor

This section proposes a normal beetle antennae search (NBAS) algorithm based on normal distribution inertia weight and random attenuation factor. The details are as follows.The normal distribution is a kind of continuous random variable probability distribution and a universal distribution. The function formula of normal distribution is as follows.(6)fx=12πθe−x−μ/2θ2,where x is the variable. The central tendency position of normal distribution is described for the mean value μ of normal distribution. The variance of normal distribution θ describes the dispersion degree of normal distribution data distribution.The normal distribution curve is a dynamic curve. It has the advantages of slow attenuation in the early stage, rapid attenuation in the middle stage, and gentle attenuation in the late stage. Due to the slow attenuation in the early stage, the inertia weight of the algorithm is slowly attenuated before reaching a certain number of iterations. It can keep good global search ability for the algorithm.After the middle of the iteration, the inertia weight will rapidly attenuate and lock to the local optimal value. Meanwhile, in the late iteration, the algorithm will slowly attenuate and keep iterating to achieve the strongest local search ability. This search strategy can greatly improve the search performance of BAS.The inertia weight of normal distribution attenuation is expressed as follows.(7)w=wmin+wmax−wmin12πθe−t/tmax/2θ2,where tmax is the maximum number of iterations, t is the current number of iterations, wmax is the maximum inertia weight, and wmin is the minimum inertia weight. According to the beetle detection mechanism, the inertia weight of normal distribution is introduced into BAS to establish a new position update iterative model.(8)xj+1=wxj+δjb⟶jsignfxjright−fxjleft,where the randomness is introduced into the step-size iteration formula is expressed by(9)δj=δnbasδj−1,where δnbas is a random distribution from 0 to 1.


## 3.1.2. Versoria Distribution Inertia Weight and Random Attenuation Factor

In this section, a versoria beetle antennae search (VBAS) algorithm based on versoria distribution inertial weight and random attenuation factor is proposed.The introduction of versoria distribution can make the weight change rate of the algorithm slow in the early stage of iteration, which is helpful to search for the global optimal solution. In the later stage, the weight change rate of the BAS algorithm is faster, which can improve the local search ability. It is beneficial to improve the speed of BAS and jump out of local optimal solution when dealing with high-dimensional cases. The graph of versoria function is shown in Figure3.Figure 3
The graph of versoria function.In Figure3, OM=2a is the diameter of the circle x2+y2−2ay=0, where a is the radius. It can intersect the line y=2a with point N and the circle with point A by rotating the X-axis θ degrees counterclockwise about the origin O0,0. The paralleling lines of x and y crossing points A and N intersect at P. Then, the track of point P becomes a versoria line from 0° gradually increasing to 180°, where the rectangular coordinate equation of versoria line is as follows:(10)uj=umin+umax−umin2a8a3ηj/ηmax23/3a2+4a2−3,where umin and umax are minimum and maximum of inertia weight. ηmax is the maximum expected number of iterations. If let vj=ηj/ηmax, the expression can be simplified as(11)uj=umin+umax−umin12vj+3−3.The function property of versoria distribution is introduced into the update of beetle position. According to the beetle detection mechanism, the inertial weight distribution of versoria was introduced to establish the following position update iterative model.(12)xj+1=uxj+δjb⟶jsignfxjright−fxjleft.The iterative formula for introducing randomness step size is expressed by(13)δj=δvbasδj−1,where δvbas is a random number between 0 and 1.


## 3.2. The Improved Bas in Which the Change Rate of Inertia Weight Unregularly Changes

In this section, a random beetle antennae search (RBAS) algorithm based on random distribution inertia weight and random attenuation factor is proposed.Introducing random inertia weight can improve the global search performance of the algorithm. Beetle can not only get a large or small weight value at the beginning of operation, but also get a small or large weight value at the later stage of calculation, because of the randomness. When the beetle is near the optimal position, the inertia weight of random distribution can produce a relatively small value, which is beneficial to accelerate the convergence speed of the algorithm. If the random inertia weight takes a large value, the calculation of the adaptive function will get a large value, which is worse than the optimal value. At this time, when the large inertia weight will be eliminated, the algorithm will generate a new inertia weight value. Using the method of random distribution to generate the weight value can also ensure that the algorithm is not prone to the stagnation of adaptive function value in the late iteration. Meanwhile, the random attenuation factor is introduced to improve the global search ability of the algorithm. The formula of random inertia weight is as follows.(14)c=μmin+μmax−μminrand+σrandn,where μmin is the minimum of random inertia weight. μmax is a maximum of random inertia weight. rand· is the random distribution of a random number between 0 and 1, for the normal distribution of random numbers. σ is used to measure the deviation between the random variable weight and mathematical expectation, and the purpose is to control the weight value, which makes the choice of weights that is more advantageous to the direction of change. According to the normal condition, the experimental error obeys the normal distribution. Then, according to the beetle detection mechanism, the inertial random inertia weight is introduced to establish the following position update iterative model:(15)xj+1=cxj+δjb⟶jsignfxjright−fxjleft.The iteration formula of the attenuation factor is expressed by(16)δj=δrbasδj−1,where δrbas is a random number between 0 and 1.


## 3.3. Complexity Analysis of Algorithms

In this subsection, we present an analytical study on the computational complexity of the algorithm. According to the calculation method in [36], N is the number of populations. When the dimension of the optimization problem is K, the computational complexity of this algorithm is as follows.The computational complexity of initial BAS isOK. In the iterative process, the coordinates of two antennae and the fitness function value O2K were calculated, the location of beetle was updated, the fitness value was calculated, and the computational complexity is O2K. The computational complexity of the weight update process is O2K. The computational complexity of NBAS, VBAS, and RBAS is O6K, which is higher than the standard BAS algorithm O4K, and the computational complexity can be approximately OK. The computational complexities of the six algorithms are shown in Table 1.Table 1
The complexity comparison of algorithms.
AlgorithmBASWSBASPSONBASVBASRBASComputational complexityOKOKONK+N2OKOKOK


## 4. Function Experiments

In order to prove the effectiveness of the algorithm, the proposed algorithm was compared with beetle antennae search algorithm with the linearly decreasing inertia weight (WSBAS), particle swarm optimization (PSO) algorithm, and BAS through standard test functions. The optimal convergence value, average convergence value, and standard deviation were analyzed. The optimization ability of functions in two-dimensional, fifty-dimensional, and one hundred-dimensional cases are compared. The simulation environment is Windows10 operating system. The programming language environment is MATLAB R2016b. The hardware environment is Intel Core i5-8250u Processor. The main frequency is 1.8 GHz, and the RAM is 4 GB.The search scope and the optimal value of the standard test function search scope and the optimal value are shown in Table2. The function expression is shown as follows.Table 2
The standard test function search range and optimal value.
The function numberFunctionSearch scopeOptimal value locationThe optimal valuef1Ackley−32.768,32.7680,……,00f2Griewank−600,6000,……,00f3Rastrigin−5.12,5.120,……,00f4Rotated hyperellipsoid−65.536,65.5360,……,00f5Sphere−5.12,5.120,……,00f6Sum squares−10,100,……,00f7Zakharov−5,100,……,00f8Bohachevsky−100,1000,……,00f9Schaffer−100,1000,……,00f10Sum of different powers−1,10,……,00The Ackley function is expressed as(17)f1x=−aexp−b1d∑i=1dxi2−exp−1d∑i=1dcoscxi+exp1,where the variable values are chosen as a=20, b=0.2, and c=2π.The Griewank function is expressed as(18)f2x=∑i=1nxi24000−∏i=1dcosxii+1.The Rastrigin function is expressed as(19)f3x=10d+∑i=1dxi2−10cos2πxi.The rotated hyperellipsoid function is expressed as(20)f4x=∑i=1n∑j=1ixj2.The Sphere function is expressed as(21)f5x=∑i=1dxi2.The sum squares function is expressed as(22)f6x=∑i=1dixi2.The Zakharov function is expressed as(23)f7x=∑i=1dxi2+∑i=1d0.5ixi2+∑i=1d0.5ixi4.The Bohachevsky function is expressed as(24)f8x=x12+2x22−0.3cos3πx1−0.4cos4πx2+0.7.The Schaffer function is expressed as(25)f9x=0.5+sin2x12−x22−0.51+0.001x12+x222.The sum of different powers function is expressed as(26)f10x=∑i=1dxi+1.In this study, the simulation results of the algorithm from three aspects of two dimensions, fifty dimensions, and one hundred dimensions are as follows. The values of parameters are as follows. The number of iterations is 100. The maximum inertia weight of the proposed algorithm is 0.9, and the minimum inertia weight is 0.4. Other values are chosen as the same as literature [35]. The number of particles is 100, and the learning factors are all 1.5. Each algorithm is independently run 10000 times.


### 4.1. Analysis of Two-Dimensional Simulation Results

The comparison of function optimization results in 2 dimensions is shown in Figures4–13. The comparison of function optimization results in two dimensions is shown in Table 3. The simulation results show that the algorithms of NBAS, RBAS, and VBAS proposed in this study are superior to the algorithms of BAS, PSO, and WSBAS in terms of optimal convergence value, average convergence value, and standard deviation under 10000 times Monte Carlo experiments. The optimal convergence values satisfied RBAS < VBAS < WSB-AS < PSO < BAS or NBAS < VBAS < WSBAS < PSO < BAS, and the performance of algorithm RBAS and algorithm NBAS is similar. The average convergence values are similar to the optimal convergence value, which is satisfied by RBAS < V-BAS < WSBAS < PSO < BAS or NBAS < VBAS < WSBAS < PS-O < BAS. The performance of RBAS is better than NBAS. In terms of standard deviation, the algorithm proposed in this study is smaller, which shows that the improved BAS algorithm proposed is superior to the original BAS, WSBAS, and PSO algorithms in both iteration accuracy and overall stability when dealing with two-dimensional functions.Figure 4
The Ackley function comparison diagram.Figure 5
The Griewank function comparison diagram.Figure 6
The Rastrigin function comparison diagram.Table 3
The comparison of two-dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin1.97E + 011.58E-041.82E-044.44E-158.32E-161.27E-11Mean1.65E + 019.50E-033.06E-015.27E-157.20E-155.60E-11Std5.48E + 002.34E-031.26E + 001.67E-159.19E-123.78E-12Griewank functionfmin7.40E-035.12E-061.16E-07000Mean5.69E + 013.38E-065.94E-02000Std3.88E + 011.63E-063.47E-01000Rastrigin functionfmin1.47E-032.03E-043.36E-08000Mean4.51E + 002.36E-031.62E-01000Std4.54E + 008.96E-044.17E-01000Rotated hyperellipsoid functionfmin3.69E-061.39E-058.48E-118.91E-323.30E-523.60E-24Mean2.36E + 031.45E-053.12E-011.73E-302.12E-407.22E-23Std2.02E + 037.11E-062.61E + 001.27E-302.83E-395.15E-23Sphere functionfmin7.30E-061.29E-057.98E-108.56E-334.26E-633.62E-26Mean3.55E-021.11E-057.55E-033.61E-332.02E-371.98E-25Std1.53E-014.78E-064.89E-023.87E-332.85E-361.68E-25Sum squares functionfmin9.18E + 064.50E-035.43E + 02000Mean1.21E + 075.64E-038.03E + 02000Std1.17E + 064.68E-042.40E + 02000Zakharov functionfmin4.08E + 009.54E-068.58E-113.38E-363.13E-807.12E-28Mean3.38E + 002.23E-052.06E-021.96E-321.90E-411.08E-24Std7.50E + 008.28E-061.07E-012.33E-322.01E-401.12E-24Bohachevsky functionfmin2.10E-012.03E-057.49E-08000Mean7.21E + 022.52E-042.33E + 00000Std5.65E + 031.09E-042.07E + 01000Schaffer functionfmin9.20E-023.23E-117.86E-13000Mean4.57E-013.87E-097.13E-03000Std7.99E-023.83E-093.82E-02000Sum of different powers functionfmin6.45E-102.87E-092.07E-121.98E-404.73E-814.84E-32Mean7.30E-074.50E-071.40E-042.26E-343.89E-426.27E-27Std1.45E-064.50E-077.53E-044.14E-345.48E-419.65E-27Figure 7
The rotated hyperellipsoid function comparison diagram.Figure 8
The sphere function comparison diagram.Figure 9
The sum squares function comparison diagram.Figure 10
The Zakharov comparison diagram.Figure 11
The Bohachevsky function comparison diagram.Figure 12
The Schaffer function comparison diagram.Figure 13
The sum squares function comparison diagram.


### 4.2. Analysis of Fifty-Dimensional Simulation Results

The comparison of function optimization results in 50 dimensions is shown in Figures14–23. The comparison of function optimization results in 50 dimensions is shown in Table 4. The simulation results show that the optimal convergence value, average convergence value, and standard deviation of the algorithms of NBAS, VBAS, and RBAS proposed in this study are RBAS. The results show that the proposed algorithm has better searching performance and stability in the case of fifty dimensions.Figure 14
The Ackley function comparison diagram.Figure 15
The Griewank function comparison diagram.Figure 16
The Rastrigin function comparison diagram.Figure 17
The rotated hyperellipsoid function comparison diagram.Table 4
The comparison of fifty-dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin2.09E + 013.12E-038.55E + 004.44E-158.88E-161.06E-11Mean2.08E + 013.02E-031.16E + 013.41E-157.68E-161.06E-11Std1.36E-011.60E-042.78E + 00006.46E-13Griewank functionfmin1.08E + 037.68E-071.95E + 00000Mean1.50E + 031.05E-065.19E + 01000Std1.77E + 022.14E-071.23E + 02000Rastrigin functionfmin5.56E + 026.56E-032.14E + 02000Mean7.43E + 025.58E-033.62E + 02000Std6.45E + 015.95E-041.35E + 02000Rotated hyperellipsoid functionfmin1.20E + 064.42E-044.51E + 036.15E-288.71E-834.03E-35Mean1.81E + 066.79E-045.18E + 049.34E-282.06E-362.87E-24Std2.73E + 051.02E-041.27E + 051.41E-283.65E-205.51E-21Sphere functionfmin3.66E + 022.65E-053.51E + 002.04E-311.37E-649.48E-26Mean3.87E + 022.81E-053.00E + 012.14E-311.89E-378.44E-24Std4.91E + 013.02E-065.45E-012.68E-322.26E-361.04E-24Sum squares functionfmin7.17E + 047.82E-047.85E + 025.62E-299.61E-872.35E-21Mean7.29E + 047.05E-042.69E + 035.66E-291.52E-432.38E-21Std4.10E + 029.45E-054.21E + 036.13E-309.87E-436.68E-23Zakharov functionfmin3.99E-079.42E-102.52E-107.82E-355.82E-813.31E-28Mean7.08E + 021.62E-073.32E-023.79E-323.57E-421.64E-24Std1.88E + 021.74E-071.72E-013.42E-324.89E-411.46E-24Bohachevsky functionfmin2.04E + 012.31E-092.30E-08000Mean9.00E + 032.19E-064.32E-01000Std6.73E + 031.86E-063.58E + 00000Schaffer functionfmin4.29E-039.01E-143.59E-13000Mean4.63E-011.08E-104.04E-03000Std7.50E-029.71E-112.92E-02000Sum of different powers functionfmin1.34E-011.29E-124.07E-063.18E-417.11E-823.39E-31Mean2.10E + 007.53E-095.80E-029.84E-355.53E-456.27E-27Std1.23E + 009.41E-091.75E + 001.29E-347.13E-445.95E-27Figure 18
The sphere function comparison diagram.Figure 19
The sum squares function comparison diagram.Figure 20
The Zakharov comparison diagram.Figure 21
The Bohachevsky function comparison diagram.Figure 22
The Schaffer function comparison diagram.Figure 23
The sum squares function comparison diagram.The simulation results show that the comparison of optimal convergence value, average convergence value, and standard deviation of NBAS, VBAS, and RBAS proposed in this study is RBAS < VBAS < WSBAS < PSO < BAS or NBA-S < VBAS < WSBAS < PSO < BAS, which indicates that the proposed algorithm has better optimization performance and algorithm stability in the case of fifty dimensions.


### 4.3. Analysis of One Hundred-Dimensional Simulation Results

The comparison of function optimization results in one hundred dimensions is shown in Figures24–33. The comparison of function optimization results in 100 dimensions is shown in Table 5. The simulation results show thatthe optimal convergence value, average convergence value, and standard deviation of NBAS, IBAS, and VBAS algorithms proposed in this study are still RBAS < VBAS < WSBAS < PS-O < BAS or NBAS < VBAS < WSBAS < PSO < BAS in the case of 100 dimensions. It is shown that the proposed algorithm can maintain good performance even in the case of high dimensions. It will not fall into the local optimum, and the iteration accuracy will be higher in the same number of iterations.Figure 24
The Ackley function comparison diagram.Figure 25
The Griewank function comparison diagram.Figure 26
The Rastrigin function comparison diagram.Figure 27
The rotated hyperellipsoid function comparison diagram.Figure 28
The sphere function comparison diagram.Table 5
The comparison of one hundred dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin2.68E + 002.02E-031.19E-045.78E-168.01E-162.53E-13Mean2.10E + 012.15E-031.45E + 014.14E-158.22E-161.07E-11Std1.00E-018.33E-051.69E + 003.10E-157.53E-144.82E-13Griewank functionfmin3.05E + 035.81E-074.51E + 01000Mean2.99E + 036.29E-071.72E + 02000Std3.03E + 021.19E-072.66E + 02000Rastrigin functionfmin9.18E + 064.50E-035.43E + 02000Mean1.21E + 075.64E-038.03E +  02000Std1.17E + 064.69E-042.40E + 02000Rotated hyperellipsoid functionfmin4.28E + 061.03E-031.13E + 054.15E-283.40E-431.02E-19Mean7.08E + 061.40E-034.18E + 053.64E-271.85E-331.42E-19Std6.97E + 051.33E-046.29E + 053.59E-282.58E-321.40E-20Sphere functionfmin8.78E + 022.76E-052.36E + 015.71E-331.40E-533.79E-25Mean8.20E + 022.85E-051.00E + 024.35E-311.97E-381.71E-23Std7.44E + 012.20E-061.13E + 023.90E-322.29E-371.51E-24Sum squares functionfmin3.44E + 051.13E-036.14E + 031.56E-286.85E-729.05E-21Mean3.46E + 051.44E-031.50E + 042.35E-287.83E-369.62E-21Std8.47E + 021.27E-041.74E + 041.48E-291.02E-341.65E-22Zakharov functionfmin2.46E-052.04E-103.65E-12746E-341.68E-813.37E-26Mean1.32E + 038.74E-081.68E-024.03E-327.90E-401.68E-24Std3.26E + 027.87E-081.15E-013.93E-321.01E-381.61E-24Bohachevsky functionfmin6.04E + 012.24E-088.49E-09000Mean9.03E + 031.23E-061.28E + 00000Std5.89E + 031.12E-061.17E + 01000Schaffer functionfmin7.01E-032.98E-131.11E-12000Mean4.64E-015.16E-112.99E-03000Std7.65E-025.10E-112.21E-02000Sum of different powers functionfmin4.14E-013.01E-121.92E-041.23E-395.48E-784.02E-30Mean3.20E + 002.83E-099.36E-021.10E-342.99E-346.14E-27Std1.41E + 003.83E-091.79E-011.37E-344.23E-335.98E-27Figure 29
The sum squares function comparison diagram.Figure 30
The Zakharov comparison diagram.Figure 31
The Bohachevsky function comparison diagram.Figure 32
The Schaffer function comparison diagram.Figure 33
The sum squares function comparison diagram.


## 4.1. Analysis of Two-Dimensional Simulation Results

The comparison of function optimization results in 2 dimensions is shown in Figures4–13. The comparison of function optimization results in two dimensions is shown in Table 3. The simulation results show that the algorithms of NBAS, RBAS, and VBAS proposed in this study are superior to the algorithms of BAS, PSO, and WSBAS in terms of optimal convergence value, average convergence value, and standard deviation under 10000 times Monte Carlo experiments. The optimal convergence values satisfied RBAS < VBAS < WSB-AS < PSO < BAS or NBAS < VBAS < WSBAS < PSO < BAS, and the performance of algorithm RBAS and algorithm NBAS is similar. The average convergence values are similar to the optimal convergence value, which is satisfied by RBAS < V-BAS < WSBAS < PSO < BAS or NBAS < VBAS < WSBAS < PS-O < BAS. The performance of RBAS is better than NBAS. In terms of standard deviation, the algorithm proposed in this study is smaller, which shows that the improved BAS algorithm proposed is superior to the original BAS, WSBAS, and PSO algorithms in both iteration accuracy and overall stability when dealing with two-dimensional functions.Figure 4
The Ackley function comparison diagram.Figure 5
The Griewank function comparison diagram.Figure 6
The Rastrigin function comparison diagram.Table 3
The comparison of two-dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin1.97E + 011.58E-041.82E-044.44E-158.32E-161.27E-11Mean1.65E + 019.50E-033.06E-015.27E-157.20E-155.60E-11Std5.48E + 002.34E-031.26E + 001.67E-159.19E-123.78E-12Griewank functionfmin7.40E-035.12E-061.16E-07000Mean5.69E + 013.38E-065.94E-02000Std3.88E + 011.63E-063.47E-01000Rastrigin functionfmin1.47E-032.03E-043.36E-08000Mean4.51E + 002.36E-031.62E-01000Std4.54E + 008.96E-044.17E-01000Rotated hyperellipsoid functionfmin3.69E-061.39E-058.48E-118.91E-323.30E-523.60E-24Mean2.36E + 031.45E-053.12E-011.73E-302.12E-407.22E-23Std2.02E + 037.11E-062.61E + 001.27E-302.83E-395.15E-23Sphere functionfmin7.30E-061.29E-057.98E-108.56E-334.26E-633.62E-26Mean3.55E-021.11E-057.55E-033.61E-332.02E-371.98E-25Std1.53E-014.78E-064.89E-023.87E-332.85E-361.68E-25Sum squares functionfmin9.18E + 064.50E-035.43E + 02000Mean1.21E + 075.64E-038.03E + 02000Std1.17E + 064.68E-042.40E + 02000Zakharov functionfmin4.08E + 009.54E-068.58E-113.38E-363.13E-807.12E-28Mean3.38E + 002.23E-052.06E-021.96E-321.90E-411.08E-24Std7.50E + 008.28E-061.07E-012.33E-322.01E-401.12E-24Bohachevsky functionfmin2.10E-012.03E-057.49E-08000Mean7.21E + 022.52E-042.33E + 00000Std5.65E + 031.09E-042.07E + 01000Schaffer functionfmin9.20E-023.23E-117.86E-13000Mean4.57E-013.87E-097.13E-03000Std7.99E-023.83E-093.82E-02000Sum of different powers functionfmin6.45E-102.87E-092.07E-121.98E-404.73E-814.84E-32Mean7.30E-074.50E-071.40E-042.26E-343.89E-426.27E-27Std1.45E-064.50E-077.53E-044.14E-345.48E-419.65E-27Figure 7
The rotated hyperellipsoid function comparison diagram.Figure 8
The sphere function comparison diagram.Figure 9
The sum squares function comparison diagram.Figure 10
The Zakharov comparison diagram.Figure 11
The Bohachevsky function comparison diagram.Figure 12
The Schaffer function comparison diagram.Figure 13
The sum squares function comparison diagram.


## 4.2. Analysis of Fifty-Dimensional Simulation Results

The comparison of function optimization results in 50 dimensions is shown in Figures14–23. The comparison of function optimization results in 50 dimensions is shown in Table 4. The simulation results show that the optimal convergence value, average convergence value, and standard deviation of the algorithms of NBAS, VBAS, and RBAS proposed in this study are RBAS. The results show that the proposed algorithm has better searching performance and stability in the case of fifty dimensions.Figure 14
The Ackley function comparison diagram.Figure 15
The Griewank function comparison diagram.Figure 16
The Rastrigin function comparison diagram.Figure 17
The rotated hyperellipsoid function comparison diagram.Table 4
The comparison of fifty-dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin2.09E + 013.12E-038.55E + 004.44E-158.88E-161.06E-11Mean2.08E + 013.02E-031.16E + 013.41E-157.68E-161.06E-11Std1.36E-011.60E-042.78E + 00006.46E-13Griewank functionfmin1.08E + 037.68E-071.95E + 00000Mean1.50E + 031.05E-065.19E + 01000Std1.77E + 022.14E-071.23E + 02000Rastrigin functionfmin5.56E + 026.56E-032.14E + 02000Mean7.43E + 025.58E-033.62E + 02000Std6.45E + 015.95E-041.35E + 02000Rotated hyperellipsoid functionfmin1.20E + 064.42E-044.51E + 036.15E-288.71E-834.03E-35Mean1.81E + 066.79E-045.18E + 049.34E-282.06E-362.87E-24Std2.73E + 051.02E-041.27E + 051.41E-283.65E-205.51E-21Sphere functionfmin3.66E + 022.65E-053.51E + 002.04E-311.37E-649.48E-26Mean3.87E + 022.81E-053.00E + 012.14E-311.89E-378.44E-24Std4.91E + 013.02E-065.45E-012.68E-322.26E-361.04E-24Sum squares functionfmin7.17E + 047.82E-047.85E + 025.62E-299.61E-872.35E-21Mean7.29E + 047.05E-042.69E + 035.66E-291.52E-432.38E-21Std4.10E + 029.45E-054.21E + 036.13E-309.87E-436.68E-23Zakharov functionfmin3.99E-079.42E-102.52E-107.82E-355.82E-813.31E-28Mean7.08E + 021.62E-073.32E-023.79E-323.57E-421.64E-24Std1.88E + 021.74E-071.72E-013.42E-324.89E-411.46E-24Bohachevsky functionfmin2.04E + 012.31E-092.30E-08000Mean9.00E + 032.19E-064.32E-01000Std6.73E + 031.86E-063.58E + 00000Schaffer functionfmin4.29E-039.01E-143.59E-13000Mean4.63E-011.08E-104.04E-03000Std7.50E-029.71E-112.92E-02000Sum of different powers functionfmin1.34E-011.29E-124.07E-063.18E-417.11E-823.39E-31Mean2.10E + 007.53E-095.80E-029.84E-355.53E-456.27E-27Std1.23E + 009.41E-091.75E + 001.29E-347.13E-445.95E-27Figure 18
The sphere function comparison diagram.Figure 19
The sum squares function comparison diagram.Figure 20
The Zakharov comparison diagram.Figure 21
The Bohachevsky function comparison diagram.Figure 22
The Schaffer function comparison diagram.Figure 23
The sum squares function comparison diagram.The simulation results show that the comparison of optimal convergence value, average convergence value, and standard deviation of NBAS, VBAS, and RBAS proposed in this study is RBAS < VBAS < WSBAS < PSO < BAS or NBA-S < VBAS < WSBAS < PSO < BAS, which indicates that the proposed algorithm has better optimization performance and algorithm stability in the case of fifty dimensions.


## 4.3. Analysis of One Hundred-Dimensional Simulation Results

The comparison of function optimization results in one hundred dimensions is shown in Figures24–33. The comparison of function optimization results in 100 dimensions is shown in Table 5. The simulation results show thatthe optimal convergence value, average convergence value, and standard deviation of NBAS, IBAS, and VBAS algorithms proposed in this study are still RBAS < VBAS < WSBAS < PS-O < BAS or NBAS < VBAS < WSBAS < PSO < BAS in the case of 100 dimensions. It is shown that the proposed algorithm can maintain good performance even in the case of high dimensions. It will not fall into the local optimum, and the iteration accuracy will be higher in the same number of iterations.Figure 24
The Ackley function comparison diagram.Figure 25
The Griewank function comparison diagram.Figure 26
The Rastrigin function comparison diagram.Figure 27
The rotated hyperellipsoid function comparison diagram.Figure 28
The sphere function comparison diagram.Table 5
The comparison of one hundred dimensional function optimization results.
The name of functionIndexBASWABASPSONBASRBASVBASAckley functionfmin2.68E + 002.02E-031.19E-045.78E-168.01E-162.53E-13Mean2.10E + 012.15E-031.45E + 014.14E-158.22E-161.07E-11Std1.00E-018.33E-051.69E + 003.10E-157.53E-144.82E-13Griewank functionfmin3.05E + 035.81E-074.51E + 01000Mean2.99E + 036.29E-071.72E + 02000Std3.03E + 021.19E-072.66E + 02000Rastrigin functionfmin9.18E + 064.50E-035.43E + 02000Mean1.21E + 075.64E-038.03E +  02000Std1.17E + 064.69E-042.40E + 02000Rotated hyperellipsoid functionfmin4.28E + 061.03E-031.13E + 054.15E-283.40E-431.02E-19Mean7.08E + 061.40E-034.18E + 053.64E-271.85E-331.42E-19Std6.97E + 051.33E-046.29E + 053.59E-282.58E-321.40E-20Sphere functionfmin8.78E + 022.76E-052.36E + 015.71E-331.40E-533.79E-25Mean8.20E + 022.85E-051.00E + 024.35E-311.97E-381.71E-23Std7.44E + 012.20E-061.13E + 023.90E-322.29E-371.51E-24Sum squares functionfmin3.44E + 051.13E-036.14E + 031.56E-286.85E-729.05E-21Mean3.46E + 051.44E-031.50E + 042.35E-287.83E-369.62E-21Std8.47E + 021.27E-041.74E + 041.48E-291.02E-341.65E-22Zakharov functionfmin2.46E-052.04E-103.65E-12746E-341.68E-813.37E-26Mean1.32E + 038.74E-081.68E-024.03E-327.90E-401.68E-24Std3.26E + 027.87E-081.15E-013.93E-321.01E-381.61E-24Bohachevsky functionfmin6.04E + 012.24E-088.49E-09000Mean9.03E + 031.23E-061.28E + 00000Std5.89E + 031.12E-061.17E + 01000Schaffer functionfmin7.01E-032.98E-131.11E-12000Mean4.64E-015.16E-112.99E-03000Std7.65E-025.10E-112.21E-02000Sum of different powers functionfmin4.14E-013.01E-121.92E-041.23E-395.48E-784.02E-30Mean3.20E + 002.83E-099.36E-021.10E-342.99E-346.14E-27Std1.41E + 003.83E-091.79E-011.37E-344.23E-335.98E-27Figure 29
The sum squares function comparison diagram.Figure 30
The Zakharov comparison diagram.Figure 31
The Bohachevsky function comparison diagram.Figure 32
The Schaffer function comparison diagram.Figure 33
The sum squares function comparison diagram.


## 5. Conclusions

In this study, the BAS algorithm based on improved inertia weight and attenuation factor is proposed. The global search ability, convergence speed, and convergence precision of the algorithm are improved by introducing normal distribution attenuation inertia weight, random inertia weight, and versoria distribution and adding a random attenuation factor. Finally, the standard test functions are verified under two dimensions, fifty dimensions, and one hundred dimensions, respectively. Numerical simulation results show that compared with traditional BAS, WSBAS, and PSO, the proposed algorithms have significantly improved the optimal convergence value, average convergence value, and standard deviation.The BAS algorithm has been proposed for a short time, and most of them may only be tested by benchmark functions, with many numerical optimizations and not really applied to practical engineering applications. Although many scholars have applied the BAS algorithm in many fields, the application in each field is not perfect, and there is still a large space for the application and research of the algorithm.



---

*Source: 7391145-2022-07-11.xml*