Sensitivity thermal analysis in the laser-assisted tape placement process

1.   Introduction

The process of selecting appropriate and applicable variable values for a specific task is known as optimization ^[1,2,3]. Optimization exists in almost every domain, including job shop scheduling ^[4], feature selection ^[5,6,7], image processing ^[8,9], face detection and recognition ^[10], predicting chemical activities ^[11], classification ^[12,13], network allocation ^[14], internet of vehicles ^[15], routing ^[16], and neural network ^[17]. Due to the nature of real-world problems, Optimization becomes very challenging and has many difficulties such as multiobjectivity ^[18], memetic optimization ^[19], large-scale optimization ^[20], fuzzy optimization ^[21], uncertainties ^[22] and parameter estimation ^[23]. Metaheuristics algorithms have been used to solve such problems due to their advantages such as flexibility, efficiency and getting a near-optimal solution in a reasonable time.

Examples of metaheuristics algorithms include particle swarm optimization (PSO) ^[24], artificial bee colony ^[25], coot bird ^[26], genetic algorithms (GAs) ^[27], the krill herd algorithm ^[28], the harmony search (HS) algorithm ^[29], the snake optimizer ^[30], monarch butterfly optimization ^[31], the slime mold algorithm ^[32], the moth search algorithm ^[33], the hunger games search ^[34], the Runge-Kutta method ^[35], the weighted mean of vectors ^[36], the virus colony search ^[37], the lightning search algorithm ^[38], ant lion optimization ^[39], the crow search algorithm ^[40], moth-flame optimization ^[41], the wild horse optimizer ^[42], the remora optimization algorithm ^[43], the artificial rabbit Optimizer ^[44], the artificial hummingbird algorithm ^[45], grasshopper optimization algorithm (GOA) ^[46], grey wolf optimizer (GWO) ^[47] and the whale optimization algorithm (WOA) ^[48].

The Aquila optimizer (AO) is the latest developed algorithm proposed by Abualigah et al. ^[49] which simulates the four different phases of Aquila hunting behavior. Wang et al. ^[50] developed an improved version of the AO by replacing AO's original exploitation phase with the Harris hawks optimizer's exploitation phase. Moreover, they embedded a random opposition-learning strategy and nonlinear escaping operator in their proposed algorithm. They argued that the proposed algorithm is able to achieve the best results compared with the other five metaheuristic optimizers. Also, Mahajan et al. ^[51] hybridized the AO with the arithmetic optimization algorithm (AOA) ^[52]. They tested their algorithm which is called AO-AOA with original AO, original AOA, WOA, GOA and GWO. Another hybrid work between AO and AOA has been done by Zhang et al. ^[53]. Likewise, Zhao et al. ^[54] developed another version of the AO called the simplified AO algorithm by removing the control equation of the exploitation and exploration procedures (latter strategies) and keeping the former two techniques. They said their developed algorithm IAO achieved better results than many newly developed swarm algorithms. Another enhancement has been done by Ma et al. ^[55] in which grey wolf optimizer is hybridized using Aquila algorithm that allows some wolves to be able to fly, improving their search techniques, and avoiding getting stuck in local optima. They tested their developed algorithm with many optimizers using 23 functions. Also, Gao et al. ^[56] employed three different strategies to enhance the AO algorithm. These strategies are Gaussian mutation (GM), random-opposition learning, and developing a search control operator. They argued that their algorithm, an improved AO, has superior results compared to other optimizers.

The AO has been successfully used in many applications. For example, AlRassas et al. ^[57] tried to forecast oil production by using the AO to optimize the adaptive neuro-fuzzy inference system model. Also, Abdelaziz et al. ^[58] tried to classify COVID-19 images using the AO algorithm and MobilNet3. Likewise, Fatani et al. ^[59] developed an extraction and selecting approach for features using the AO and deep learning for iot detection intrusion systems.

Despite the powerfulness and superiority of the algorithm, and as stated by the no free lunch theorem, the AO cannot solve all optimization issues. So, the AO still needs more enhancements and developments.

This paper introduces a novel version of the AO in which three different strategies have been used to overcome the original optimizer drawbacks such as getting stuck in local optima and slow convergence. These strategies are the chaotic local search (CLS), opposition-based learning (OBL) and the restart strategy (RS). Using OBL and the RS enhances the AO exploratory search capabilities whereas the CLS improves AO exploitative search abilities.

The main contributions of this paper are as follows:

● A novel Aquila algorithm has been developed using three strategies: OBL, the RS and the CLS.

● The developed optimizer has been compared with the original AO and nine other algorithms, namely, the CSA ^[40], EHO ^[60], GOA ^[46], LSHADE ^[61], Lshade-EpSin ^[62], MFO ^[63], MVO ^[64], and PSO ^[24].

● A scalability test and removing one strategy from the developed algorithm experiments have been carried out.

● mAO was tested using 29 functions and five constrained ones.

This paper is organized as follows: Section 2 discusses the background and preliminaries of the original algorithm, OBL, the CLS and the RS, whereas Section 3 introduces the structure of the modified optimizer and its complexity. Sections 4 and 5 discuss the results of the proposed mAO and other competitors in CEC2017 and five different constrained engineering problems whereas Section 6 concludes the paper.

2.   Preliminaries

2.1.   Aquila optimizer (AO)

Aquila algorithm is one of the latest population-based swarm intelligence optimizers developed by Abualigah et al. ^[49]. Aquila can be considered among the most well-known prey birds existed in north hemisphere. Aquila is brown with a golden back body. Aquila uses its agility and strength with its wide nails and strong feet to catch various types ofprey usually squirrels, rabbits, marmots, and hares ^[65].

Aquila optimizer (AO) simulates the four different Aquila strategies in hunting. The next subsection shows Aquila's mathematical model.

2.2.   Mathematical model

AO begins with a random set of individuals that can be represented mathematically as follows:

where $X$ is an agent position (solution) that can be computed using the following equation:

where $D$ refers to the number of decision variables, $N$ indicates the number of agents, $UB_{j} \ {\rm{ and }}\ LB_{j}$ are the $j^{th}$ upper and lower boundaries, and $x_{i}$ refers to the $i^{th}$ value of the decision variable.

AO simulates Aquila hunting in four different phases where the optimizer can easily move from exploration and exploitation using the following condition:

IF, $\left\{ \begin{array}{ll} t \leq (\frac{2}{3}) \times T & {\rm{Perform\ exploration}}\\ {\rm{Otherwise}} & {\rm{Perform\ exploration}}\\ \end{array}\right.$

2.2.1.   Expanded exploration $(X_{1})$

In this phase, Aquila will determine the area to hunt the prey and select it by a vertical stoop and high soar. The mathematical formula for such a behavior is given by the following two equations:

where $X_{M} (t)$ indicates the mean position in the ith generation, $X_{best}$ is the best Aquila position founded in this iteration, $r$ is a randomly generated number in the interval $[0, 1]$, $t$ is the current generation where $T$ is the maximum generation number, and $N$ is the Aquilas number.

2.2.2.   Narrowed exploration $(X_{2})$

This technique is the most technique used by Aquila for hunting. To attack the prey, a short gliding is used with contour flight. Aquila position's will be updated as follows:

where $X_{R}$ indicates a position of Aquila generated randomly, $rand$ is a random real number between 0 and 1, $D$ is the number of variables, and $Levy$ refers to a lévy function which is presented as follows:

where $s$ is a fixed value and equals 0.01, $u \ {\rm{ and }}\ \mu$ are random numbers between 0 and 1 and $\beta$ is a constant and equals 1.5. Both $y$ and $x$ are used to model the spiral shape and can be computed using the following two equations:

where $r \ {\rm{ and }}\ \theta$ can be calculated as follows:

where $U$ equals 0.00565, $\omega$ equals 0.005, and $r_1$ has a value between 1 and 20.

2.2.3.   Expanded exploitation $(X_{3})$

In the $3^{rd}$ technique, the prey area is determined and agents can vertically perform a preliminary attack with low flight. Agents can attack the prey as follow:

where $X_{M} (t)$ indicates the mean position in the i-th generation, $X_{best}$ is the best Aquila position founded in this iteration, $rand$ is a randomly generated number in the interval $[0, 1]$, $\alpha \ {\rm{ and }}\ \beta$ are exploitation parameters that are equal 0.1, and $UB \ {\rm{ and }}\ LB$ refer to the upper and lower boundaries.

2.2.4.   Narrowed exploitation $(X_{4})$

In this phase, Aquila can easily chase the prey and attack attacks it using escape trajectory light which can be modeled as follows:

where $QF(t)$ is the quality value, $G_{1}$ refers to various AO motions, and $G_{2}$ refers to chasing prey flight slope.

2.3.   Opposition-based learning

Opposition-based learning strategy is a technique introduced by Tizhoosh ^[66] which has been employed by many researchers to improve many swarm optimizers. For example, Hussien ^[67] embedded OBL in SSA to overcome getting trapped in local optima. Moreover, Hussien and Amin used OBL with chaotic local search to improve the exploration abilities of HHO ^[7]. Zhao et al. employed OBL with arithmetic optimization algorithm ^[1]. OBL works by comparing the original solution with its opposite one. Let $x$ is a real number that falls in the interval $[lb, ub]$, then its opposite can be calculated from the following equation:

where $lb \ {\rm{ and }}\ ub$ are lower boundary and upper one respectively, and $\bar{x}$ indicates the opposite solution. If $x$ is a vector that has multi values, then $\bar{x}$ can be computed from the following equation:

where $x_{j}$ indicates the $j^{th}$ value of $x$ and $ub_{j} \ {\rm{ and }}\ lb_{j}$ refer to upper and lower boundaries respectively.

2.4.   Chaotic local search

The chaotic local search (CLS) technique has been integrated with many swarm optimizers such as WOA ^[68], HHO ^[7], brain storm optimization ^[69], and Jaya Algorithm (JAYA) ^[70]. CLS technique is almost used with the logistic map which is given in the following equation:

where $s$ is the number of the current iteration, $C$ is a control parameter that equals 4, $o^{1} \neq$ 0.25, 0.50 and 0.75. Local search is used to search in the neighborhood area of the already founded optimal solution. CLS can be represented by the following equation:

where $Cs$ refers to the value generated by CLS in iteration $i$ and $\grave{C_{i}}$ can be easily calculated as follows:

$\mu$ is a shrinking factor and can be computed from the following below equation:

where $t \ {\rm{ and }}\ T$ refer to the current and maximum number of iterations.

2.5.   Restart strategy

During the search operation, some agents may not be able to find a better location as they may get trapped in local optimum regions. Such agents may affect the overall search as they take many generation resources and don't enhance the search process. Restart strategy (RS) at this point which is proposed by Zhang et al. ^[71] can help worse agents to jump out from local regions. RS counts the number of times for each individual that has been enhanced and updated. So, if the i-th agent has updated, then the trial value will be zero, otherwise, the trial value will be increased by 1. If the trial is equal to a certain threshold, then the individual position will be changed using the following 2 equations:

where $ub \ {\rm{ and }}\ lb$ refer to upper and lower boundaries and $rand$ indicates a random number in the number $[0, 1]$.

3.   Enhanced Aquila optimizer

3.1.   Shortcoming of Aquila algorithm

AO similar to other swarm optimizers may get stagnation in sub-optimal areas and have a slow convergence, especially when addressing and handling complicated & complex problems that have high dimensional features.

3.2.   Architecture of modified AO

Our proposed algorithm which is termed mAO tries to solve the original optimizer limitations. In the proposed mAO, three different strategies are used to improve the classical AO namely: opposition-based Learning, restart strategy, and chaotic local search. OBL strategy is used in both the initialization phase and updating agent position process. OBL is used in initialization by selecting the best $N$ solutions from the pool of $X \cup \bar{x}$ to ensure the algorithm starts with a good set of agents whereas it is embedded in the updating process to improve algorithm exploration abilities. Moreover, a chaotic local search mechanism is used to improve the best solution and existed until now which will lead to the enhancement of the whole individuals. On the other hand, a restart strategy is employed in AO to change the position of the worst individuals if they have already get fallen in local regions. The pseudo-code of the developed optimizer can be seen in algorithm 1.

3.3.   Complexity of mAO

The complexity of the proposed algorithm can be computed by calculating the complexity of each phase separately, i.e., initialization, evaluation, and updating process. So $O({\rm{mAO}}) = O({\rm{Initialization}}) + O({\rm{Evaluation}})$$+ O({\rm{Updating\ Position}}) + O({\rm{CLS + OBL + RS}})$. If $D$ is the number of dimensions, $N$ is the number of individuals, and $T$ is the max iteration number, the following can be obtained.

$O({\rm{Initialization}}) = O(N)$

$O({\rm{Evaluation}}) = O(N \times T)$

$O({\rm{Updating\ Position}}) = O(N \times T \times D)$

$O({\rm{CLS}}) = O(N \times T)$

$O({\rm{OBL}}) = O(N \times T \times D)$

$O({\rm{RS}}) = O(N \times D)$

$O({\rm{CLS + OBL + RS}}) = O(N \times T \times D)$

$O({\rm{mAO}}) = O(N) + O(N \times T)$$+ O(N \times T \times D) + O(N \times T \times D) = O(N \times T \times D)$

4.   Experiments and discussion

4.1.   Parameter setting

To validate our proposed approach, 29 functions from CEC2017 have been used to test mAO performance. These CEC2017 functions are very challenging and contain different types of functions (Unimodal, multimodal, composite, and hybrid). The description of CEC2017 functions is shown in Table 4 where $opt.$ refers to the global optimal value. All experiments have been performed on Matlab 2021b using Intel Corei7 and 8.00 G of RAM. The parameter setting of all experiments is shown in Table 2. mAO is compared with the original Aquila Optimizer and other nine well-known and powerful swarm algorithms namely: crow search algorithm ^[40], elephant herd optimizer ^[60], grasshopper optimization algorithm ^[46], LSHADE ^[61], Lshade-EpSin ^[62], moth-flame optimization ^[63], multi-verse optimization ^[64], and particle swarm algorithm ^[24]. The parameter of each mentioned algorithm is given in Table 3.

4.2.   CEC2017

The developed optimizer and its competitors' results are shown in Table 5 in terms of best (min), worst (mac), mean (average), and standard deviation. From the above-mentioned table, it can be seen that the suggested technique has good results and performs well in solving all functions type. For example, in term of average, it ranked first in all unimodal functions $(F1 \ {\rm{ and }}\ F3)$, and all multimodal functions $(F4 \ {\rm{ and }}\ F10)$. On the other hand, it can be noticed that mAO achieved better results compared to the original optimizer and others. It ranked first in almost functions whereas it ranked first in solving composite problems in 5 functions out of 10. Besides the statistical measures, convergence curve can be seen as a powerful tool to compare any new algorithm with its competitors to see if it has a good convergence or slow one. mAO has been recognized to achieve a fast convergence curve in all mentioned function types as shown in Figures 1–3.

Furthemore, a statistical comparsion using Wilcoxon test ^[72,73] has been carried out between the developed algorithm and all other competitors. Table 6 shows the p-values which show a big diffeence in the outputs between different optimizers. From Table 6, results prove the mAO algorithm superiority in finding near-optimal solutions when compared with others. To show the powerful and efficient of the proposed algorithm, a scalability test has been performed on 10 and 50 dimensions using the same functions and the same comparing algorithms. The results of this scalability test are shown in Table 7. It can be seen that mAO is better than other competitors in almost functions.

To show the powerfulness of our suggested optimizer by intergrating three strategies with AO, we test the standard AO with each operator seperately. Table 8 shows the average and standard deviation of four algorithms: AO with OBL (AOOBL), AO with CLS (AOCLS), AO with RS (AORS), and the developed algorithm mAO that contains AO with CLS, RS, and OBL.

5.   Engineering problems

In this section, the performance of the developed optimizer is tested using many real-world constrained problems which contain many inequalities. These problems are Welded beam design problem, Pressure vessel design problem, Tension/compression spring design problem, Speed reducer design problem, and Three-bar truss design problem. The mathematical formulas for the above problems are existed in ^[68,74,75].

5.1.   Welded beam design problem

The first constrained problem used in this study is welded beam design (WBD) which is proposed by Coello ^[76]. The aim of this problem is to find the minimum welded beam cost and its design structure is shown in Figure 4. WBD has 7 constraints and 4 design variables namely: bar thickness $(b)$, bar height $(t)$, weld thickness $(h)$, and attached bar part length $(l)$. The mathematical representation of WBD can be formulated as follows:

${\rm{Consider }}\vec{x} = \left[{{x}_{1}}\; {{x}_{2}}\; {{x}_{3}}\; {{x}_{4}} \right] = \left[h \, l \, t \, b \right]$

${\rm{Minimize }}\ f\left({\vec{x}} \right) = 1.10471x_{1}^{2}{{x}_{2}}+0.04811{{x}_{3}}{{x}_{4}}\left(14.0+{{x}_{2}} \right)$

${\rm{Subject\ to: }}$

${{g}_{1}}\left({\vec{x}} \right) = \tau \left({\vec{x}} \right)-13600\le 0$

${{g}_{2}}\left({\vec{x}} \right) = \sigma \left({\vec{x}} \right)-30000\le 0$

${{g}_{3}}\left({\vec{x}} \right) = {{x}_{1}}-{{x}_{4}}\le 0$

${{g}_{4}}\left({\vec{x}} \right) = 0.10471\left(x_{1}^{2} \right)+0.04811{{x}_{3}}{{x}_{4}}\left(14+{{x}_{2}} \right)-5.0\le 0$

${{g}_{6}}\left({\vec{x}} \right) = \delta \left({\vec{x}} \right)-0.25\le 0$

${{g}_{7}}\left({\vec{x}} \right) = 6000-{{p}_{c}}\left({\vec{x}} \right)\le 0$

${{\rm{where}}}$

$\tau \left({\vec{x}} \right) = \sqrt{\left({{\tau }'} \right)+\left(2{\tau }'{\tau }'' \right)\frac{{{x}_{2}}}{2R}+{{\left({{\tau }''} \right)}^{2}}}$

${\tau }' = \frac{6000}{\sqrt{2}{{x}_{1}}{{x}_{2}}}$

${\tau }'' = \frac{MR}{J}$

$M = 6000\left(14+\frac{{{x}_{2}}}{2} \right)$

$R = \sqrt{\frac{x_{2}^{2}}{4}+{{\left(\frac{{{x}_{1}}+{{x}_{3}}}{2} \right)}^{2}}}$

$j = 2\left\{ {{x}_{1}}{{x}_{2}}\sqrt{2}\left[\frac{x_{2}^{2}}{12}+{{\left(\frac{{{x}_{1}}+{{x}_{3}}}{2} \right)}^{2}} \right] \right\}$

$\sigma \left({\vec{x}} \right) = \frac{504000}{{{x}_{4}}x_{3}^{2}}$

$\delta \left({\vec{x}} \right) = \frac{65856000}{\left(30\times {{10}^{6}} \right){{x}_{4}}x_{3}^{3}}$

${{p}_{c}}\left({\vec{x}} \right) = \frac{4.013\left(30\times {{10}^{6}} \right)\sqrt{\frac{x_{3}^{2}x_{4}^{6}}{36}}}{196}\left(1-\frac{{{x}_{3}}\sqrt{\frac{30\times {{10}^{6}}}{4\left(12\times {{10}^{6}} \right)}}}{28} \right)$

${\rm{with }}\ 0.1\le {{x}_{1}}, {{x}_{4}}\le 2.0\, {\rm{and}}\, 0.1\le {{x}_{2}}, {{x}_{3}}\le 10.0$

Results of WBD are shown in Table 9 where mAO is compared with classical AO, GSA ^[46], GA ^[77], SSA ^[78], MPA ^[79], HHO ^[80,81], WOA ^[82], and CSA ^[40]. From the pre-mentioned table, it's notable that mAO has outperformed other swarm optimizers with an objective value of 1.6565 and decision values $(x_1, x_2, x_3, x_4)$ = (0.1625, 3.4705, 9.0234, 0.2057, 1.6565).

5.2.   Pressure vessel design problem

The $2^{nd}$ constrained problem introduced in this study is one of the mixed integer optimization problems which is termed as Pressure Vessel Design (PVD) problem proposed by Kannan and Kramer ^[83]. PVD aims to select the lowest cost of raw materials for the cylindrical vessel as shown in Figure 5. PVD has 4 parameters namely: head thickness $(T_{h})$, shell thickness $(T_{s})$, cylindrical strength $(L)$, and inner radius $(R)$. To mathematically model PVD, the following formula is designed:

${\rm{Minimize }}\ f(x) = 0.6224{{x}_{1}}{{x}_{3}}{{x}_{4}}+1.7781{{x}_{2}}x_{3}^{2}+3.1661x_{1}^{2}{{x}_{4}}+19.84x_{1}^{2}{{x}_{3}}$

${\rm{Subject\ to: }}$

${{g}_{1}}(x) = -{{x}_{1}}+0.0193x$

${{g}_{2}}(x) = -{{x}_{2}}+0.00954{{x}_{3}}\, \le 0$

${{g}_{3}}(x) = -\pi x_{3}^{2}{{x}_{4}}-(4/3)\pi x_{3}^{3}+1,296,000\le 0$

${{g}_{4}}(x) = {{x}_{4}}-240\le 0$

$0\le {{x}_{i}}\le 100, \, \, i = 1, 2$

$10\le {{x}_{i}}\le 200, \, \, i = 3, 4$

$ Results of PVD exists in table 10 where the suggested optimizer is compared with original AO, WOA ^[82], PSO-SCA ^[84], HS ^[85], SMA ^[86], CPSO ^[87], GWO ^[47], HHO ^[80], GOA ^[46], TEO ^[88], and SO ^[30]. From the pre-mentioned table, it can be seen that the developed optimizer ranked first with a value of 5946.3358 and decision values $(x_1, x_2, x_3, x_4)$ = (1.0530, 0.181884, 58.619, 38.8080, 5946.3358).

5.3.   Tension/compression spring design problem

The $3^{rd}$ constrained engineering problem discussed here is Tension/Compression Spring Design (TCSD) which was introduced by Arora ^[89] and its main objective is to decrease the tension spring weight by determining the optimal design variables' values that satisfy its constrained requirements. TCSD has different 3 variables namely: diameter of mean coil $(D)$, the diameter of the wire $(d)$, and active coils number $(N)$. TCSD design is given in Figure 6 and its mathematical formulation is given as follows:

Consider:

$\vec{x} = \left[{{x}_{1}}{{x}_{2}}{{x}_{3}} \right] = \left[d\, D\, N \right]$

${\rm{Minimize }}\ f\left({\vec{x}} \right) = \left({{x}_{3}}+2 \right){{x}_{2}}x_{1}^{2}$

$subject to:$

${{g}_{1}}\left({\vec{x}} \right) = 1-\frac{x_{2}^{3}{{x}_{3}}}{71785x_{1}^{4}}\le 0$

${{g}_{2}}\left({\vec{x}} \right) = \frac{4x_{2}^{2}-{{x}_{1}}{{x}_{2}}}{12566\left({{x}_{2}}x_{1}^{3}-x_{1}^{4} \right)}+\frac{1}{5108x_{1}^{2}}-1\le 0$

${{g}_{3}}\left({\vec{x}} \right) = 1-\frac{140.45{{x}_{1}}}{x_{2}^{2}{{x}_{3}}}\le 0$

${{g}_{4}}\left({\vec{x}} \right) = \frac{{{x}_{1}}+{{x}_{2}}}{1.5}-1\le 0$

${\rm{with }}\ 0.05\le {{x}_{1}}\le 2.0, 0.25\le {{x}_{2}}\le 1.3, and\, 2.0\le {{x}_{3}}\le 15.0$

Table 11 shows the results of TCSD where mAO is compared with RO ^[90], WOA ^[82], PSO ^[87], MVO ^[64], ES ^[91], OBSCA ^[92], GSA ^[93], and CPSO ^[87].

From the previously mentioned table, we can conclude that mAO has achieved better results compared to original and other competitors. It achieves a fitness value with 0.011056 and decision values $(x_1, x_2, x_3)$ = (0.0502339, 0.32282, 10.5244).

5.4.   Speed reducer design problem

The $4^{th}$ engineering problem discussed in this section is the speed reducer design ^[94] (SRD) whose main aim is to minimize speed reducer weight with respect to curvature stress of gear teeth, shafts stress, and shafts transverse deflections. It has seven different variables and its design is shown in Figure 7. The formulation of the SRD can be descriped mathematically as follows:

${\rm{Minimize: }}\; f\left({\vec{z}} \right) = 0.7854{{z}_{1}}z_{2}^{2}\left(3.3333z_{3}^{2}+14.9334{{z}_{3}}-43.0934 \right)-1.508{{z}_{1}}\,$

$\left(z_{6}^{2}+z_{7}^{2} \right)+7.4777\left(z_{6}^{3}+z_{7}^{3} \right)+0.7854\left({{z}_{4}}z_{6}^{2}+{{z}_{5}}z_{7}^{2} \right)\,$

${\rm{Subject\ to: }}$

${{g}_{1}}\left({\vec{z}} \right) = \frac{27}{{{z}_{1}}z_{2}^{2}{{z}_{3}}}-1\le 0$

${{g}_{2}}\left({\vec{z}} \right) = \frac{397.5}{{{z}_{1}}z_{2}^{2}{{z}_{3}}}-1\le 0$

${{g}_{3}}\left({\vec{z}} \right) = \frac{1.93z_{4}^{3}}{{{z}_{2}}{{z}_{3}}z_{6}^{4}}-1$

${{g}_{4}}\left({\vec{z}} \right) = \frac{1.93z_{5}^{3}}{{{z}_{2}}{{z}_{3}}z_{7}^{4}}-1\le 0$

${{g}_{5}}\left({\vec{z}} \right) = \frac{1}{110z_{6}^{3}}\sqrt{{{\left(\frac{745{{z}_{4}}}{{{z}_{2}}{{z}_{3}}} \right)}^{2}}+16.9\times {{10}^{6}}}-1\le 0$

${{g}_{6}}\left({\vec{z}} \right) = \frac{1}{85z_{7}^{3}}\sqrt{{{\left(\frac{745{{z}_{5}}}{{{z}_{2}}{{z}_{3}}} \right)}^{2}}+157.5\times {{10}^{6}}}-1\le 0$

${{g}_{7}}\left({\vec{z}} \right) = \frac{{{z}_{2}}{{z}_{3}}}{40}-1\le 0$

${{g}_{8}}\left({\vec{z}} \right) = \frac{5{{z}_{2}}}{{{z}_{1}}}-1\le 0$

${{g}_{9}}\left({\vec{z}} \right) = \frac{{{z}_{1}}}{12{{z}_{2}}}-1\le 0$

${{g}_{10}}\left({\vec{z}} \right) = \frac{1.5{{z}_{6}}+1.9}{z_{4}}-1\le 0$

${{g}_{11}}\left({\vec{z}} \right) = \frac{1.1{{z}_{7}}+1.9}{{{z}_{5}}}-1\le 0$

$with$

$2.6\le {{z}_{1}}\le 3.6$

$0.7\le {{z}_{2}}\le 0.8$

$17\le {{z}_{3}}\le 28$

$7.3\le {{z}_{4}}\le 8.3$

$7.8\le {{z}_{5}}\le 8.3$

$2.9\le {{z}_{6}}\le 3.9$

${\rm{and}}\, 5\le {{z}_{7}}\le 5.5$

mAO is compared with different metaheuristics optimizers including PSO ^[95], MDA ^[96], GSA ^[93], HS ^[29], SCA ^[97], SES ^[98], SBSM ^[99], and hHHO-SCA ^[100] as shown in Table 12. From this table, it's obvious that mAO outperformed other algorithms. mAO ranked first with a fitness value of 3002.7328 and decision values $(x_1, x_2, x_3, x_4, x_5, x_6, x_7)$ = (3.5012, 0.7, 17, 7.3100, 7.8873, 3.0541, 5.2994).

5.5.   Three-bar truss design problem

The last engineering problem addressed in this manuscript is called the Three-bar truss design (TBD) problem. TBD is a fraction and nonlinear civil engineering problem introduced by Nowcki ^[101]. Its objective is to find the minimum values of truss weight. It has two variables and its mathematical formulation is shown below:

Minimize: $f(x) = (2\sqrt{2x_{1}}+x_{2})*l$

Subject to: ${{g}_{1}}\left(x \right) = \frac{\sqrt{2}x_{1}+x_{2}}{\sqrt{2x_{1}^{2}}+2x_{1}x_{2}}P- \sigma\leq0$

${{g}_{2}}\left(x \right) = \frac {x_{2}}{\sqrt{2}x_{1}^{2}+2x_{1}x_{2}}P-\sigma\leq0$

${{g}_{3}}\left(x \right) = \frac {1}{\sqrt{2}x_{1}^{2}+2x_{1}x_{2}}P-\sigma\leq0$

Variable Range

$0\le {x}_{1}, {x}_{2}\le 1$

mAO results are compared with CS ^[102], GOA ^[46], DEDS ^[103], MBA ^[104], PSO-DE ^[84], AAA ^[105], PSO-DE ^[84], DEDS ^[103] and AO. The results of TBD are listed in table 13 in which mAO results outperformed other competitors. mAO ranked first with a fitness value of 231.8681 and decision values $(x_1, x_2)$ = (30.7886, 0.3844).

6.   Conclusions and future work

In this study, a novel AO version is suggested called mAO to tackle various optimization issues. mAO is based on 3 different techniques: 1) Opposition-based Learning to improve optimizer exploration phase 2) Restart Strategy to remove the worse agents and replace them with totally random agents. 3) Chaotic Local Search to add more exploitation abilities to the original algorithm. mAO is tested using 29 CEC2017 functions and different five engineering optimization problems. Statistical analysis and experimental numbers show the significance of the suggested optimizer in solving various optimization issues. However, mAO like other swarm-based algorithms has a slow convergence in high-dimensional problems so, it won't be able to solve all optimization problem types.

In future, we can apply mAO to feature selection, job scheduling, combinatorial optimization problems, and stress suitability. Binary and multi-objective versions may be proposed in future.

Acknowledgments

The authors would like to thank the support of Digital Fujian Research Institute for Industrial Energy Big Data, Fujian Province University Key Lab for Industry Big Data Analysis and Application, Fujian Key Lab of Agriculture IOT Application, IOT Application Engineering Research Center of Fujian Province Colleges and Universities, Sanming City 5G Innovation Laboratory, and also the anonymous reviewers and the editor for their careful reviews and constructive suggestions to help us improve the quality of this paper. Educational research projects of young and middle-aged teachers in Fujian Province (JAT200648), Fujian Natural Science Foundation Project (2021J011128).

Conflict of interest

The authors declare there is no conflict of interest.