# An Advanced Amalgam of Nature-Inspired Algorithms for Global Optimization Problems

Authors: Asia Nourin; Wali Khan Mashwani; Rubi Bilal; Muhammad Sagheer; Habib Shah; Sama Arjika; Hussain Shah
Journal: Mathematical Problems in Engineering
 (2022)

---

## Abstract

Large-scale global optimization problems are ambitious and quite difficult to handle with deterministic methods. The use of stochastic optimization techniques is a good choice for dealing with these problems. Nature-inspired algorithms (NIAs) are stochastic in nature, computer-based, and quite easy to implement due to their population-based nature. The Grey wolf optimizer (GWO) and teaching-learning-based optimization are the most recently developed and well-known NIAs. GWO is based on the preying strategies of grey wolves while TLBO is based on the effect of the influence of a teacher on the output of learners in a class. NIAs are quite often stuck in the local basins of attraction due to the improper balancing of exploration versus exploitation. In this paper, an advanced amalgam of nature-inspired algorithms (ANIA) is developed by employing GWO and TLBO as constituent algorithms. Initially, an equal number of solutions are assigned to both NIAs to perform their search process of population evolution; then, in later iterations, the number of solutions are allocated to each constituent algorithm based on their individual performance and achievements gained by each algorithm in the previous iteration. The performance of an algorithm is determined at the end of iteration by calculating the ratio of total updated solutions to the total assigned solutions in the amalgam. The proposed strategy effectively balanced the exploration versus exploitation dilemma via compelling the parent algorithms to show continuous improvement during the whole course of the optimization process. The performance of the proposed algorithm, ANIA is evaluated on recently designed benchmark functions of large-scale global optimization problems. The approximated results found by the proposed algorithm are promising as compared to state-of-the-art evolutionary algorithms including the GWO and TLBO in terms of diversity and proximity. The proposed ANIA has tackled most of the benchmark functions efficiently in the parlance of evolutionary computing communities.


---

## Body

## 1. Introduction

Optimization is the utilization of available resources in an effective manner that directs the objective function at hand to its desired optimum value with optimized values of decision variables. Optimization has wide range of applications in natural sciences, physical sciences social sciences and various engineering technologies. Since 1940, optimization is considered an essential part of applied sciences. In the early days of fifties, simulation of optimization algorithms with digital computing machines were not widely known and common. Later on, it became possible to solve complex optimization problems which were considered to be difficult to solve manually [1]. Examples of complex and hard problems includes the vehicle routing and scheduling, knapsack problems, investment problems, optimal control problems, power grid estimation problems [2–4].Optimization problems are classified based on various backgrounds. For instance, path followed splits optimization problem into deterministic and stochastic. The former deals with problems where a unique and fixed path is tracked in various attempts for the same inputs, while in the latter, following of unique and fixed path is not considered essential for the same inputs in various trials. Likewise, removal/subjection of constraints to the optimization problem split it to unconstrained/constrained. Unconstrained type Optimization Problem (UCOP) with a single objective in the sense of minimization is described as below [5]:(1)Minimizefx,forx=x1,x2,…,xnT∈S,xiL≤xi≤xiU,i=1,…,n.In above defined problem, then-dimensional decision variables vector is x=x1,x2,…,xnT, objective function for minimization is fx, the lower and upper limits correspond to each dimension of the search space S are xiL and xiU, respectively.In the last two decades and so, many optimization algorithms have been developed for solving various optimization problems [6–12]. Among them, the Nature-Inspired-Algorithms (NIAs) are stochastic optimization techniques that have simulated various sophisticated systems of biological or physical organism existing in the nature [13]. They have successfully tackled distinct benchmark functions and many real-world optimization problems [14–18]. In the frameworks of NIAs, integration of various operators can categorize them into Evolutionary algorithms (EA) and Swarm Intelligence (SI) approaches for global optimization [19–22]. EAs are originated from the Darwin’s principle “Survival of the fittest”. Similarly, the main source of learning for SI approaches are their information sharing among their swarm members [23]. In the recent past, stochastic optimization algorithms become an emerging area of research in the evolutionary communities [24]. The recently developed algorithms includes the improved Consensus-Based Optimization (CBO) [25], Algorithm of the Innovative Gunner (AIG) [26], and Bayesian Optimization with Deep Partitioning Tree (DPT-BO) [27].In evolutionary communities, SI-based algorithms are of special interest for researchers due to their easiness, extreme flexibility, and adaptivity for optimization problems. SI algorithms perform promisingly and robustly for global optimization problems. Some key algorithms are Teaching Learning Based Optimization (TLBO) [28, 29], Grey Wolf Optimizer (GWO) [30, 31], Particle Swarm Optimization (PSO) [32, 33], and Naked Mole-Rat (NRM) [34] algorithms. GWO is an SI-based algorithm that is the emulation of preying strategies of grey wolf used for hunting the prey. GWO is proposed for solving unconstrained optimization problems in canonical form. The main characteristics used in the mimicry process for GWO are searching, encircling, and attacking the prey. In GWO, solutions are symbolized as grey wolves. They live in a pack that constituents a population for GWO. The nomination of leaders of the pack is made based on the fitness values of the wolves (solutions). The top three solutions are named alpha α, beta β, and delta δ, respectively; while, the rest are omegas ω. TLBO is also SI based algorithm that imitates the idea of the teaching-learning process used by the students to get knowledge and improve their grades/results accordingly. Initially, TLBO is designed for solving unconstrained optimization problems. It consists of two phases, teacher and learner. In TLBO students are assumed as solutions, selected courses are demonstrated as dimensions, and class is nominated as population. The rule of teacher, in the teacher phase, is played by the best students i.e. optimal solution in the previous iteration. In mentioned NIAs, initially, solutions are generated randomly in some defined search spaces. Later on, corresponding formulae of discussed NIAs are used for finding new positions and the selection operator gives updated positions. Discussed algorithms are iterative in nature and are repeated till the consumption of the provided budget.In the recent few years, GWO and TLBO have gained much popularity in solving optimization problem with low-scale dimensions. During the optimization process sometimes GWO solutions are stuck in local minimum due to low exploration and high exploitation that ultimately leads the algorithm to decide pre-maturely which is the major weakness in the framework of GWO. TLBO is highly explorative due to the presence of two phases in it, which consumes more function evaluations and slows down its convergence rate of it. For the remedy of the discussed conundrums, in this paper performance-based amalgam of GWO and TLBO is presented abbreviated as ANIA. Initially, GWO and TLBO are allocated an equal number of solutions. The proposed ANIA allocates the number of solutions allocated to each constituent algorithm based on its individual performance in the whole course of optimization.The rest of the paper is organized as follows. Section2 reflects reviewed literature for GWO and TLBO along with the motivation for the current research work. Section 3 presents the proposed algorithm with novelty. Section 4 demonstrates numerical results, parameters setting for conducting simulations, comparison and ranking of proposed algorithms with its ancestors along with computational time complexity. Section 5 discusses the performance of the compared algorithms. A short summary of conclusions and future work are included in Section 6.


## 2. Reviewed Literature

This section presents the literature of main algorithms GWO and TLBO. Weaknesses in GWO and TLBO along with the strategies used for diminishing them motivated the current work.


### 2.1. Grey Wolf Optimizer (GWO)

GWO was introduced by Mirjalili et al. [30] in 2014 for solving unconstrained optimization problems. It is an SI-based algorithm that has successfully produced competitive results on different optimization problems. GWO mimics the hunting strategies and leadership characteristics of grey wolves. They live and work as one pack and follow a strict dominant behavior. Different wolves are categorized as α, β, δ, and ω. α is the most dominant and fittest wolf, called the leader of the pack. β is placed second to α, while δ follows the order of the leaders. β and δ are direct subordinates to α. The remaining wolves are categorized as ω wolves. In GWO solutions (wolves) are generated randomly in the given search region then their positions are updated through three main phases: searching prey, encircling prey, and attacking prey. Grey wolves search and encircle the prey using Eq (2)–(5).(2)C=2r2,(3)D=Cxpt−xit,(4)A=2ar1−a,(5)yit=xpt−AD,where xpt represents the position of the prey, wolf position is denoted by xit, A and C are coefficient vectors. r1 and r2 are stochastically generated vectors in the interval (0,1) and a is decreasing real number from 2 to 0, linearly. The next phase is to hunt the prey. Primarily, the α wolf guides the pack for hunting. However, if desired, then α and δ wolves also take part in the hunt. Thus, in the mathematical modeling of hunting, it is declared that α, β, and δ wolves are leaders based on their fitness values. Therefore, they are followed while searching for the prayer. Their highest fitness values ensure good prediction about the location of the prey. Hence, the top three fittest agents are recorded as α, β, and δ wolves, while the rest of them are ω. They are asked to update their positions according to the location of their leaders. Equations used for finding new positions are given below:(6)Dα=C1xαt−xit,x1=xαt−A1Dα,Dβ=C2xβt−xit,x2=xβt−A2Dβ,Dδ=C3xδt−xit,x3=xδt−A3Dδ,yit=x1+x2+x33.Initially, the grey wolves harass the prey to get it too tired to move. This behavior of wolves is mathematically formulated by decreasing the value of scaling parametera linearly from 2 to 0, across different iterations. During this stage, the value of A is taken less than 1 in order to attack the prey, while searching of the hunt is controlled by taking A⩾1.


### 2.2. Teaching Learning based Optimization (TLBO)

TLBO is an SI-based nature-inspired algorithm brought in by R.Venkata Rao et al. in [28]. It is amongst the most prominent algorithms in the field of optimization, due to its large range of usage in many areas, such as engineering and industry. TLBO simulates the basic concept of the teaching-learning process that constituents of two phases i.e. teacher and learner. In TLBO, learners develop their results/grades by passing through two phases, teacher and learner, in each iteration, respectively. In the initial stage of TLBO, swarm members are stochastically generated in the desired region. However, during the search process, swarm members get their new positions in succeeding iterations.Mathematical formulation adopted in teacher phase is given as [29]:(7)yit=xit+r×xBestt−TF×Mt,In the above equation, current solution isxit, r lies in (0,1) is stochastically taken real number, xBestt is the fittest candidate solution symbolized as teacher, TF is factor for teaching which is randomly taken either 1 or 2, mean position of the current swarm is Mt, and new position of xit is yit.Mathematical modelling of learner phase of TLBO is given by [29]:(8)yit=xit+r×xjt−xit,iffxit>fxjt,xit+r×xit−xjt,otherwise,where current solution is xit, r is a stochastically taken number from the interval (0,1), xjt is randomly picked solution other than xit from the swarm, fxit and fxjt are costs of mentioned solutions, and new position of xit is yit.


### 2.3. Motivation for the current research work

Almost all NIAs meet up with some hurdles while solving optimization problems, like stagnation, premature convergence, low convergence rate. These are faced due to the weak exploration/exploitation or their improper balancing. These hurdles also exist in GWO and TLBO like other NIAs. To avoid the happening of these phenomena during the optimization process is a popular research field nowadays, upon which the current research work is based. For tackling prescribed hurdles and solving various types of optimization problems, researchers have constructed many improved versions of NIAs or their amalgam/hybrid algorithms. GWO is improved by adaptively adjusting the tunable parameters of it in [35]. In [18] a hybrid algorithm, HTLBO, is innovated by improving the teacher phase of basic TLBO, which produced remarkable results among the compared. Information sharing-based hybridization is made in [36] for PSO and GWO and it is shown in the paper that hybrid one performed well than parents. Surrogate-Assisted Hybrid Optimization (SAHO) algorithm is introduced in [37] that combines TLBO and Differential Evolution (DE) [38] with the remarks that SAHO is the supreme among the competitors. Hybridization of various stochastic optimization algorithms is done based on different strategies in [39–44] with the bottom line that if NIAs are gathered through an efficient procedure, it will mature the exploration and exploitation and balance their participation in the optimization process which ultimately results in a robust hybrid algorithm. The prescribed situation motivated this work to seek an economic strategy for constructing the advanced amalgam.


## 2.1. Grey Wolf Optimizer (GWO)

GWO was introduced by Mirjalili et al. [30] in 2014 for solving unconstrained optimization problems. It is an SI-based algorithm that has successfully produced competitive results on different optimization problems. GWO mimics the hunting strategies and leadership characteristics of grey wolves. They live and work as one pack and follow a strict dominant behavior. Different wolves are categorized as α, β, δ, and ω. α is the most dominant and fittest wolf, called the leader of the pack. β is placed second to α, while δ follows the order of the leaders. β and δ are direct subordinates to α. The remaining wolves are categorized as ω wolves. In GWO solutions (wolves) are generated randomly in the given search region then their positions are updated through three main phases: searching prey, encircling prey, and attacking prey. Grey wolves search and encircle the prey using Eq (2)–(5).(2)C=2r2,(3)D=Cxpt−xit,(4)A=2ar1−a,(5)yit=xpt−AD,where xpt represents the position of the prey, wolf position is denoted by xit, A and C are coefficient vectors. r1 and r2 are stochastically generated vectors in the interval (0,1) and a is decreasing real number from 2 to 0, linearly. The next phase is to hunt the prey. Primarily, the α wolf guides the pack for hunting. However, if desired, then α and δ wolves also take part in the hunt. Thus, in the mathematical modeling of hunting, it is declared that α, β, and δ wolves are leaders based on their fitness values. Therefore, they are followed while searching for the prayer. Their highest fitness values ensure good prediction about the location of the prey. Hence, the top three fittest agents are recorded as α, β, and δ wolves, while the rest of them are ω. They are asked to update their positions according to the location of their leaders. Equations used for finding new positions are given below:(6)Dα=C1xαt−xit,x1=xαt−A1Dα,Dβ=C2xβt−xit,x2=xβt−A2Dβ,Dδ=C3xδt−xit,x3=xδt−A3Dδ,yit=x1+x2+x33.Initially, the grey wolves harass the prey to get it too tired to move. This behavior of wolves is mathematically formulated by decreasing the value of scaling parametera linearly from 2 to 0, across different iterations. During this stage, the value of A is taken less than 1 in order to attack the prey, while searching of the hunt is controlled by taking A⩾1.


## 2.2. Teaching Learning based Optimization (TLBO)

TLBO is an SI-based nature-inspired algorithm brought in by R.Venkata Rao et al. in [28]. It is amongst the most prominent algorithms in the field of optimization, due to its large range of usage in many areas, such as engineering and industry. TLBO simulates the basic concept of the teaching-learning process that constituents of two phases i.e. teacher and learner. In TLBO, learners develop their results/grades by passing through two phases, teacher and learner, in each iteration, respectively. In the initial stage of TLBO, swarm members are stochastically generated in the desired region. However, during the search process, swarm members get their new positions in succeeding iterations.Mathematical formulation adopted in teacher phase is given as [29]:(7)yit=xit+r×xBestt−TF×Mt,In the above equation, current solution isxit, r lies in (0,1) is stochastically taken real number, xBestt is the fittest candidate solution symbolized as teacher, TF is factor for teaching which is randomly taken either 1 or 2, mean position of the current swarm is Mt, and new position of xit is yit.Mathematical modelling of learner phase of TLBO is given by [29]:(8)yit=xit+r×xjt−xit,iffxit>fxjt,xit+r×xit−xjt,otherwise,where current solution is xit, r is a stochastically taken number from the interval (0,1), xjt is randomly picked solution other than xit from the swarm, fxit and fxjt are costs of mentioned solutions, and new position of xit is yit.


## 2.3. Motivation for the current research work

Almost all NIAs meet up with some hurdles while solving optimization problems, like stagnation, premature convergence, low convergence rate. These are faced due to the weak exploration/exploitation or their improper balancing. These hurdles also exist in GWO and TLBO like other NIAs. To avoid the happening of these phenomena during the optimization process is a popular research field nowadays, upon which the current research work is based. For tackling prescribed hurdles and solving various types of optimization problems, researchers have constructed many improved versions of NIAs or their amalgam/hybrid algorithms. GWO is improved by adaptively adjusting the tunable parameters of it in [35]. In [18] a hybrid algorithm, HTLBO, is innovated by improving the teacher phase of basic TLBO, which produced remarkable results among the compared. Information sharing-based hybridization is made in [36] for PSO and GWO and it is shown in the paper that hybrid one performed well than parents. Surrogate-Assisted Hybrid Optimization (SAHO) algorithm is introduced in [37] that combines TLBO and Differential Evolution (DE) [38] with the remarks that SAHO is the supreme among the competitors. Hybridization of various stochastic optimization algorithms is done based on different strategies in [39–44] with the bottom line that if NIAs are gathered through an efficient procedure, it will mature the exploration and exploitation and balance their participation in the optimization process which ultimately results in a robust hybrid algorithm. The prescribed situation motivated this work to seek an economic strategy for constructing the advanced amalgam.


## 3. Proposed Algorithm with Novelty

To diminish the occurrence of premature convergence and to avoid being stuck in a local minimum, various strategies are introduced by the researchers in literature in order to make hybrid algorithms of existing NIAs. For hybridization, the combination of highly exploitative and highly explorative algorithms is the best option. When two algorithms with discussed characteristics are selected then the only leftover task is to introduce an efficient hybridization strategy. This research work is based on innovating one such novel strategy for hybridization to tackle the prescribed hurdles and combine GWO and TLBO efficiently. In the current research work, GWO and TLBO are selected for making an advanced amalgam since GWO is highly exploitative and TLBO is highly explorative in nature. For examining the future of anything its current status is studied. The same idea is used as a strategy for hybridization in this work. In this paper, an advanced amalgam of well-known NIAs, GWO, and TLBO, is introduced, based on their updating solutions ratio in the current iteration which is the bottom line for this research. In the amalgam, the number of assigned solutions for the next iteration to an algorithm depends upon the update ratio (total updated/total assigned) of solutions in the current iteration. At any iteration, the update ratio of an algorithm reflects its performance in the amalgam. If the update ratio of an algorithm is greater than the other, then in the next iteration it is favourable and more solutions are assigned to it as compared to others. Mentioned strategy for advanced amalgam compels GWO and TLBO to show continuous relative performance else their importance will be diminished. The proposed unconstrained algorithm is the advanced Amalgam of NIAs, GWO, and TLBO, named as ANIA. Step by step procedure of it is illustrated in the Pseudocode as given in Algorithm1, while, the flowchart of the proposed algorithm is shown in Figure 1.Algorithm 1: Pseudocode of ANIA.
1.
Define parameters: Pop Size=nPop, Max Ftn Evaluations =MaxFEVs;2.
Initialize thePop with size nPop uniformly and randomly;3.
Start Counter of Function EvaluationsFEVs =0;4.
Determine the values offxit, for each xit∈Pop;5.
AssignFEVs=FEVs+nPop;6.
Nominateα= Teacher, β, and δ as top three solutions of the Pop;7.
SetnGWO = round(nPop/2) and nTLBO=nPop−nGWO;8.
whileFEVs<MaxFEVs do9.
Assign randomlynGWO solutions to GWO from the Pop;10.
Find new positions using GWO equations for assigned solutions;11.
Determine the fitness values for new positions;12.
Update positions by comparing the assigned with new positions;13.
Find update ratio,RGWO=No of updated assigned/Total assigned;14.
Assign the unassigned solution ofPop to TLBO;15.
Select randomly round(nTLBO/2) solutions from assigned;16.
Find new positions via teacher phase equation for selected solutions;17.
Determine the fitness values for new positions;18.
Update positions by comparing the selected with new positions;19.
Assign the unassigned solution to learner phase;20.
Find new positions via learner phase equation for assigned solutions;21.
Determine the fitness values for new positions;22.
Update positions by comparing the assigned with new positions;23.
Find update ratio,RTLBO=No of updated assigned/Total assigned;24.
Nominateα= Teacher, β, and δ as top three solutions of the Pop;25.
AssignFEVs=FEVs+nPop;26.
ifRGWO=0 and RTLBO=0 then27.
SetnGWO=roundnPop/2 and TLBO=nPop−nGWO;28.
else ifRGWO=029.
nTLBO=roundRTLBOnPop;30.
ifnTLBO<nPop/2−5 then31.
nTLBO=roundnPop/2+nTLBO;32.
end if33.
nGWO=nPop−nTLBO;34.
else ifRTLBO=035.
nGWO=roundRGWOnPop;36.
ifnGWO<nPop/2−5 then37.
nGWO=roundnPop/2+nGWO;38.
end if39.
nTLBO=nPop−nGWO;40.
else41.
nGWO=roundRGWO/RGWO+RTLBOnPop;42.
nTLBO=nPop−nGWO;43.
end if44.
end whileFigure 1
Flowchart of ANIA.


## 4. Numerical Results

For performance evaluation of GWO, TLBO, and ANIA, the unconstrained suit CEC-2014 [5] is taken. It consists of 30 non-linear, unimodal, multimodal, hybrid, and composite benchmark functions with rotated, translated, separable, non-separable, and asymmetrical characteristics. Nature of the functions classifies the tested suit as follows:(i)
Unimodal Functions: These are fromF01 to F03 in the tested suit.(ii)
Simple Multimodal Functions: These are fromF04 to F16 in the tested suit.(iii)
Hybrid Functions: These are fromF17 to F22 in the tested suit.(iv)
Composite Functions: These are fromF23 to F30 in the tested suit.


### 4.1. System Specification and Parameters Setting for Conducting Simulations

Experiments are conducted with a system having Window 10, Intel(R) Core(TM) i3-7100U CPU @ 2.40 GHz, and 8 GB RAM, and simulation environment isMATLAB® 2013a. Parameters are set as: size of population = 100, dimension (D) of the problems = 10 and 30, maximum function evaluations = 10000 × D, and independent runs = 51 to each problem correspond to taken dimensions.


### 4.2. Comparison via Rank Points and Convergence Graphs

All algorithms are compared based on the staticsBest, Worst, Median, Mean, and Std which are the minimum, maximum, median, mean, and standard deviation of 51 obtained the best solution fitness values corresponds to each run for a problem, respectively. Algorithms are ranked based on user statistics. For compared algorithms, rank points are displayed in parenthesis Table 2 beside Table 3 each statistic. Tables 1–4 reflect the comparison and ranking of the competitors GWO, TLBO, and ANIA via mentioned statistics. Table 5 shows positions of algorithms via the sum of rank points for unimodal functions. Table 6 illustrates positions of competitors via the sum of rank points for multimodel functions. Table 7 demonstrates positions of contestants via the sum of rank points for hybrid functions. Table 8 exhibits positions of rivals via the sum of rank points for composite functions. Table 9 presents the sum of rank points corresponding to various statistics used for analysis with D10, D30, and overall. Convergence graphs for each problem of the testedsuit are included in Figures 2–6, which exhibits the average progress of the opponents through the optimization process.Table 1
Comparison of Algorithms for Problems F01-F20 with D10.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO81795.519733704593.85303364780.00833687972.32593836307.21263F01100TLBO100.5677176011.598621471.345325665.9765215399.78772ANIA117.5871235114.108011439.958113088.636816831.09881GWO755.9075328364.436735542.401536307.948834995.62353F02200TLBO200.00022514.78542200.17571208.1722244.11092ANIA200.00011250.24651200.52402204.5614110.52671GWO311.992231531.52623567.52233702.50813354.53263F03300TLBO300.00001303.48112300.01661300.152820.52582ANIA300.00012300.72161300.01852300.076210.12531GWO401.08943435.77353435.18213433.274037.84191F04400TLBO400.00001434.78031434.78031422.4183116.25383ANIA400.00001434.78031434.78031426.5952214.17412GWO520.21453520.50723520.35963520.359830.06841F05500TLBO501.15512520.47522520.29691519.219624.23692ANIA500.00001520.45031520.31042518.759615.31813GWO600.22293603.32502601.28242601.410820.76922F06600TLBO600.02271605.29713601.82333601.942631.27543ANIA600.07682602.97591600.63101600.928110.74971GWO700.07673702.14963700.65103700.616130.34403F07700TLBO700.04432700.41342700.15492700.156220.07852ANIA700.02461700.25581700.09591700.113210.05701GWO803.00132832.06703807.35352809.625127.10903F08800TLBO804.97483822.88402811.93953812.349234.50342ANIA801.98991817.90921806.96471807.181313.59001GWO903.01412933.52903909.09683911.165336.49393F09900TLBO903.97983921.88912908.95462910.515323.94612ANIA901.98991920.89401905.96981907.257313.87031GWO1017.309532147.995731172.167821223.97162205.05453F101000TLBO1015.580321954.788521305.700831334.97443200.55392ANIA1010.307311532.197611149.278311170.02391128.51591GWO1100.565612528.510031485.618621587.99592386.18743F111100TLBO1116.445832023.269511605.937531604.92023227.93172ANIA1103.602322105.064321407.936211417.21491191.64571GWO1200.709331201.621331201.132631201.127930.20162F121200TLBO1200.115621200.733311200.385221200.388020.14431ANIA1200.034911200.905221200.215911200.337110.26973GWO1300.067131300.309731300.141431300.147830.04892F131300TLBO1300.040021300.282221300.121121300.129520.05303ANIA1300.034511300.160911300.091311300.096710.03081GWO1400.047221400.716021400.132511400.174720.14513F141400TLBO1400.132531400.790731400.236431400.255430.11302ANIA1400.044211400.335611400.132821400.149410.06931GWO1500.583931503.385631501.857831501.755130.74793F151500TLBO1500.407621502.153321500.937421500.973320.39052ANIA1500.370311501.274711500.739511500.770310.24331GWO1601.072821603.528231602.221221602.190420.50272F161600TLBO1601.497031603.029411602.389631602.293030.37501ANIA1600.540011603.040921601.745011601.784510.55683GWO2170.5742314742.128137714.510537090.536533505.72323F171700TLBO1728.594212646.263921880.623311934.82681177.63642ANIA1744.979422232.391611976.938621976.57612129.09681GWO1917.8042320211.497238819.706239864.764135333.97593F181800TLBO1801.103911881.169921827.869921828.3262117.49381ANIA1802.240021867.309411823.687311830.2198219.41282GWO1901.022131903.424921901.859031902.046230.58211F191900TLBO1900.233921904.223231901.508021901.605120.70523ANIA1900.104311903.000911901.505611901.504210.66762GWO2014.928832221.061032086.164832094.4122344.79163F202000TLBO2000.851112062.635312013.333912018.7839115.41662ANIA2002.871822076.186722019.618422023.1340215.34301Table 2
Comparison of algorithms for problems F21-F30 with D10.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO2336.9459315460.517234030.343435646.242533610.14133F212100TLBO2100.051612353.505022134.601512157.5129158.88131ANIA2100.824522291.492312158.672422171.3100266.47402GWO2223.022032367.278832238.880132253.1355344.02603F222200TLBO2203.394222238.859712223.624512223.988714.61831ANIA2201.566012344.255322223.805122227.3582218.83122GWO2629.458532635.033632629.495532629.679630.81033F232300TLBO2629.457512629.457512629.457512629.457510.00001ANIA2629.457512629.457512629.457512629.457510.00001GWO2500.207812535.198232516.337422516.718426.84993F242400TLBO2507.111032534.227922518.541832518.844935.54112ANIA2506.746622526.082912514.611612515.141314.29371GWO2600.029412702.467632700.906132693.1267322.61041F252500TLBO2617.884832701.526222638.621622651.9466228.23852ANIA2615.619722701.374012632.842812648.3965129.64023GWO2700.053032700.237032700.115532700.118930.03352F262600TLBO2700.021612700.189822700.072412700.077710.03763ANIA2700.026822700.141212700.084622700.086020.02611GWO2701.565333102.248833027.822223010.49713119.09191F272700TLBO2701.433523100.680222704.071612847.38851189.69233ANIA2701.068513100.471313032.023532944.54672167.78892GWO3157.177023365.106033189.167533222.8638357.10073F282800TLBO3168.850333316.416323180.627423207.0068246.87552ANIA3156.826913288.139413178.327213198.5627144.85291GWO3207.313834473.432533443.365133539.88603270.08663F292900TLBO3101.312713221.411713153.160623154.7406123.11101ANIA3124.345723277.082123148.912613156.5247231.94652GWO3491.320834847.314633680.141333800.24123294.44063F303000TLBO3472.234823955.093513614.957023640.53622116.09631ANIA3465.509214096.900223598.924613614.36711127.07002Table 3
Comparison of algorithms for problems F01-F09 with D30.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO5393003.2330357732050.8582319990492.4610321543030.3872311802589.45353F01100TLBO36797.189717001084.13792273370.36061716605.667321296300.13562ANIA60253.931222113960.83221323439.32872542911.85511517335.49911GWO5029622.489831794673205.31393180873004.09783254068618.27603318995332.04143F02200TLBO200.00011259.10802200.35221202.724218.81311ANIA200.00592258.64771203.18092208.5397212.17362GWO526.6609311589.900034140.004734249.269732638.53603F03300TLBO300.02471561.82152303.46732314.6536240.55062ANIA300.25342388.28581303.27741310.4554118.63291GWO470.55623759.31243556.30143556.1383344.90723F04400TLBO400.00711541.92992469.79601460.7056236.44132ANIA400.19492535.68771470.70292459.5009135.63421GWO520.80533521.04383520.96263520.954230.04561F05500TLBO520.31762520.89571520.79102520.759920.11252ANIA520.11951520.93262520.45771520.557710.28333GWO606.20091616.18871611.99901611.689212.27921F06600TLBO615.04883629.69493621.42453621.613233.12263ANIA611.41862625.51702617.05842616.780723.09462GWO700.88893709.44383703.00703703.442831.97773F07700TLBO700.00001700.19082700.02221700.035520.04382ANIA700.00001700.17851700.02462700.035110.04091GWO825.39511982.62733852.76012858.6289221.73823F08800TLBO851.73773924.36962893.52593892.7845315.38142ANIA827.85882898.50061849.74791849.9841114.04681GWO934.521621121.77943971.72982988.1362245.14813F09900TLBO962.682331065.16232998.50063997.3691321.23242ANIA924.87401988.55101953.72771954.6354112.63721Table 4
Comparison of algorithms for problems F10-F30 with D30.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO1678.864516647.149032788.448612962.26101963.02633F101000TLBO3034.270035234.278624198.630134215.60103568.05992ANIA2469.104125221.919713903.755923911.64062546.79561GWO2674.346318588.896334103.971114799.783431790.69043F111100TLBO3149.349036094.918624452.542434441.80112636.19612ANIA2862.870925312.620614274.488024231.02171552.44581GWO1201.588931203.013431202.491531202.486230.29482F121200TLBO1200.327521201.719021201.062121201.098320.27691ANIA1200.200511201.642511200.877411200.867510.32553GWO1300.182221300.626121300.285211300.306910.08002F131300TLBO1300.210031300.730731300.457431300.444530.12623ANIA1300.174411300.451511300.325321300.316720.07711GWO1400.180731400.915621400.277721400.363130.21043F141400TLBO1400.121911400.363011400.265211400.260610.05961ANIA1400.154121401.029131400.304031400.335720.15832GWO1505.565131549.064311515.206921515.025217.29491F151500TLBO1505.221521553.704421522.353431524.1972311.90813ANIA1503.985711553.816531514.033511516.078728.96432GWO1609.661121611.946011610.998521610.974520.55521F161600TLBO1609.717331612.604531611.424831611.381330.58032ANIA1608.588311611.981021610.816511610.665910.71743GWO65632.798632933308.18873475736.95453635492.83423547262.26803F171700TLBO4322.76312138224.9388213405.8973219134.3675225206.85262ANIA4273.8658182021.991819433.5584114477.6127113729.24521GWO2597.058031620704.8420315542.3182385843.80413243904.39503F181800TLBO1915.9317216126.669723008.147024526.941723420.36992ANIA1888.1759112959.545512511.911913624.195212443.77101GWO1907.628331996.689331912.669931916.3712214.68432F191900TLBO1906.696621987.836221911.784521916.5371317.27113ANIA1906.346711916.625411910.681911911.026412.30841GWO2169.612938893.608632390.339032811.835431556.03363F202000TLBO2073.793012618.718312268.466612283.48741105.45711ANIA2079.257722642.951822319.620022325.73942117.12612GWO15646.223931018922.20903120397.76103187179.59663200174.80843F212100TLBO3068.8556123112.758616090.220617359.087014178.46041ANIA3146.6994233630.100326913.454928274.090025905.66782GWO2262.809422805.733922491.753422482.58462116.39801F222200TLBO2345.675632866.203432508.185432541.54563138.27793ANIA2223.235212723.224612421.700612439.99931126.39662GWO2616.497332624.429432619.226432619.435931.80603F232300TLBO2615.244112615.244112615.244112615.244110.00001ANIA2615.244112615.244112615.244112615.244110.00001GWO2600.004832627.886432600.008132600.555333.90373F242400TLBO2600.000012600.000212600.000012600.000110.00011ANIA2600.000012600.000322600.000122600.000110.00011GWO2700.000012714.101822708.799432708.850132.74112F252500TLBO2700.000012700.000012700.000012700.000010.00001ANIA2700.000012718.152532700.000012700.902623.37513GWO2700.147312800.533332700.389422721.9194341.49593F262600TLBO2700.252332800.016512700.455832704.3640119.51571ANIA2700.160222800.024722700.306612706.1728223.69252GWO3111.057433484.791213301.787223289.96041103.67341F272700TLBO3100.831723838.167933103.065313298.34572255.61503ANIA3100.823713652.480223443.578833413.48653157.38442GWO3599.166014069.555613737.832713757.25861103.01731F282800TLBO3706.339534904.342234114.123434153.24283277.91123ANIA3652.801524373.160323804.642323842.26752149.62152GWO11224.3736313916520.7881225055.45023531028.069812536376.25132F292900TLBO3826.6317223372056.624435167.431224654599.924337306802.89203ANIA3822.9441110828242.843514817.99781593081.329222388353.55241GWO10111.9591357320.2293318770.0987322198.0307310629.27723F303000TLBO4538.7699212010.759615877.882626447.485021861.87212ANIA3920.4618116226.066125786.957816090.920411769.38911Table 5
Algorithms position via rank points for unimodal functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO9(3)9(3)9(3)9(3)9(3)45(3)10TLBO4(1)6(2)4(1)6(2)6(2)26(2)ANIA5(2)3(1)5(2)3(1)3(1)19(1)GWO9(3)9(3)9(3)9(3)9(3)45(3)30TLBO3(1)6(2)4(1)5(2)5(2)23(2)ANIA6(2)3(1)5(2)4(1)4(1)22(1)GWO18(3)18(3)18(3)18(3)18(3)90(3)Over AllTLBO7(1)12(2)8(1)11(2)11(2)49(2)ANIA11(2)6(1)10(2)7(1)7(1)41(1)Table 6
Algorithms position via rank points for multimodal functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO33(3)37(3)32(3)33(3)31(3)166(3)10TLBO29(2)24(2)30(2)31(2)27(2)141(2)ANIA15(1)16(1)15(1)14(1)20(1)80(1)GWO28(2)31(3)26(2)28(2)29(3)142(2)30TLBO30(3)27(2)31(3)32(3)27(2)147(3)ANIA19(1)20(1)21(1)18(1)22(1)100(1)GWO61(3)68(3)58(2)61(2)60(3)308(3)Over AllTLBO59(2)51(2)61(3)63(3)54(2)288(2)ANIA34(1)36(1)36(1)32(1)42(1)180(1)Table 7
Algorithms position via rank points for hybrid functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO18(3)17(3)18(3)18(3)16(3)87(3)10TLBO8(1)11(2)8(1)7(1)10(1)44(1)ANIA10(2)8(1)10(2)11(2)10(1)49(2)GWO17(3)17(3)17(3)16(3)15(3)82(3)30TLBO11(2)11(2)11(2)12(2)12(2)57(2)ANIA8(1)8(1)8(1)8(1)9(1)41(1)GWO35(3)34(3)35(3)34(3)31(3)169(3)Over AllTLBO19(2)22(2)19(2)19(1)22(2)101(2)ANIA18(1)16(1)18(1)19(1)19(1)90(1)Table 8
Algorithms position via rank points for composite functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO19(3)24(3)22(3)23(3)19(3)107(3)10TLBO16(2)13(2)14(2)13(2)15(2)71(2)ANIA12(1)10(1)11(1)11(1)13(1)57(1)GWO18(3)18(3)20(3)18(3)18(3)92(3)30TLBO15(2)14(1)14(2)14(1)15(2)72(2)ANIA10(1)15(2)12(1)14(1)13(1)64(1)GWO37(3)42(3)42(3)41(3)37(3)199(3)Over AllTLBO31(2)27(2)28(2)27(2)30(2)143(2)ANIA22(1)25(1)23(1)25(1)26(1)121(1)Table 9
Algorithms positions via their rank points.
DimAlgorithmBestWorstMedianMeanStdTotalGWO7938738138337534053D10TLBO5725425625725822822ANIA4213714113914612051GWO7237537237137133613D30TLBO5925826026325922992ANIA4314614614414812271GWO151316231533154314637663Over allTLBO116211221162120211725812ANIA8518318718319414321Figure 2
Comparison via Convergence Graphs for Problems F01-F06 with D10 and D30.Figure 3
Comparison via Convergence Graphs for Problems F07-F12 with D10 and D30.Figure 4
Comparison via Convergence Graphs for Problems F13-F18 with D10 and D30.Figure 5
Comparison via Convergence Graphs for Problems F19-F24 with D10 and D30.Figure 6
Comparison via Convergence Graphs for Problems F25-F30 with D10 and D30.


### 4.3. Computational Time Complexity

Time taken by an algorithm while simulating the experiments is called computational time complexity. An increase in it reduces the importance of the algorithm. For various suits, different procedures for calculation are proposed. In the current research benchmark functions suit CEC-2014 is taken, for which computation time complexity has been evaluated based on various time factors. The following is the illustration of these factors:(i)
T0: It is the time taken by used system while processing Algorithm 2.(ii)
T1: It is the computation time of 200000 function evolutions for F18 corresponds to tested dimensions.(iii)
T2: It is the computation time of algorithm while consuming 200000 function evolutions for F18 corresponds to the attempted dimensions.(iv)
T2^: Repeat the process of calculating T1 five time and nominate the mean as T2^.Algorithm 2: Program for calculating T0.
1.
tic;2.
for j = 1:10000003.
x=0.55+doublei;4.
x=x+x;5.
x=x/2;6.
x=x∗x;7.
x=x;8.
x=logx;9.
x=expx;10.
x=x/x+1;11.
end for12.
T0=toc;Table10 reflects the computational time complexity for the compared algorithms via discussed factors for the competitors.Table 10
Algorithms computational time complexity.
DimAlgorithmT0T1T2^T2^−T1/T0GWO5.446240.260000.741660.08844D10TLBO5.438310.258730.522380.04848ANIA5.481960.297231.331790.18872GWO5.455651.007711.772750.14023D30TLBO5.467491.005981.364930.06565ANIA5.496531.049672.269760.22197


## 4.1. System Specification and Parameters Setting for Conducting Simulations

Experiments are conducted with a system having Window 10, Intel(R) Core(TM) i3-7100U CPU @ 2.40 GHz, and 8 GB RAM, and simulation environment isMATLAB® 2013a. Parameters are set as: size of population = 100, dimension (D) of the problems = 10 and 30, maximum function evaluations = 10000 × D, and independent runs = 51 to each problem correspond to taken dimensions.


## 4.2. Comparison via Rank Points and Convergence Graphs

All algorithms are compared based on the staticsBest, Worst, Median, Mean, and Std which are the minimum, maximum, median, mean, and standard deviation of 51 obtained the best solution fitness values corresponds to each run for a problem, respectively. Algorithms are ranked based on user statistics. For compared algorithms, rank points are displayed in parenthesis Table 2 beside Table 3 each statistic. Tables 1–4 reflect the comparison and ranking of the competitors GWO, TLBO, and ANIA via mentioned statistics. Table 5 shows positions of algorithms via the sum of rank points for unimodal functions. Table 6 illustrates positions of competitors via the sum of rank points for multimodel functions. Table 7 demonstrates positions of contestants via the sum of rank points for hybrid functions. Table 8 exhibits positions of rivals via the sum of rank points for composite functions. Table 9 presents the sum of rank points corresponding to various statistics used for analysis with D10, D30, and overall. Convergence graphs for each problem of the testedsuit are included in Figures 2–6, which exhibits the average progress of the opponents through the optimization process.Table 1
Comparison of Algorithms for Problems F01-F20 with D10.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO81795.519733704593.85303364780.00833687972.32593836307.21263F01100TLBO100.5677176011.598621471.345325665.9765215399.78772ANIA117.5871235114.108011439.958113088.636816831.09881GWO755.9075328364.436735542.401536307.948834995.62353F02200TLBO200.00022514.78542200.17571208.1722244.11092ANIA200.00011250.24651200.52402204.5614110.52671GWO311.992231531.52623567.52233702.50813354.53263F03300TLBO300.00001303.48112300.01661300.152820.52582ANIA300.00012300.72161300.01852300.076210.12531GWO401.08943435.77353435.18213433.274037.84191F04400TLBO400.00001434.78031434.78031422.4183116.25383ANIA400.00001434.78031434.78031426.5952214.17412GWO520.21453520.50723520.35963520.359830.06841F05500TLBO501.15512520.47522520.29691519.219624.23692ANIA500.00001520.45031520.31042518.759615.31813GWO600.22293603.32502601.28242601.410820.76922F06600TLBO600.02271605.29713601.82333601.942631.27543ANIA600.07682602.97591600.63101600.928110.74971GWO700.07673702.14963700.65103700.616130.34403F07700TLBO700.04432700.41342700.15492700.156220.07852ANIA700.02461700.25581700.09591700.113210.05701GWO803.00132832.06703807.35352809.625127.10903F08800TLBO804.97483822.88402811.93953812.349234.50342ANIA801.98991817.90921806.96471807.181313.59001GWO903.01412933.52903909.09683911.165336.49393F09900TLBO903.97983921.88912908.95462910.515323.94612ANIA901.98991920.89401905.96981907.257313.87031GWO1017.309532147.995731172.167821223.97162205.05453F101000TLBO1015.580321954.788521305.700831334.97443200.55392ANIA1010.307311532.197611149.278311170.02391128.51591GWO1100.565612528.510031485.618621587.99592386.18743F111100TLBO1116.445832023.269511605.937531604.92023227.93172ANIA1103.602322105.064321407.936211417.21491191.64571GWO1200.709331201.621331201.132631201.127930.20162F121200TLBO1200.115621200.733311200.385221200.388020.14431ANIA1200.034911200.905221200.215911200.337110.26973GWO1300.067131300.309731300.141431300.147830.04892F131300TLBO1300.040021300.282221300.121121300.129520.05303ANIA1300.034511300.160911300.091311300.096710.03081GWO1400.047221400.716021400.132511400.174720.14513F141400TLBO1400.132531400.790731400.236431400.255430.11302ANIA1400.044211400.335611400.132821400.149410.06931GWO1500.583931503.385631501.857831501.755130.74793F151500TLBO1500.407621502.153321500.937421500.973320.39052ANIA1500.370311501.274711500.739511500.770310.24331GWO1601.072821603.528231602.221221602.190420.50272F161600TLBO1601.497031603.029411602.389631602.293030.37501ANIA1600.540011603.040921601.745011601.784510.55683GWO2170.5742314742.128137714.510537090.536533505.72323F171700TLBO1728.594212646.263921880.623311934.82681177.63642ANIA1744.979422232.391611976.938621976.57612129.09681GWO1917.8042320211.497238819.706239864.764135333.97593F181800TLBO1801.103911881.169921827.869921828.3262117.49381ANIA1802.240021867.309411823.687311830.2198219.41282GWO1901.022131903.424921901.859031902.046230.58211F191900TLBO1900.233921904.223231901.508021901.605120.70523ANIA1900.104311903.000911901.505611901.504210.66762GWO2014.928832221.061032086.164832094.4122344.79163F202000TLBO2000.851112062.635312013.333912018.7839115.41662ANIA2002.871822076.186722019.618422023.1340215.34301Table 2
Comparison of algorithms for problems F21-F30 with D10.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO2336.9459315460.517234030.343435646.242533610.14133F212100TLBO2100.051612353.505022134.601512157.5129158.88131ANIA2100.824522291.492312158.672422171.3100266.47402GWO2223.022032367.278832238.880132253.1355344.02603F222200TLBO2203.394222238.859712223.624512223.988714.61831ANIA2201.566012344.255322223.805122227.3582218.83122GWO2629.458532635.033632629.495532629.679630.81033F232300TLBO2629.457512629.457512629.457512629.457510.00001ANIA2629.457512629.457512629.457512629.457510.00001GWO2500.207812535.198232516.337422516.718426.84993F242400TLBO2507.111032534.227922518.541832518.844935.54112ANIA2506.746622526.082912514.611612515.141314.29371GWO2600.029412702.467632700.906132693.1267322.61041F252500TLBO2617.884832701.526222638.621622651.9466228.23852ANIA2615.619722701.374012632.842812648.3965129.64023GWO2700.053032700.237032700.115532700.118930.03352F262600TLBO2700.021612700.189822700.072412700.077710.03763ANIA2700.026822700.141212700.084622700.086020.02611GWO2701.565333102.248833027.822223010.49713119.09191F272700TLBO2701.433523100.680222704.071612847.38851189.69233ANIA2701.068513100.471313032.023532944.54672167.78892GWO3157.177023365.106033189.167533222.8638357.10073F282800TLBO3168.850333316.416323180.627423207.0068246.87552ANIA3156.826913288.139413178.327213198.5627144.85291GWO3207.313834473.432533443.365133539.88603270.08663F292900TLBO3101.312713221.411713153.160623154.7406123.11101ANIA3124.345723277.082123148.912613156.5247231.94652GWO3491.320834847.314633680.141333800.24123294.44063F303000TLBO3472.234823955.093513614.957023640.53622116.09631ANIA3465.509214096.900223598.924613614.36711127.07002Table 3
Comparison of algorithms for problems F01-F09 with D30.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO5393003.2330357732050.8582319990492.4610321543030.3872311802589.45353F01100TLBO36797.189717001084.13792273370.36061716605.667321296300.13562ANIA60253.931222113960.83221323439.32872542911.85511517335.49911GWO5029622.489831794673205.31393180873004.09783254068618.27603318995332.04143F02200TLBO200.00011259.10802200.35221202.724218.81311ANIA200.00592258.64771203.18092208.5397212.17362GWO526.6609311589.900034140.004734249.269732638.53603F03300TLBO300.02471561.82152303.46732314.6536240.55062ANIA300.25342388.28581303.27741310.4554118.63291GWO470.55623759.31243556.30143556.1383344.90723F04400TLBO400.00711541.92992469.79601460.7056236.44132ANIA400.19492535.68771470.70292459.5009135.63421GWO520.80533521.04383520.96263520.954230.04561F05500TLBO520.31762520.89571520.79102520.759920.11252ANIA520.11951520.93262520.45771520.557710.28333GWO606.20091616.18871611.99901611.689212.27921F06600TLBO615.04883629.69493621.42453621.613233.12263ANIA611.41862625.51702617.05842616.780723.09462GWO700.88893709.44383703.00703703.442831.97773F07700TLBO700.00001700.19082700.02221700.035520.04382ANIA700.00001700.17851700.02462700.035110.04091GWO825.39511982.62733852.76012858.6289221.73823F08800TLBO851.73773924.36962893.52593892.7845315.38142ANIA827.85882898.50061849.74791849.9841114.04681GWO934.521621121.77943971.72982988.1362245.14813F09900TLBO962.682331065.16232998.50063997.3691321.23242ANIA924.87401988.55101953.72771954.6354112.63721Table 4
Comparison of algorithms for problems F10-F30 with D30.
P.NoOptAlgorithmBestWorstMedianMeanStdGWO1678.864516647.149032788.448612962.26101963.02633F101000TLBO3034.270035234.278624198.630134215.60103568.05992ANIA2469.104125221.919713903.755923911.64062546.79561GWO2674.346318588.896334103.971114799.783431790.69043F111100TLBO3149.349036094.918624452.542434441.80112636.19612ANIA2862.870925312.620614274.488024231.02171552.44581GWO1201.588931203.013431202.491531202.486230.29482F121200TLBO1200.327521201.719021201.062121201.098320.27691ANIA1200.200511201.642511200.877411200.867510.32553GWO1300.182221300.626121300.285211300.306910.08002F131300TLBO1300.210031300.730731300.457431300.444530.12623ANIA1300.174411300.451511300.325321300.316720.07711GWO1400.180731400.915621400.277721400.363130.21043F141400TLBO1400.121911400.363011400.265211400.260610.05961ANIA1400.154121401.029131400.304031400.335720.15832GWO1505.565131549.064311515.206921515.025217.29491F151500TLBO1505.221521553.704421522.353431524.1972311.90813ANIA1503.985711553.816531514.033511516.078728.96432GWO1609.661121611.946011610.998521610.974520.55521F161600TLBO1609.717331612.604531611.424831611.381330.58032ANIA1608.588311611.981021610.816511610.665910.71743GWO65632.798632933308.18873475736.95453635492.83423547262.26803F171700TLBO4322.76312138224.9388213405.8973219134.3675225206.85262ANIA4273.8658182021.991819433.5584114477.6127113729.24521GWO2597.058031620704.8420315542.3182385843.80413243904.39503F181800TLBO1915.9317216126.669723008.147024526.941723420.36992ANIA1888.1759112959.545512511.911913624.195212443.77101GWO1907.628331996.689331912.669931916.3712214.68432F191900TLBO1906.696621987.836221911.784521916.5371317.27113ANIA1906.346711916.625411910.681911911.026412.30841GWO2169.612938893.608632390.339032811.835431556.03363F202000TLBO2073.793012618.718312268.466612283.48741105.45711ANIA2079.257722642.951822319.620022325.73942117.12612GWO15646.223931018922.20903120397.76103187179.59663200174.80843F212100TLBO3068.8556123112.758616090.220617359.087014178.46041ANIA3146.6994233630.100326913.454928274.090025905.66782GWO2262.809422805.733922491.753422482.58462116.39801F222200TLBO2345.675632866.203432508.185432541.54563138.27793ANIA2223.235212723.224612421.700612439.99931126.39662GWO2616.497332624.429432619.226432619.435931.80603F232300TLBO2615.244112615.244112615.244112615.244110.00001ANIA2615.244112615.244112615.244112615.244110.00001GWO2600.004832627.886432600.008132600.555333.90373F242400TLBO2600.000012600.000212600.000012600.000110.00011ANIA2600.000012600.000322600.000122600.000110.00011GWO2700.000012714.101822708.799432708.850132.74112F252500TLBO2700.000012700.000012700.000012700.000010.00001ANIA2700.000012718.152532700.000012700.902623.37513GWO2700.147312800.533332700.389422721.9194341.49593F262600TLBO2700.252332800.016512700.455832704.3640119.51571ANIA2700.160222800.024722700.306612706.1728223.69252GWO3111.057433484.791213301.787223289.96041103.67341F272700TLBO3100.831723838.167933103.065313298.34572255.61503ANIA3100.823713652.480223443.578833413.48653157.38442GWO3599.166014069.555613737.832713757.25861103.01731F282800TLBO3706.339534904.342234114.123434153.24283277.91123ANIA3652.801524373.160323804.642323842.26752149.62152GWO11224.3736313916520.7881225055.45023531028.069812536376.25132F292900TLBO3826.6317223372056.624435167.431224654599.924337306802.89203ANIA3822.9441110828242.843514817.99781593081.329222388353.55241GWO10111.9591357320.2293318770.0987322198.0307310629.27723F303000TLBO4538.7699212010.759615877.882626447.485021861.87212ANIA3920.4618116226.066125786.957816090.920411769.38911Table 5
Algorithms position via rank points for unimodal functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO9(3)9(3)9(3)9(3)9(3)45(3)10TLBO4(1)6(2)4(1)6(2)6(2)26(2)ANIA5(2)3(1)5(2)3(1)3(1)19(1)GWO9(3)9(3)9(3)9(3)9(3)45(3)30TLBO3(1)6(2)4(1)5(2)5(2)23(2)ANIA6(2)3(1)5(2)4(1)4(1)22(1)GWO18(3)18(3)18(3)18(3)18(3)90(3)Over AllTLBO7(1)12(2)8(1)11(2)11(2)49(2)ANIA11(2)6(1)10(2)7(1)7(1)41(1)Table 6
Algorithms position via rank points for multimodal functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO33(3)37(3)32(3)33(3)31(3)166(3)10TLBO29(2)24(2)30(2)31(2)27(2)141(2)ANIA15(1)16(1)15(1)14(1)20(1)80(1)GWO28(2)31(3)26(2)28(2)29(3)142(2)30TLBO30(3)27(2)31(3)32(3)27(2)147(3)ANIA19(1)20(1)21(1)18(1)22(1)100(1)GWO61(3)68(3)58(2)61(2)60(3)308(3)Over AllTLBO59(2)51(2)61(3)63(3)54(2)288(2)ANIA34(1)36(1)36(1)32(1)42(1)180(1)Table 7
Algorithms position via rank points for hybrid functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO18(3)17(3)18(3)18(3)16(3)87(3)10TLBO8(1)11(2)8(1)7(1)10(1)44(1)ANIA10(2)8(1)10(2)11(2)10(1)49(2)GWO17(3)17(3)17(3)16(3)15(3)82(3)30TLBO11(2)11(2)11(2)12(2)12(2)57(2)ANIA8(1)8(1)8(1)8(1)9(1)41(1)GWO35(3)34(3)35(3)34(3)31(3)169(3)Over AllTLBO19(2)22(2)19(2)19(1)22(2)101(2)ANIA18(1)16(1)18(1)19(1)19(1)90(1)Table 8
Algorithms position via rank points for composite functions.
DimAlgorithmBestWorstMedianMeanStdTotalGWO19(3)24(3)22(3)23(3)19(3)107(3)10TLBO16(2)13(2)14(2)13(2)15(2)71(2)ANIA12(1)10(1)11(1)11(1)13(1)57(1)GWO18(3)18(3)20(3)18(3)18(3)92(3)30TLBO15(2)14(1)14(2)14(1)15(2)72(2)ANIA10(1)15(2)12(1)14(1)13(1)64(1)GWO37(3)42(3)42(3)41(3)37(3)199(3)Over AllTLBO31(2)27(2)28(2)27(2)30(2)143(2)ANIA22(1)25(1)23(1)25(1)26(1)121(1)Table 9
Algorithms positions via their rank points.
DimAlgorithmBestWorstMedianMeanStdTotalGWO7938738138337534053D10TLBO5725425625725822822ANIA4213714113914612051GWO7237537237137133613D30TLBO5925826026325922992ANIA4314614614414812271GWO151316231533154314637663Over allTLBO116211221162120211725812ANIA8518318718319414321Figure 2
Comparison via Convergence Graphs for Problems F01-F06 with D10 and D30.Figure 3
Comparison via Convergence Graphs for Problems F07-F12 with D10 and D30.Figure 4
Comparison via Convergence Graphs for Problems F13-F18 with D10 and D30.Figure 5
Comparison via Convergence Graphs for Problems F19-F24 with D10 and D30.Figure 6
Comparison via Convergence Graphs for Problems F25-F30 with D10 and D30.


## 4.3. Computational Time Complexity

Time taken by an algorithm while simulating the experiments is called computational time complexity. An increase in it reduces the importance of the algorithm. For various suits, different procedures for calculation are proposed. In the current research benchmark functions suit CEC-2014 is taken, for which computation time complexity has been evaluated based on various time factors. The following is the illustration of these factors:(i)
T0: It is the time taken by used system while processing Algorithm 2.(ii)
T1: It is the computation time of 200000 function evolutions for F18 corresponds to tested dimensions.(iii)
T2: It is the computation time of algorithm while consuming 200000 function evolutions for F18 corresponds to the attempted dimensions.(iv)
T2^: Repeat the process of calculating T1 five time and nominate the mean as T2^.Algorithm 2: Program for calculating T0.
1.
tic;2.
for j = 1:10000003.
x=0.55+doublei;4.
x=x+x;5.
x=x/2;6.
x=x∗x;7.
x=x;8.
x=logx;9.
x=expx;10.
x=x/x+1;11.
end for12.
T0=toc;Table10 reflects the computational time complexity for the compared algorithms via discussed factors for the competitors.Table 10
Algorithms computational time complexity.
DimAlgorithmT0T1T2^T2^−T1/T0GWO5.446240.260000.741660.08844D10TLBO5.438310.258730.522380.04848ANIA5.481960.297231.331790.18872GWO5.455651.007711.772750.14023D30TLBO5.467491.005981.364930.06565ANIA5.496531.049672.269760.22197


## 5. Discussion

In this paper performance-based advance amalgam of NIAs, GWO and TLBO are proposed for solving single-objective large-scale global optimization problems CEC-2014 by the name ANIA. ANIA is compared and ranked via various statistics with its parent algorithms i.e. GWO and TLBO. For discussion purposes, functions are classified into unimodal, multimodal, hybrid, and composite, in order to judge the efficiency and robustness of the contestants for various types of function. Discussion for D10, D30, overall, convergence graphs, and computation time complexity is done in the following.For unimodal functionsF01−F03 of CEC-2014, GWO, TLBO, and ANIA secured 45, 26, and 19 rank points in total for D10 and hence placed as 3rd, 2nd, and 1st, respectively. For D30 GWO, TLBO, and ANIA got 45, 23, and 22 rank points in total and hence secured 3rd, 2nd, and 1st positions, respectively. Overall view for these problems is that GWO, TLBO, and ANIA acquired 90, 49, and 41 rank points in total and hence stood as 3rd, 2nd, and 1st, respectively. This can be checked from Table 5.For multimodal functionsF04−F16 of CEC-2014, GWO, TLBO, and ANIA obtained 166, 141, and 80 rank points in total for D10 and hence ranked as 3rd, 2nd, and 1st, respectively. For D30 GWO, TLBO, and ANIA acquired 142, 147, and 100 rank points in total and hence gained 2nd, 3rd, and 1st positions, respectively. Overall view for these problems is that GWO, TLBO, and ANIA secured 308, 288, and 180 rank points in total and hence came by 3rd, 2nd, and 1st, respectively. It can be demonstrated from Table 6.For hybrid functionsF17−F22 of CEC-2014, GWO, TLBO, and ANIA obtained 87, 44, and 49 rank points in total for D10 and hence stood as 3rd, 1st, and 2nd, respectively. For D30 GWO, TLBO, and ANIA attained 82, 57, and 41 rank points in total and hence secured 3rd, 2nd, and 1st positions, respectively. Overall view for these problems is that GWO, TLBO, and ANIA acquired 169, 101, and 90 rank points in total and hence obtained 3rd, 2nd, and 1st positions, respectively. This can be analyzed from Table 7.For composite functionsF23−F30 of CEC-2014, GWO, TLBO, and ANIA gained 107, 71, and 57 rank points in total for D10 and hence placed as 3rd, 1st, and 2nd, respectively. For D30 GWO, TLBO, and ANIA secured 92, 72, and 63 rank points in total and hence came by 3rd, 2nd, and 1st, respectively. Overall view for these problems is that GWO, TLBO, and ANIA acquired 199, 143, and 121 rank points in total and hence stood as 3rd, 2nd, and 1st, respectively. This can be examined from Table 8.Dimension wise comparison based on total rank points of opponents for CEC-2014 demonstrates that GWO, TLBO, and ANIA acquired 404, 282, and 205 for D10, 361, 299, 227 for D30 and hence placed as3rd, 2nd, and 1st at all attempted dimensions, respectively. The overall positioning of GWO, TLBO, and ANIA, are 3rd, 2nd, and 1st since they attained 766, 581, and 432 rank points in total. This can be seen from Table 9.The Convergence graphs displayed by the proposed ANIA by each solving the benchmark functions in n=10 dimensions as denoted by F01, F05, F08-F16, F19, F25, F28, and F30 are promising in terms of proximity and diversity. Similarly, the proposed algorithm has tackled the benchmark functions, namely, F01, F05, F08, F09, F11, F12, F16-F19, F22, and F30 and produced efficient convergence graphs in thirty dimensions. Moreover, the proposed ANIA algorithm has provided a better convergence graph by solving each of the used benchmark function in n=50 dimensions as compared to their constituent algorithms. This can be seen from Figures2-4.Computational time complexity is reflected by Table10 with the remarks that GWO, TLBO, and ANIA are ranked as 2nd, 1st, and 3rd at both tested dimensions, respectively. Table 10 reflects that the computational time complexity of the ANIA is slightly higher than the other competitors.


## 6. Conclusion and Future Work

Since the inception of the first Genetic Algorithm developed in 1940, many diverse types of evolutionary algorithms (EAs) are suggested in the existing literature of evolutionary computing. However, different EAs performed differently on various types of benchmark functions and real-world problems. To overcome the drawbacks of stand-alone algorithms, use of multiple EAs in a single framework is a trending idea in the current generation of EC. In this paper, we proposed an advanced amalgam of the nature-inspired algorithm (ANIA) for solving high-dimensional global optimization problems. The performance of ANIA and its parent algorithms i.e. GWO and TLBO are examined upon the test suit of benchmark functions as designed for IEEE CEC-2014. These challenging problems are solved by the competitors with D10 and D30. ANIA has performed significantly better on most of the used benchmark functions in terms of fast convergence and sufficient diversity. The numerical results obtained by ANIA enable us to conclude that the proposed algorithm is better than GWO and TLBO that reflecting the importance of the proposed concept of the amalgam.In future research work, we intend to find out the efficiency of the proposed algorithm with other unconstrained test suites and engineering problems. The idea of ANIA can be extended to constrained optimization. Furthermore, we will implement the current concept of amalgam to other two or more than two NIAs to check its global compatibility.



---

*Source: 7675788-2022-07-01.xml*