Next Article in Journal
Fourier Spectral High-Order Time-Stepping Method for Numerical Simulation of the Multi-Dimensional Allen–Cahn Equations
Previous Article in Journal
On Convergence Analysis and Analytical Solutions of the Conformable Fractional Fitzhugh–Nagumo Model Using the Conformable Sumudu Decomposition Method
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Improved Transient Search Optimization with Neighborhood Dimensional Learning for Global Optimization Problems

1
School of Electronics and Information Engineering, Hebei University of Technology, Tianjin 300401, China
2
School of Mechanical Engineering, Hebei University of Technology, Tianjin 300401, China
*
Authors to whom correspondence should be addressed.
Symmetry 2021, 13(2), 244; https://doi.org/10.3390/sym13020244
Submission received: 16 January 2021 / Revised: 28 January 2021 / Accepted: 29 January 2021 / Published: 1 February 2021
(This article belongs to the Section Computer)

Abstract

:
The transient search algorithm (TSO) is a new physics-based metaheuristic algorithm that simulates the transient behavior of switching circuits, such as inductors and capacitors, but the algorithm suffers from slow convergence and has a poor ability to circumvent local optima when solving high-dimensional complex problems. To address these drawbacks, an improved transient search algorithm (ITSO) is proposed. Three strategies are introduced to the TSO. First, a chaotic opposition learning strategy is used to generate high-quality initial populations; second, an adaptive inertia weighting strategy is used to improve the exploration ability, exploitation ability, and convergence speed; finally, a neighborhood dimensional learning strategy is used to maintain population diversity with each iteration of merit seeking. The Friedman test and Wilcoxon’s rank sum test were also used by comparing the experiments with recently popular algorithms on 18 benchmark test functions of various types. Statistical results, nonparametric sign tests, and convergence curves all indicate that ITSO develops, explores, and converges significantly better than other popular algorithms, and is a promising intelligent optimization algorithm for applications.

1. Introduction

Due to the rapid development of engineering technology, global optimization problems are widely found in the fields of economic scheduling [1,2], portfolio investment [3], image processing [4], mechanical design [5], neural networks [6,7], data mining [8,9], etc., whereas traditional algorithms can only effectively handle those optimization problems with typical mathematical characteristics [10]. However, a large number of global optimization problems in practical applications are high-latitude, large-scale, and without typical mathematical features. Thus, scholars have proposed metaheuristic algorithms [11], which have shown significant superiority in practical applications and promoted the development of science and technology and engineering applications [12,13].
Most of the common metaheuristic algorithms are classified as evolutionary algorithms, swarm intelligence algorithms, and physics-based algorithms [14]. Evolutionary algorithms are inspired by biological evolutionary processes [15]. The widely used evolutionary algorithm is the genetic algorithm (GA) [16], which simulates Darwinian evolutionary theory by simulating the iterative update of the biological evolutionary process, updating the optimal individual each time to obtain a better solution. Differential evolution (DE) [17], genetic planning (GP) [18], evolutionary strategies (ES) [19], the biogeography-based optimizer (BBO) [20], fast evolutionary planning (FEP) [21], and their improved variants, have also been widely used. Swarm intelligence algorithms simulate the group behavior of animals and hunt according to group cooperation [22]. More commonly, this is done by mimicking the natural behavior of flocks of birds, whales, bee colonies, and other group organisms [23]. The classical approach is the particle swarm algorithm (PSO), which simulates the predatory and cooperative behaviors of bird groups and individuals, and performs well in solving complex optimization problems [24]. Other common swarm intelligence algorithms are ant colony optimization (ACO), which mimics the search for food and group cooperation behavior of ant colonies [25]; the whale optimization algorithm (WOA), which is inspired by the spiral bubble feeding and group collaboration of whales [26]; and the marine predator algorithm (MPA), which simulates hunting behaviors such as Brownian motion and Lévy flight of marine organisms [27]. In addition, the bat algorithm (BA) [28], cuckoo search (CS) [29], artificial bee colony (ABC) [30], the gray wolf optimization algorithm (GWO) [31], the seagull optimization algorithm (SOA) [32], the coyote optimization algorithm (COA) [33], the tern bird optimization algorithm (STOA) [34], the dolphin echolocation algorithm (DEA) [35], the krill swarm algorithm (KHA) [36], the emperor penguin optimization algorithm (EPO) [37], and the parasitic predation algorithm (PPA) [38] are some of the algorithms that have received a large amount of attention. Physics-based algorithms mainly model physical rules, more commonly using physical concepts and laws, such as the law of refraction of light, gravity, gravity and electrical circuits [39]. The common gravitational search algorithm (GSA) arises from Newton’s law of gravity [40]; the charged-system search algorithm (CSS) charged-system-search is inspired by Newton’s rules of motion and Coulomb’s rule [41]; and the ray optimization algorithm (RO) [42] simulates Snell’s law of refraction of light. The big bang big crunch (BB-BC) [43], atomic search optimization (ASO) [44], and Henry gas solubility optimization (HGSO) [45] have also been widely used in solving optimization problems.
According to the theory of no free lunch [46], it is known that no optimization algorithm is guaranteed to solve all optimization problems efficiently. Therefore, in 2020, Mohammed et al. proposed a novel physics-based transient search algorithm (TSO) [47], which simulates the transient behavior of storage circuits, such as capacitor–inductors, with simple mathematical models and flowcharts and small computational complexity. Applying it to the optimization problem of the three-diode model (TDM) of Photovoltaic (PV) modules, TSO shows better superiority compared to other algorithms [48]. To address the problem that traditional sentiment analysis methods based on word co-occurrence frequencies perform poorly in most practical situations, Dashtipour et al. [49] proposed a new hybrid framework for concept-level sentiment analysis in Persian, which optimizes polarity detection using deep learning and linguistic rules.
Like most metaheuristic algorithms, TSO shows good performance when dealing with low-dimensional small-scale optimization problems [50]. However, when dealing with high-dimensional complex problems, TSO faces the challenges of being prone to local optima and slow convergence. The problems of TSO are as follows: the exploitation capability tends to local extrema on high-dimensional multi-peaked functions; the exploration capability is not fine-grained enough to solve well for the global optimum; the inertia weights of constant values cannot balance the exploitation and exploration behaviors, which also leads to slow convergence; and the diversity of populations is gradually missing with the increase in iterations.
In this paper, we propose an improved transient search algorithm (ITSO) to address the above problems. First, the randomized generation of the initial population can easily generate the population with concentrated distribution, which will lead to premature convergence of the algorithm. Thus, this paper adopts a chaotic logistic contrastive learning strategy for generating a high-quality initial population. Furthermore, to balance the global extensive search and local fine search, adaptive inertia weights are introduced that can effectively enhance the exploration and exploitation ability of the algorithm, in addition to accelerating the convergence speed. Finally, due to the increase in the number of iterations, the diversity of the population decreases, which leads the algorithm to fall into a local optimum, and the introduction of the neighbor dimensional learning strategy ensures that the population has diversity throughout the iterative process.
To verify the effectiveness of the ITSO, 18 internationally recognized benchmark test functions were selected and compared experimentally with nine recognized metaheuristics and seven improved optimization algorithms. These nine recognized metaheuristics are TSO, GA, DE, PSO, GWO, WOA, PPA, SOA, and STOA. The other seven improved optimization algorithms are Autonomous Groups Particle Swarm Optimization (AGPSO) [51], Modified Particle Swarm Optimization (MPSO) [52], the Opposition-Based Sine Cosine Algorithm (OBSCA) [53], the hybrid algorithm of the Particle Swarm Optimization and Gravitational Search Algorithm (PSOGSA) [54], the Chaotic Grey Wolf Optimization algorithm (CGWO) [55], the hybrid algorithm based on Grey Wolf Optimizer and Cuckoo Search (GWOCS) [56], and Improved Grey Wolf Optimizer (IGWO) [12]. For all experimental data, the Friedman test and Wilcoxon’s rank sum test were also used to verify the superiority and significant competitiveness of the ITSO. Experimental results show that these three strategies can effectively improve the performance of TSO, and ITSO shows significant superiority in solving global optimization problems.
This paper is structured as follows. Section 2 briefly describes the TSO. Section 3 elaborates the proposed ITSO. The application of ITSO to parameter selection and benchmark function testing is presented in Section 4. Section 5 concludes and provides an outlook for the paper.

2. Transient Search Algorithm

2.1. Background Information

Circuits containing a single storage element capacitor or inductor are called first-order circuits. The switching of these circuits cannot instantaneously change the process to the next steady state, when the capacitor or inductor needs time to charge or discharge until it reaches its steady-state value. The transient response of a first-order circuit can be calculated from the differential equation, as shown in Equation (1):
d d t x ( t ) + x ( t ) τ = K where   τ = R C   or   τ = L R
where t is the current moment, x ( t ) is the capacitive voltage of the RC circuit or the inductive current of the RL circuit, τ is the circuit time constant, and K is a constant.
Solving Equation (1) yields the solution of its differential equation in the form shown in Equation (2):
x ( t ) = x ( ) + ( x ( 0 ) x ( ) ) e t τ
where x ( 0 ) denotes the initial response value and x ( ) denotes the final response.
The responses of the second-order circuits are all underdamped responses, and the mathematical expressions of the differential equations for their transient responses are shown below:
d 2 d t 2 x ( t ) + 2 α d d t x ( t ) + w 0 2 x ( t ) = f ( t )
where α is the damping factor and w 0 is the resonant frequency.
The expression for the solution of the differential equation of Equation (3) is given in the following equation:
x ( t ) = e α t ( B 1 cos ( 2 π f d t ) + B 2 sin ( 2 π f d t ) ) + x ( )
where B 1 and B 2 are constants and f d denotes the damped resonant frequency. When α < ω 0 , an underdamped response occurs at this point, resulting in a damped oscillation in the transient response of the RLC circuit.

2.2. Mathematical Models

Firstly, for the generation of the initial population, a randomization inside the search boundary is taken to generate the location of each search agent with the following mathematical expression:
X i j = l b +   r × ( u b l b )   i = 0 N ,   j = 0 d
where X i j represents the coordinates of the j-th dimension of the i-th population, N is the number of search agents, d is the dimensionality of the problem to be optimized, r is a random number conforming to a uniform distribution, and ub and lb are the upper and lower boundaries of the search space, respectively.
The search for the optimal solution is exploration and it is inspired by the oscillation of the second-order Resistance, Inductance, Capacitance (RLC) circuit near the zero point and by the mathematical expression of Equation (4), which is as follows:
X ( t + 1 ) = X ( t ) + e T [ cos ( 2 π T ) + sin ( 2 π T ) ] | X ( t ) C 1 X ( t ) |
where X ( t + 1 ) denotes the position of the current agent at the next moment, X ( t ) represents the position of the current best agent, X ( t ) denotes the current position, and T and C 1 are random coefficients.
The mathematical expressions for T and C 1 are shown below:
T = 2 × z × r 1 z
C 1 = k × z × r 2 + 1
where both r 1 and r 2 are random numbers that conform to a uniform distribution between [0, 1] and z is a variable that decreases linearly from 2 to 0.
The mathematical expression for z is as follows:
z = 2 2 t M a x _ i t e r
where M a x _ i t e r represents the maximum number of iterations.
Exploitation is the process of algorithmic local fine search, and TSO exploitation is the process of simulating the exponential decay of the primary discharge. The mathematical expression for exploitation behavior, inspired by Equation (2), is as follows:
X ( t + 1 ) = X ( t ) + [ X ( t ) C 1 · X ( t ) ] · e T
To balance the exploration and exploitation phases, a random selection rule was used, with p being a random number in [0, 1] that conforms to a uniform distribution, and the search agent performed the exploration behavior when p > 0.5 , and when p 0.5 , at which point the search agent undertook the development behavior.
The pseudo-code for TSO is shown in Algorithm 1.
Algorithm 1: TSO
Input: Number of Search Agents: N;
    Dimension: d;
    Maximum number of iterations: Max_iter
Output: The global optimum
Generate initial populations by the Equation (5)
Calculating the fitness value of the population
Filter the best search agent’s fitness value and location
Whilet < Max_iter
Calculating the value of T and C 1 by the Equations (7) and (8)
If p > 0.5
  Update the location of the search agent by the Equation (6)
Else if p 0.5
  Update the location of the search agent by the Equation (10)
End if
Calculating the fitness value of the population
Update optimal search agent position and fitness
t = t + 1
End while

3. Improved Transient Search Algorithm

3.1. Chaotic Opposition Learning

Using the random, ergodic, and regular characteristics of chaotic variables for optimization search allows the algorithm to step out of the local optimum, maintain the population diversity, and improve the global search ability, but different chaotic mappings have a significant influence on the chaotic optimization process [57]. The diversity of the initial population can significantly affect the convergence speed and accuracy of the population intelligence algorithm, but the basic TSO is prone to generating poor quality populations by randomly initializing the population, which affects the convergence speed and merit-seeking accuracy of the algorithm.
To generate high-quality initial populations, the information in the solution space is fully extracted and captured by chaotic mapping in this paper. One of the widely used mapping mechanisms in chaos theory research is logistic chaos mapping [58] with the following mathematical iterative equation:
λ t + 1 = μ × λ t ( 1 λ t ) , t = 0 , 1 , 2 , , T
where λ t is a uniformly distributed random number in the interval [0, 1] and requires λ 0 { 0 , 0.25 , 0.5 , 0.75 , 1 } , T is the predetermined maximum number of chaos iterations, and μ is the chaos control parameter. When μ = 4 , the system will be in a completely chaotic state.
Using the generated set of chaotic variables λ, the chaotic sequence is then applied to map the position vectors X of all d-dimensional search agents in turn into the upper and lower boundaries of the search space according to Equation (12), with the following mathematical expressions:
X i j = l b + λ j × ( u b l b )
where X i j is the coordinate of the j-th dimension of the i-th search agent and λ j is the coordinate of the j-th dimension of λ after internal random ordering.
Opposition-based learning, which considers that a better solution may exist on the opposite side of the problem, has been successfully applied to many algorithms, either for initial population generation or for iterative updating of search agents [59].
Although chaotic sequences can produce populations that are rich in diversity and reasonably well distributed, it is undeniable that there may be better search agents on the opposite side of the search space; then, the same number of opposing populations are produced again, as follows:
X o p _ i = X max + X min X i
where X o p _ i is the opposing position of the i-th agent, X max represents the position of the largest boundary, X min represents the position of the smallest boundary, and X i is the position of the i-th individual.
Finally, these are combined into 2N alternative populations of search agents, i.e., the population is { X , X o p } at this point, and the N populations with the best fitness are selected as the initial populations by calculating the fitness of the alternative populations.

3.2. Adaptive Inertia Weights

Inertia weights, which are inspired by particle swarm algorithms, play a decisive role in the algorithm’s merit-seeking ability and convergence speed, and it has been shown in many algorithms that the performance of the algorithm can be improved by introducing adaptive inertia weights [60]. In the original TSO algorithm, the inertia weights are constant values, which limits the algorithm’s merit-seeking ability and convergence speed. For the early iteration, large inertia weights can enhance the global search ability; in the late iteration, small inertia weights can enhance the local fine search ability and accelerate the convergence speed. The choice of inertia weighting strategy is crucial in the TSO search process, so a strategy for adaptively changing the inertia weights according to the number of iterations is proposed with the following expression:
w ( t ) = a cos b ( ln ( 1 + e t T max ) + c
where a , b, and c are optional parameters.
After extensive experiments, it was found that the best results were obtained when a , b, and c were 21, 15, and 0.4, respectively. The graph is shown in Figure 1.
As can be seen from Figure 1, in the early iteration, the inertia weight is large and decreases rapidly, which is focused on the global search; in the late iteration, the inertia weight is small and decreases slowly, which is to be more detailed in the local fine search. With the introduction of adaptive inertia weights, the distribution of exploration and exploitation behavior of ITSO proceeds according to Equations (15) and (16), with the following mathematical expressions:
X ( t + 1 ) = w ( t ) · X ( t ) + e T [ cos ( 2 π T ) + sin ( 2 π T ) ] | X ( t ) C 1 X ( t ) |
X ( t + 1 ) = w ( t ) · X ( t ) + [ X ( t ) C 1 · X ( t ) ] · e T

3.3. Neighborhood Dimensional Learning

Dimension learning-based hunting (DLH), first proposed by Mohammad et al. [12], was first used to improve the performance of GWO, which balances global and local search and maintains population diversity by sharing information among search agents. On this basis, the diversity of positions among populations is ensured by first forming an alternative population, which is used to avoid search agents from aggregating in one piece to make DLH fail. Neighbors are then found within a given distance by constructing a domain space, which is used to share dimensional information among neighbors, so the strategy is called neighbor dimensional learning (NDL).
The population diversity plays a key role in the convergence speed and accuracy of the algorithm. The population diversity of the original TSO gradually decreases with the iterations of the algorithm, which often leads to high-dimensional complex problems easily solving to a local optimum and failure to find the global optimum solution. Therefore, to ensure that the populations remain rich in diversity during each iteration, a neighbor dimension learning strategy is used.
First, at the end of each iteration of the original TSO, candidate populations of the same size are generated for the original population, and the new population is repositioned using either the optimal individual information or its own information, according to the following equation:
X C A N D _ i ( t ) = { w X ( t ) + 2 × ( r 0.5 ) × ( u b l b r + l b )   p > 0.5 w X i ( t ) + 2 × ( r 0.5 ) × ( u b l b r + l b ) p < 0.5
where X i ( t ) denotes the position vector of the i-th search agent, X C A N D _ i ( t + 1 ) denotes the position vector of the i-th candidate population individual, X ( t ) is the position vector of the elite individual, and p is the random probability.
Next, a neighborhood radius is calculated based on the Euclidean distance between the current position of X i ( t ) and the candidate position X C A N D ( t + 1 ) , which is calculated by the following equation:
R i ( t ) = | | X i ( t ) X C A N D _ i ( t + 1 ) | |
Then, according to R i ( t ) , the Euclidean distance less than the radius search agent is sequentially filtered from the population, and these individuals are saved as neighbors of the i-th individual. The mathematical expression is shown as follows:
N i ( t ) = { X j ( t ) D i ( X i ( t ) , X j ( t ) ) R i ( t ) , X j ( t ) X }
where N i ( t ) denotes the set of neighboring individuals and D i denotes the Euclidean distance operation performed.
The next step performs dimensional learning among neighbors, updating the dimensional coordinates of the current individual using some dimensional information of neighboring individuals and the dimensional information of an individual randomly selected from the entire population, with the following mathematical expression:
X N D L _ i , d ( t + 1 ) = X i , d ( t ) + sign ( r 0.5 ) × ( X n , d ( t ) X r , d ( t ) )
where X i , d ( t ) represents the d-dimensional information of the i-th search agent, X N D L _ i , d ( t + 1 ) represents the new d-dimensional information, X n , d ( t ) represents the d-dimensional information of neighboring individuals, and X r , d ( t ) represents the d-dimensional information of a randomly selected individual.
Finally, the fitness of the candidate and NDL populations is calculated to select the updated information of the individuals of the populations, and the mathematical expression is shown as follows:
X i ( t + 1 ) = { X C A N D _ i ( t + 1 )   if   f ( X C A N D _ i ( t + 1 ) ) < f ( X N D L _ i ( t + 1 ) ) X N D L _ i ( t + 1 )   if   f ( X C A N D _ i ( t + 1 ) ) < f ( X N D L _ i ( t + 1 ) )
The pseudo-code for ITSO is shown in Algorithm 2. The block diagram of the ITSO is shown in Figure 2.
Algorithm 2: ITSO
Input: Number of Search Agents: N;
     Dimension: d;
     Maximum number of iterations: Max_iter
Output: The global optimum
Generate chaotic tent mapping sequences by the Equation (11)
Initialized populations by the Equation (12)
Generation of Opposing Populations by the Equation (13)
Calculate the fitness values of the alternative populations.
The first N with good fitness values are selected as the initial populations
Whilet < Max_iter
Calculating Adaptive Inertia Weights by the Equation (14)
Calculating the value of T and C 1 by the Equations (7) and (8)
If p > 0.5
  Update the location of the search agent by the Equation (15)
Else if p 0.5
  Update the location of the search agent by the Equation (16)
End if
Generation of candidate populations by the Equation (17)
Calculating Neighborhood Radius by the Equation (18)
Finding Neighborhood Populations by the Equation (19)
Calculation of NDL populations by the Equation (20)
Calculate fitness values to update population position by the Equation (21)
Update optimal search agent position and fitness
t = t + 1
End while

4. Simulation Experiments and Comparative Analysis

4.1. Experimental Settings

To verify that the proposed ITSO shows significant superiority in solving global optimization problems, 18 internationally recognized benchmark test functions [26,61] are used for comparison experiments with nine intelligence algorithms (TSO, GA, DE, PSO, GWO, WOA, PPA, SOA, STOA) and seven improved swarm intelligence algorithms (AGPSO, MPSO, OBSCA, PSOGSA, CGWO, GWOCS, IGWO). Each algorithm was run 30 times independently on each benchmark test function, and the evaluation metrics selected for this experiment were the mean (Ave), standard deviation (Std), maximum (Max), and minimum (Min) values. The population size was 30 and the maximum number of iterations was 1000. To more clearly represent the differences in algorithm performance, the popular non-parametric Friedman test [62] was also used, which is able to rank the average performance of the experimental results for each algorithm on all tested functions; its final average ranking is shown at the end of the statistical table of experimental results. Wilcoxon’s rank sum test analysis was also performed for the results of each independent experiment. The experimental environment was Windows 10 64 bit, MATLAB R2016A, Intel(R) Core CPU (i5-10210U 2.1 GHz), 16 G RAM. For the sake of fairness, the parameters in each algorithm were set with reference to the original document, and the specific parameters were set as shown in Table 1.

4.2. Benchmark Function

Details of the 18 benchmarking functions are shown in Table 2. Table 2 includes seven high-dimensional single-peak functions (F1~F7), six high-dimensional multi-peak functions (F8~F13), and five fixed-dimensional multi-peak functions (F14~F18). Because the high-dimensional single-peak function has only one peak, it was used to test the local convergence accuracy and convergence speed of the algorithm; the high-dimensional multi-peak function and the fixed-dimensional multi-peak function have multiple peaks and only one global optimum, so were used to test the global optimum search and the ability to circumvent the local optimum of the algorithm. The 3D plot of the benchmark test function is shown in Figure 3. The shape of each benchmark test function can be seen in Figure 3, in which the darkest blue part represents the global optimum. It can be seen that the high-dimensional multi-peak benchmark test function has multiple local optima, which is meaningful for the performance testing of the algorithm.

4.3. Experimental Results and Analysis

The test results of the 18 benchmark functions are shown in Table 3, where the bolded data are the optimal values of performance metrics for all methods under the same function. As can be seen from Table 3, on F1~F6, ITSO is superior to other functions in terms of Ave, Std, Max, and Min; on F7, TSO performs best in terms of Ave, Std, Max, and Min, followed by ITSO; on all high-dimensional multi-peaked functions, all performance metrics of ITSO are optimal; on F14~F16, all performance metrics of ITSO are optimal; on F17 and F18, only the performance indicator of Min is not optimal. It is worth noting that the theoretical optimal values are obtained on F1, F2, F3, F4, F9, F11, F15, and F17. In the Friedman test, the average ranking was 1.9296 and the final ranking was first, the next best was TSO, and the worst performer was GA.
The convergence curves are a visual representation to assess the development capability and convergence speed of the algorithm seeking. The convergence curves of ITSO and the other seven algorithms on the 18 benchmark functions are shown in Figure 4. As can be seen from Figure 4, ITSO converges significantly faster than the other algorithms on the high-dimensional single-peaked function, and the convergence precision is optimal. On high-dimensional multi-peaked functions, the convergence is still faster than other algorithms, and its convergence accuracy performs in line with other algorithms at some moments. On fixed-dimensional multi-peaked functions, ITSO shows superiority in both convergence speed and convergence precision.
The test results of ITSO with other improved swarm intelligence algorithms are shown in Table 4, where the bolded font in the table shows the optimal value of the current function under the same evaluation index. From Table 4, it can be concluded that ITSO is still the best-performing algorithm on high-dimensional single peaks, except for STD and MAX on F6, which are suboptimal to IGWO. On the high-dimensional multi-peak functions, ITSO shows superior performance, except for STD and MAX, which are suboptimal to IGWO on F12 only. ITSO performs second best to IGWO on F17 and F18 for fixed dimensional multi-peak functions, and still shows significant advantages on other functions. With an average ranking of 2.1426 in the Friedman test, ITSO still shows the best performance in each, followed by IGWO and the worst performance by PSOGSA.
The convergence curves of ITSO and the improved metaheuristic on the 18 benchmark functions are shown in Figure 5. Figure 5 shows that the convergence speed of ITSO on the high-dimensional single-peaked function F5 is the slowest, but the convergence accuracy is optimal. On the high-dimensional multi-peaked functions, ITSO converges slower than GWOCS and PSOGSA on F13, but they have both fallen into local extrema, which precisely reflects the strong ability of ITSO to circumvent local optima. ITSO exhibits the best convergence rate on fixed-dimensional multi-peaked functions, whereas the convergence curves of the other algorithms exhibit zigzagging, reflecting their poorer global merit-seeking ability.

4.4. Algorithm Stability Analysis

Although the standard deviation of each algorithm on the benchmark test function is given in Table 3 and Table 4, it still does not visually represent the distribution of values for each experimental result. To more visually represent the stability of ITSO and other algorithms, this experiment uses box line plots to show the distribution of results for each function after 30 independent tests. The results of ITSO and the standard swarm intelligence algorithm on the benchmark test functions are shown in Figure 6.
As can be seen from Figure 4, on all functions, ITSO compares its value distribution with the standard swarm intelligence optimization algorithm, and ITSO shows significant stability and superior performance, as evidenced by the fact that its lower edge, upper edge, and median are always lower than the other algorithms for the same function.
The distributions of the outcome-seeking values of ITSO and the improved metaheuristic algorithm on the benchmark test functions are shown in Figure 7. It can be seen from Figure 5 that the distribution of the search value of ITSO is the most stable, both on the high-dimensional single-peak, high-dimensional multi-peak and fixed-dimensional multi-peak functions, reflecting the remarkable stability of ITSO.

4.5. Wilcoxon’s Rank Sum Test Analysis

Because too many random factors affect the performance of the algorithm, statistical tests are a suitable means to assess the variability in performance of ITSO and other algorithms. The commonly used Wilcoxon’s rank sum test [63] was chosen for this experiment, and the significance evaluation index was set at 5%. For 30 independent experiments, p-values were obtained by two-by-two rank sum test analysis of ITSO and other algorithms. When the p-value is less than 5%, it means that there is a statistically significant difference between ITSO and this algorithm on the current function. The results of the Wilcoxon’s rank sum test for ITSO with the standard metaheuristic algorithm are shown in Table 5, in which the bolded font indicates values greater than 5% or NaN. NaN indicates that both ITSO and the current algorithm converge to the global optimum.
As can be seen from Table 5, there is no statistically significant difference between ITSO and TSO on F9, F10, F11, and F15; no statistically significant difference between ITSO and PSO on F14 and F16; no statistically significant difference with WOA only on F9 and F11; no statistically significant difference between ITSO and SOA on F11; and a statistically significant difference between ITSO and the standard swarm intelligence algorithm in the vast majority of cases.
The results of Wilcoxon’s rank sum test of ITSO with the improved metaheuristic algorithm are shown in Table 6. As can be seen from Table 6, on F6, there is no statistically significant difference between ITSO and PSOGSA; on F9, there is no statistically significant difference between ITSO and OBSCA and CGWO; on F11 and F15, there is no significant difference between CGWO and ITSO in the value of merit seeking; on F14 and F17, there is no statistically significant difference between PSOGSA and ITSO; AGPSO and ITSO showed no statistically significant differences on F15 and F16; MPSO and ITSO showed no statistically significant differences on F16; and statistically significant differences in the majority of cases.

4.6. High-Dimensional Performance Analysis

Because TSO tends to converge prematurely to local extrema when dealing with complex high-dimensional optimization problems, to test that the ITSO proposed in this paper can handle high-dimensional complex optimization problems more effectively, the dimensions from F1 to F13 were set to three higher-dimensional types, 100, 200 and 500. The population size and the maximum number of iterations remained the same as for the previous settings. The results of testing ITSO with the standard optimization algorithm for high-dimensional functions in dimensions 100, 200, and 500 are shown in Table 7, Table 8 and Table 9, respectively.
From Table 7, Table 8 and Table 9, it can be seen that ITSO performs second best to TSO on F7 in any dimension; ITSO performs second best to TSO on F2 when the dimension is 500; the performance of ITSO is extremely competitive and superior in all other cases; the final result of the average ranking of ITSO by the Friedman test is first. It is worth noting that the ITSO seeking values are theoretical on F1, F2, F3, F4, F9, and F11.
The test results of ITSO with the improved optimization algorithm for high-dimensional functions of dimension 100, 200, and 500 are shown in Table 10, Table 11 and Table 12, respectively. From these three tables, we can see that ITSO only performs second best to CGWO on F2 with dimension 500, and ITSO performs the best in all other cases; the final result of the average ranking of the Friedman test for ITSO is still first place. These precisely prove the remarkable superiority and stability of ITSO in solving complex high-dimensional problems.

5. Conclusions

In this paper, an improved TSO is proposed to address the defects of the original TSO, namely, slow convergence speed and ease of falling into a local optimum when solving high-dimensional complex problems. Firstly, a chaotic opposition learning strategy is used to improve the quality of the initial population, then adaptive inertia weights are introduced to improve the global and local search ability of the algorithm and accelerate the convergence speed. Then, a neighbor dimension learning strategy is used to ensure the population diversity of each iteration. In the 18 benchmark test functions, 30 independent comparative experiences were conducted with 16 popular algorithms, and Ave, Std, Max, and Min were chosen to evaluate the mathematical characteristics of the experimental data, in addition to the means of Wilcoxon’s rank sum test with a significance evaluation index of 5%. The experimental results show that ITSO not only showed obvious competitiveness in Ave, Std, Max, and Min, but also showed significant statistical advantages in the nonparametric sign test. ITSO consistently maintained the best stability, as shown in box-line plots, for all data. In conclusion, ITSO shows significant superiority and high competitiveness in finding accuracy, convergence speed, and solving complex high-dimensional problems. The main features of ITSO are not only high exploitation and exploration abilities, but also fast convergence. However, we cannot guarantee the best performance in all global optimization problems.
The research prospects for the TSO should not be underestimated. Its development and exploration capability can be improved by introducing other strategies, and by mixing it with other metaheuristics to obtain a more competitive and improved TSO. The TSO can be applied not only to solve global optimization problems, but also to solve optimal parameter combinations in single diode models, neural network parameter optimization, power load scheduling, and unmanned aircraft.

Author Contributions

W.Y.: Conceptualization, Methodology, Software, Writing—Original Draft, Writing—Review & Editing, Supervision. K.X.: Validation, Investigation, Project administration. T.L.: Data Curation, Resources, Funding acquisition. M.X.: Formal analysis. Y.Z.: Visualization. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the National Natural Science Foundation of China (No. U1813222, No. 42075129), Tianjin Natural Science Foundation (No. 18JCYBJC16500) and Key Research and Development Project from Hebei Province (No. 19210404D, No. 20351802D).

Data Availability Statement

All data information can be found in the relevant sections.

Conflicts of Interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper.

References

  1. Adarsh, B.R.; Raghunathan, T.; Jayabarathi, T.; Yang, X.-S. Economic Dispatch Using Chaotic Bat Algorithm. Energy 2016, 96, 666–675. [Google Scholar] [CrossRef]
  2. Jayabarathi, T.; Raghunathan, T.; Adarsh, B.R.; Suganthan, P.N. Economic Dispatch Using Hybrid Grey Wolf Optimizer. Energy 2016, 111, 630–641. [Google Scholar] [CrossRef]
  3. Kuo, R.J.; Hong, C.W. Integration of Genetic Algorithm and Particle Swarm Optimization for Investment Portfolio Optimization. Appl. Math. Inf. Sci. 2013, 7, 2397–2408. [Google Scholar] [CrossRef] [Green Version]
  4. Haghofer, A.; Dorl, S.; Oszwald, A.; Breuss, J.; Jacak, J.; Winkler, S.M. Evolutionary Optimization of Image Processing for Cell Detection in Microscopy Images. Soft Comput. 2020, 24, 17847–17862. [Google Scholar] [CrossRef]
  5. Qiao, L.; Wang, Z.; Wang, Y.; Zhu, J. Mechanical Performance-Based Optimum Design of High Carbon Pearlitic Steel by Particle Swarm Optimization. Steel Res. Int. 2021, 92, 2000252. [Google Scholar] [CrossRef]
  6. Kalathingal, M.S.H.; Basak, S.; Mitra, J. Artificial Neural Network Modeling and Genetic Algorithm Optimization of Process Parameters in Fluidized Bed Drying of Green Tea Leaves. J. Food Process Eng. 2020, 43, e13128. [Google Scholar] [CrossRef]
  7. Yang, L.; Chen, H. Fault Diagnosis of Gearbox Based on RBF-PF and Particle Swarm Optimization Wavelet Neural Network. Neural Comput. Appl. 2019, 31, 4463–4478. [Google Scholar] [CrossRef]
  8. Hemeida, A.M.; Alkhalaf, S.; Mady, A.; Mahmoud, E.A.; Hussein, M.E.; Baha Eldin, A.M. Implementation of Nature-Inspired Optimization Algorithms in Some Data Mining Tasks. Ain Shams Eng. J. 2020, 11, 309–318. [Google Scholar] [CrossRef]
  9. Martens, D.; Baesens, B.; Fawcett, T. Editorial Survey: Swarm Intelligence for Data Mining. Mach. Learn. 2011, 82, 1–42. [Google Scholar] [CrossRef] [Green Version]
  10. Hu, Q.; Xie, Y.; Zhang, Z. Modification of Breakthrough Models in a Continuous-Flow Fixed-Bed Column: Mathematical Characteristics of Breakthrough Curves and Rate Profiles. Sep. Purif. Technol. 2020, 238, 116399. [Google Scholar] [CrossRef]
  11. Jafari, S.; Nikolaidis, T. Meta-Heuristic Global Optimization Algorithms for Aircraft Engines Modelling and Controller Design; A Review, Research Challenges, and Exploring the Future. Prog. Aerosp. Sci. 2019, 104, 40–53. [Google Scholar] [CrossRef]
  12. Nadimi-Shahraki, M.H.; Taghian, S.; Mirjalili, S. An Improved Grey Wolf Optimizer for Solving Engineering Problems. Expert Syst. Appl. 2021, 166, 113917. [Google Scholar] [CrossRef]
  13. Yang, X.S.; Gandomi, A.H. Bat Algorithm: A Novel Approach for Global Engineering Optimization. Eng. Comput. (Swans. Wales) 2012. [Google Scholar] [CrossRef] [Green Version]
  14. Gao, K.; Cao, Z.; Zhang, L.; Chen, Z.; Han, Y.; Pan, Q. A Review on Swarm Intelligence and Evolutionary Algorithms for Solving Flexible Job Shop Scheduling Problems. IEEE/CAA J. Autom. Sin. 2019, 6, 904–916. [Google Scholar] [CrossRef]
  15. Munk, D.J.; Vio, G.A.; Steven, G.P. Topology and Shape Optimization Methods Using Evolutionary Algorithms: A Review. Struct. Multidisc. Optim. 2015, 52, 613–631. [Google Scholar] [CrossRef]
  16. Albadr, M.A.; Tiun, S.; Ayob, M.; AL-Dhief, F. Genetic Algorithm Based on Natural Selection Theory for Optimization Problems. Symmetry 2020, 12, 1758. [Google Scholar] [CrossRef]
  17. Mallipeddi, R.; Suganthan, P.N.; Pan, Q.K.; Tasgetiren, M.F. Differential Evolution Algorithm with Ensemble of Parameters and Mutation Strategies. Appl. Soft Comput. 2011, 11, 1679–1696. [Google Scholar] [CrossRef]
  18. Eriksson, R.; Olsson, B. Adapting Genetic Regulatory Models by Genetic Programming. Biosystems 2004, 76, 217–227. [Google Scholar] [CrossRef]
  19. Li, K.; Gu, F.; Li, W.; Huang, Y. A Dual-Population Evolutionary Algorithm Adapting to Complementary Evolutionary Strategy. Int. J. Patt. Recogn. Artif. Intell. 2019, 33, 1959004. [Google Scholar] [CrossRef]
  20. Aljarah, I.; Faris, H.; Mirjalili, S.; Al-Madi, N. Training Radial Basis Function Networks Using Biogeography-Based Optimizer. Neural Comput. Appl. 2018, 29, 529–553. [Google Scholar] [CrossRef]
  21. Basu, M. Fast Convergence Evolutionary Programming for Economic Dispatch Problems. IET Gener. Transm. Distrib. 2017, 11, 4009–4017. [Google Scholar] [CrossRef]
  22. Brezočnik, L.; Fister, I.; Podgorelec, V. Swarm Intelligence Algorithms for Feature Selection: A Review. Appl. Sci. 2018, 8, 1521. [Google Scholar] [CrossRef] [Green Version]
  23. Tian, D.; Hu, J.; Sheng, Z.; Wang, Y.; Ma, J.; Wang, J. Swarm Intelligence Algorithm Inspired by Route Choice Behavior. J. Bionic Eng. 2016, 13, 669–678. [Google Scholar] [CrossRef] [Green Version]
  24. Esmin, A.A.A.; Coelho, R.A.; Matwin, S. A Review on Particle Swarm Optimization Algorithm and Its Variants to Clustering High-Dimensional Data. Artif. Intell. Rev. 2015, 44, 23–45. [Google Scholar] [CrossRef]
  25. Afshar, A.; Massoumi, F.; Afshar, A.; Mariño, M.A. State of the Art Review of Ant Colony Optimization Applications in Water Resource Management. Water Resour. Manag. 2015, 29, 3891–3904. [Google Scholar] [CrossRef]
  26. Mirjalili, S.; Lewis, A. The Whale Optimization Algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  27. Faramarzi, A.; Heidarinejad, M.; Mirjalili, S.; Gandomi, A.H. Marine Predators Algorithm: A Nature-Inspired Metaheuristic. Expert Syst. Appl. 2020, 152, 113377. [Google Scholar] [CrossRef]
  28. Mirjalili, S.; Mirjalili, S.M.; Yang, X.-S. Binary Bat Algorithm. Neural Comput. Appl. 2014, 25, 663–681. [Google Scholar] [CrossRef]
  29. Wang, G.-G.; Deb, S.; Gandomi, A.H.; Zhang, Z.; Alavi, A.H. Chaotic Cuckoo Search. Soft Comput. 2016, 20, 3349–3362. [Google Scholar] [CrossRef]
  30. Banitalebi, A.; Aziz, M.I.A.; Bahar, A.; Aziz, Z.A. Enhanced Compact Artificial Bee Colony. Inf. Sci. 2015, 298, 491–511. [Google Scholar] [CrossRef]
  31. Joshi, H.; Arora, S. Enhanced Grey Wolf Optimization Algorithm for Global Optimization. Fundam. Inform. 2017, 153, 235–264. [Google Scholar] [CrossRef]
  32. Dhiman, G.; Kumar, V. Seagull Optimization Algorithm: Theory and Its Applications for Large-Scale Industrial Engineering Problems. Knowl. Based Syst. 2019, 165, 169–196. [Google Scholar] [CrossRef]
  33. Chin, V.J.; Salam, Z. Coyote Optimization Algorithm for the Parameter Extraction of Photovoltaic Cells. Sol. Energy 2019, 194, 656–670. [Google Scholar] [CrossRef]
  34. Dhiman, G.; Kaur, A. STOA: A Bio-Inspired Based Optimization Algorithm for Industrial Engineering Problems. Eng. Appl. Artif. Intell. 2019, 82, 148–174. [Google Scholar] [CrossRef]
  35. Kaveh, A.; Vaez, S.R.H.; Hosseini, P. Simplified Dolphin Echolocation Algorithm for Optimum Design of Frame. Smart Struct. Syst. 2018, 21, 321–333. [Google Scholar] [CrossRef]
  36. Wang, G.-G.; Gandomi, A.H.; Alavi, A.H. Stud Krill Herd Algorithm. Neurocomputing 2014, 128, 363–370. [Google Scholar] [CrossRef]
  37. Harifi, S.; Khalilian, M.; Mohammadzadeh, J.; Ebrahimnejad, S. Optimizing a Neuro-Fuzzy System Based on Nature-Inspired Emperor Penguins Colony Optimization Algorithm. IEEE Trans. Fuzzy Syst. 2020, 28, 1110–1124. [Google Scholar] [CrossRef]
  38. Mohamed, A.-A.A.; Hassan, S.A.; Hemeida, A.M.; Alkhalaf, S.; Mahmoud, M.M.M.; Baha Eldin, A.M. Parasitism–Predation Algorithm (PPA): A Novel Approach for Feature Selection. Ain Shams Eng. J. 2019, 11, 293–308. [Google Scholar] [CrossRef]
  39. Kogan, G.; Klein, R.; Bortman, J. A Physics-Based Algorithm for the Estimation of Bearing Spall Width Using Vibrations. Mech. Syst. Signal Process. 2018, 104, 398–414. [Google Scholar] [CrossRef]
  40. Bozorg-Haddad, O.; Janbaz, M.; Loáiciga, H.A. Application of the Gravity Search Algorithm to Multi-Reservoir Operation Optimization. Adv. Water Resour. 2016, 98, 173–185. [Google Scholar] [CrossRef]
  41. Kaveh, A.; Talatahari, S. A Novel Heuristic Optimization Method: Charged System Search. Acta Mech. 2010, 213, 267–289. [Google Scholar] [CrossRef]
  42. Kaveh, A.; Khayatazad, M. Ray Optimization for Size and Shape Optimization of Truss Structures. Comput. Struct. 2013, 117, 82–94. [Google Scholar] [CrossRef]
  43. Erol, O.K.; Eksin, I. A New Optimization Method: Big Bang–Big Crunch. Adv. Eng. Softw. 2006, 37, 106–111. [Google Scholar] [CrossRef]
  44. Zhao, W.; Wang, L.; Zhang, Z. A Novel Atom Search Optimization for Dispersion Coefficient Estimation in Groundwater. Future Gener. Comput. Syst. 2019, 91, 601–610. [Google Scholar] [CrossRef]
  45. Hashim, F.A.; Houssein, E.H.; Mabrouk, M.S.; Al-Atabany, W.; Mirjalili, S. Henry Gas Solubility Optimization: A Novel Physics-Based Algorithm. Future Gener. Comput. Syst. 2019, 101, 646–667. [Google Scholar] [CrossRef]
  46. Lockett, A.J.; Miikkulainen, R. A Probabilistic Reformulation of No Free Lunch: Continuous Lunches Are Not Free. Evol. Comput. 2017, 25, 503–528. [Google Scholar] [CrossRef]
  47. Qais, M.H.; Hasanien, H.M.; Alghuwainem, S. Transient Search Optimization: A New Meta-Heuristic Optimization Algorithm. Appl. Intell. 2020, 50, 3926–3941. [Google Scholar] [CrossRef]
  48. Qais, M.H.; Hasanien, H.M.; Alghuwainem, S. Transient Search Optimization for Electrical Parameters Estimation of Photovoltaic Module Based on Datasheet Values. Energy Convers. Manag. 2020, 214, 112904. [Google Scholar] [CrossRef]
  49. Dashtipour, K.; Gogate, M.; Li, J.; Jiang, F.; Kong, B.; Hussain, A. A Hybrid Persian Sentiment Analysis Framework: Integrating Dependency Grammar Based Rules and Deep Neural Networks. Neurocomputing 2020, 380, 1–10. [Google Scholar] [CrossRef] [Green Version]
  50. Yang, X.S. Review of Meta-Heuristics and Generalised Evolutionary Walk Algorithm. IJBIC 2011, 3, 77. [Google Scholar] [CrossRef]
  51. Mirjalili, S.; Lewis, A.; Sadiq, A.S. Autonomous Particles Groups for Particle Swarm Optimization. Arab. J. Sci. Eng. 2014, 39, 4683–4697. [Google Scholar] [CrossRef] [Green Version]
  52. Zhou, H.; Pang, J.; Chen, P.-K.; Chou, F.-D. A Modified Particle Swarm Optimization Algorithm for a Batch-Processing Machine Scheduling Problem with Arbitrary Release Times and Non-Identical Job Sizes. Comput. Ind. Eng. 2018, 123, 67–81. [Google Scholar] [CrossRef]
  53. Abd Elaziz, M.; Oliva, D.; Xiong, S. An Improved Opposition-Based Sine Cosine Algorithm for Global Optimization. Expert Syst. Appl. 2017, 90, 484–500. [Google Scholar] [CrossRef]
  54. Meshram, S.G.; Ghorbani, M.A.; Shamshirband, S.; Karimi, V.; Meshram, C. River Flow Prediction Using Hybrid PSOGSA Algorithm Based on Feed-Forward Neural Network. Soft Comput. 2019, 23, 10429–10438. [Google Scholar] [CrossRef]
  55. Kohli, M.; Arora, S. Chaotic Grey Wolf Optimization Algorithm for Constrained Optimization Problems. J. Comput. Des. Eng. 2018, 5, 458–472. [Google Scholar] [CrossRef]
  56. Long, W.; Cai, S.; Jiao, J.; Xu, M.; Wu, T. A New Hybrid Algorithm Based on Grey Wolf Optimizer and Cuckoo Search for Parameter Extraction of Solar Photovoltaic Models. Energy Convers. Manag. 2020, 203, 112243. [Google Scholar] [CrossRef]
  57. Sayed, G.I.; Khoriba, G.; Haggag, M.H. A Novel Chaotic Salp Swarm Algorithm for Global Optimization and Feature Selection. Appl. Intell. 2018, 48, 3462–3481. [Google Scholar] [CrossRef]
  58. Han, C. An Image Encryption Algorithm Based on Modified Logistic Chaotic Map. Optik 2019, 181, 779–785. [Google Scholar] [CrossRef]
  59. Tubishat, M.; Idris, N.; Shuib, L.; Abushariah, M.A.M.; Mirjalili, S. Improved Salp Swarm Algorithm Based on Opposition Based Learning and Novel Local Search Algorithm for Feature Selection. Expert Syst. Appl. 2020, 145, 113122. [Google Scholar] [CrossRef]
  60. Taherkhani, M.; Safabakhsh, R. A Novel Stability-Based Adaptive Inertia Weight for Particle Swarm Optimization. Appl. Soft Comput. 2016, 38, 281–295. [Google Scholar] [CrossRef]
  61. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey Wolf Optimizer. Adv. Eng. Softw. 2014. [Google Scholar] [CrossRef] [Green Version]
  62. Derrac, J.; García, S.; Molina, D.; Herrera, F. A Practical Tutorial on the Use of Nonparametric Statistical Tests as a Methodology for Comparing Evolutionary and Swarm Intelligence Algorithms. Swarm Evol. Comput. 2011, 1, 3–18. [Google Scholar] [CrossRef]
  63. Chen, H.; Li, W.; Yang, X. A Whale Optimization Algorithm with Chaos Mechanism Based on Quasi-Opposition for Global Optimization Problems. Expert Syst. Appl. 2020, 158, 113612. [Google Scholar] [CrossRef]
Figure 1. Curve of adaptive weights.
Figure 1. Curve of adaptive weights.
Symmetry 13 00244 g001
Figure 2. Block diagram of the improved transient search algorithm (ITSO).
Figure 2. Block diagram of the improved transient search algorithm (ITSO).
Symmetry 13 00244 g002
Figure 3. Three-dimensional plot of the benchmark test function.
Figure 3. Three-dimensional plot of the benchmark test function.
Symmetry 13 00244 g003aSymmetry 13 00244 g003b
Figure 4. Convergence curve of ITSO with standard metaheuristic calculations.
Figure 4. Convergence curve of ITSO with standard metaheuristic calculations.
Symmetry 13 00244 g004aSymmetry 13 00244 g004b
Figure 5. Convergence curve of ITSO with the improved metaheuristic algorithm.
Figure 5. Convergence curve of ITSO with the improved metaheuristic algorithm.
Symmetry 13 00244 g005aSymmetry 13 00244 g005b
Figure 6. Box line diagram of ITSO with standard metaheuristic algorithms.
Figure 6. Box line diagram of ITSO with standard metaheuristic algorithms.
Symmetry 13 00244 g006aSymmetry 13 00244 g006b
Figure 7. Box line diagram of ITSO with improved metaheuristic algorithm.
Figure 7. Box line diagram of ITSO with improved metaheuristic algorithm.
Symmetry 13 00244 g007aSymmetry 13 00244 g007b
Table 1. Parameter settings of each algorithm.
Table 1. Parameter settings of each algorithm.
AlgorithmParameter Specific Settings
GA c r o s s o v e r = 0.2 , m u t a t i o n = 0.1
DE c r o s s o v e r = 0.2 , s c a l i n g   f a c t o r = 0.64
PSO c 1 = 2 , c 2 = 2
GWO a = 2 ( 1 t T max )
WOA a = 2 ( 1 t T max )
PPA c = 1 , r [ 0 , 1 ]
SOA f c = 2 , Control Parameter (A) ∈ [2, 0]
STOA S A = 2 2 t T max
AGPSO c 1 = 2.05 t T max + 2.55 , c 2 = t T max + 1.25
MPSO c 1 = 2 , c 2 = 2 , w [ 0.4 , 0.9 ]
OBSCA r 1 = a t T max a , r 2 [ 0 , 1 ]
PSOGSA α = 1 , β = 1 , w [ 0.4 , 0.9 ]
CGWO a = 2 ( 1 t T max ) , = 0.5 , β = 0.2
GWOCS a = 2 ( 1 t T max ) , σ v = 1
IGWO a = 2 ( 1 t T max )
TSO k = 2 , z [ 0 , 2 ]
ITSO k = 2 , z [ 0 , 2 ]
Table 2. Description of the 18 classic benchmarking functions.
Table 2. Description of the 18 classic benchmarking functions.
TypeFunctionDimRangeOptimum Value
Unimodal F 1 ( x ) = i = 1 n x i 2 50[−100, 100]0
Unimodal F 2 ( x ) = i = 1 n | x i | + i = 1 n | x i | 50[−10, 10]0
Unimodal F 3 ( x ) = i = 1 n ( j 1 i x j ) 2 50[−100, 100]0
Unimodal F 4 ( x ) = max i { | x i | , 1 i n } 50[−100, 100]0
Unimodal F 5 ( x ) = i = 1 n 1 [ 100 ( x i + 1 x i 2 ) 2 + ( x i 1 ) 2 ] 50[−30, 30]0
Unimodal F 6 ( x ) = i = 1 n ( [ x i + 0.5 ] ) 2 50[−100, 100]0
Unimodal F 7 ( x ) = i = 1 n i x i 4 + random [ 0 , 1 ) 50[−1.28, 1.28]0
Multimodal F 8 ( x ) = i = 1 n x i sin ( | x i | ) 50[−500, 500]−418.9829 × d
Multimodal F 9 ( x ) = i = 1 n [ x i 2 10 cos ( 2 π x i ) + 10 ] 50[−5.12, 5.12]0
Multimodal F 10 ( x ) = 20 e x p ( 0.2 1 n i = 1 n x i 2 ) exp ( 1 n i = 1 n cos ( 2 π x i ) ) + 20 + e 50[−32, 32]0
Multimodal F 11 ( x ) = 1 4000 i = 1 n x i 2 i = 1 n cos ( x i i ) + 1 50[−600, 600]0
Multimodal F 12 ( x ) = π n { 10 sin ( π y 1 ) + i = 1 n 1 ( y i 1 ) 2 [ 1 + 10 sin 2 ( π y i + 1 ) ] + ( y n 1 ) 2 } + i = 1 n u ( x i , 10 , 100 , 4 ) w h e r e   y i = 1 + x i + 1 4 u ( x i , a , k , m ) = { k ( x i a ) m x i > a 0 a < x i < a k ( x i a ) m x i < a 50[−50, 50]0
Multimodal F 13 ( x ) = 0.1 { sin 2 ( 3 π x 1 ) + i = 1 n ( x i 1 ) 2 [ 1 + sin 2 ( 3 π x i + 1 ) ] + ( x n 1 ) 2 [ 1 + sin 2 ( 2 π x n ) ] } + i = 1 n u ( x i , 5 , 100 , 4 ) 50[−50, 50]0
Fixed Dimension F 14 ( x ) = ( 1 500 + j = 1 25 1 j + i = 1 2 ( x i a i j ) 6 ) 1 2[−65, 65]1
Fixed Dimension F 15 ( x ) = i = 1 11 [ a i x 1 ( b i 2 + b i x 2 ) b i 2 + b i x 3 + x 4 ] 2 4[−5, 5]0.00030
Fixed Dimension F 16 ( x ) = i = 1 5 [ ( X a i ) ( X a i ) T + c i ] 1 4[0, 10]−10.1532
Fixed Dimension F 17 ( x ) = i = 1 7 [ ( X a i ) ( X a i ) T + c i ] 1 4[0, 10]−10.4028
Fixed Dimension F 18 ( x ) = i = 1 10 [ ( X a i ) ( X a i ) T + c i ] 1 4[0, 10]−10.5363
Table 3. Test results of ITSO and standard metaheuristic algorithms on benchmark test functions, The bolded part is the best result.
Table 3. Test results of ITSO and standard metaheuristic algorithms on benchmark test functions, The bolded part is the best result.
FunctionCriteriaITSOTSOPSOGWOWOAPPASOASTOAGADE
F1Ave0.00 × 10+002.44 × 10−2013.15 × 10−014.65 × 10−599.93 × 10−1491.22 × 10+001.24 × 10−271.94 × 10−175.88 × 10+007.03 × 10−11
Std0.00 × 10+000.00 × 10+002.00 × 10−011.02 × 10−585.32 × 10−1482.52 × 10+002.00 × 10−277.83 × 10−172.65 × 10+004.48 × 10−11
Max0.00 × 10+007.32 × 10−2009.19 × 10−015.53 × 10−582.96 × 10−1471.39 × 10+016.91 × 10−274.38 × 10−161.35 × 10+011.97 × 10−10
Min0.00 × 10+006.19 × 10−3019.08 × 10−021.12 × 10−612.23 × 10−1695.42 × 10−021.84 × 10−311.20 × 10−201.82 × 10+009.07 × 10−12
F2Ave0.00 × 10+004.22 × 10−1028.74 × 10+009.87 × 10−356.40 × 10−1013.57 × 10+006.23 × 10−183.44 × 10−128.63 × 10−012.80 × 10−07
Std0.00 × 10+002.27 × 10−1018.22 × 10+001.11 × 10−343.45 × 10−1002.60 × 10+007.38 × 10−187.09 × 10−121.64 × 10−018.12 × 10−08
Max0.00 × 10+001.26 × 10−1003.06 × 10+015.20 × 10−341.92 × 10−991.01 × 10+013.54 × 10−173.91 × 10−111.21 × 10+004.65 × 10−07
Min0.00 × 10+004.43 × 10−1383.98 × 10−015.18 × 10−361.58 × 10−1145.16 × 10−012.27 × 10−192.57 × 10−145.94 × 10−011.39 × 10−07
F3Ave0.00 × 10+004.15 × 10−847.65 × 10+012.67 × 10−142.41 × 10+044.61 × 10+022.03 × 10−121.06 × 10−071.22 × 10+042.73 × 10+04
Std0.00 × 10+002.24 × 10−831.59 × 10+018.37 × 10−141.20 × 10+042.36 × 10+027.43 × 10−121.94 × 10−072.64 × 10+033.38 × 10+03
Max0.00 × 10+001.25 × 10−821.16 × 10+023.49 × 10−135.20 × 10+041.02 × 10+033.79 × 10−117.31 × 10−071.85 × 10+043.64 × 10+04
Min0.00 × 10+003.35 × 10−2393.60 × 10+012.48 × 10−203.23 × 10+031.15 × 10+023.02 × 10−182.43 × 10−118.23 × 10+032.12 × 10+04
F4Ave0.00 × 10+001.57 × 10−1001.53 × 10+001.02 × 10−143.79 × 10+013.69 × 10+012.46 × 10−072.22 × 10−057.65 × 10+002.43 × 10+00
Std0.00 × 10+008.32 × 10−1002.31 × 10−011.36 × 10−143.17 × 10+018.45 × 10+009.90 × 10−072.22 × 10−051.28 × 10+003.85 × 10−01
Max0.00 × 10+004.64 × 10−992.08 × 10+006.20 × 10−149.00 × 10+015.61 × 10+015.54 × 10−066.81 × 10−051.07 × 10+013.33 × 10+00
Min0.00 × 10+001.44 × 10−1351.05 × 10+007.56 × 10−161.52 × 10−012.37 × 10+013.63 × 10−111.26 × 10−065.27 × 10+001.58 × 10+00
F5Ave2.18 × 10−042.83 × 10−024.01 × 10+022.70 × 10+012.72 × 10+013.69 × 10+022.80 × 10+012.79 × 10+014.55 × 10+025.26 × 10+01
Std4.10 × 10−043.56 × 10−025.47 × 10+027.39 × 10−015.75 × 10−012.29 × 10+026.22 × 10−016.48 × 10−015.53 × 10+022.95 × 10+01
Max1.98 × 10−031.54 × 10−013.21 × 10+032.86 × 10+012.87 × 10+011.12 × 10+032.89 × 10+012.88 × 10+012.89 × 10+031.20 × 10+02
Min5.28 × 10−071.24 × 10−051.07 × 10+022.52 × 10+012.63 × 10+015.28 × 10+012.69 × 10+012.69 × 10+011.61 × 10+022.56 × 10+01
F6Ave5.53 × 10−066.77 × 10−042.93 × 10−016.26 × 10−016.37 × 10−028.35 × 10−013.19 × 10+002.60 × 10+005.51 × 10+002.18 × 10−03
Std7.68 × 10−061.07 × 10−031.69 × 10−013.40 × 10−019.28 × 10−029.39 × 10−014.14 × 10−014.72 × 10−012.13 × 10+009.02 × 10−04
Max3.11 × 10−055.26 × 10−036.82 × 10−011.26 × 10+004.57 × 10−014.22 × 10+003.93 × 10+003.49 × 10+001.11 × 10+014.69 × 10−03
Min4.73 × 10−081.08 × 10−077.62 × 10−021.79 × 10−051.03 × 10−023.76 × 10−022.00 × 10+001.29 × 10+002.57 × 10+007.92 × 10−04
F7Ave1.93 × 10−049.56 × 10−058.19 × 10+009.88 × 10−041.32 × 10−033.79 × 10−019.09 × 10−041.57 × 10−031.12 × 10−013.00 × 10−02
Std1.41 × 10−046.44 × 10−057.40 × 10+005.38 × 10−041.68 × 10−032.24 × 10−016.35 × 10−041.09 × 10−033.38 × 10−026.30 × 10−03
Max6.89 × 10−042.31 × 10−042.72 × 10+012.22 × 10−036.59 × 10−031.18 × 10+002.87 × 10−035.88 × 10−031.84 × 10−014.08 × 10−02
Min3.33 × 10−052.28 × 10−063.05 × 10−011.82 × 10−045.75 × 10−061.07 × 10−011.63 × 10−044.57 × 10−045.38 × 10−021.82 × 10−02
F8Ave−1.26 × 10+04−1.26 × 10+04−6.51 × 10+03−6.18 × 10+03−1.12 × 10+04−8.02 × 10+03−5.48 × 10+03−5.59 × 10+03−1.26 × 10+04−1.24 × 10+04
Std1.58 × 10−027.02 × 10−031.02 × 10+036.39 × 10+021.55 × 10+037.82 × 10+027.18 × 10+027.09 × 10+026.66 × 10+001.34 × 10+02
Max−1.26 × 10+04−1.26 × 10+04−3.74 × 10+03−4.91 × 10+03−8.12 × 10+03−6.25 × 10+03−4.59 × 10+03−4.43 × 10+03−1.25 × 10+04−1.21 × 10+04
Min−1.26 × 10+04−1.26 × 10+04−8.17 × 10+03−7.22 × 10+03−1.26 × 10+04−9.61 × 10+03−7.10 × 10+03−8.19 × 10+03−1.26 × 10+04−1.26 × 10+04
F9Ave0.00 × 10+000.00 × 10+001.71 × 10+021.71 × 10−140.00 × 10+006.22 × 10+011.77 × 10+005.21 × 10+002.59 × 10+006.28 × 10+01
Std0.00 × 10+000.00 × 10+003.82 × 10+012.60 × 10−140.00 × 10+001.84 × 10+015.44 × 10+001.94 × 10+018.73 × 10−016.07 × 10+00
Max0.00 × 10+000.00 × 10+002.44 × 10+025.68 × 10−140.00 × 10+009.75 × 10+012.35 × 10+011.04 × 10+024.85 × 10+007.32 × 10+01
Min0.00 × 10+000.00 × 10+009.55 × 10+010.00 × 10+000.00 × 10+003.68 × 10+010.00 × 10+005.68 × 10−141.40 × 10+005.25 × 10+01
F10Ave8.88 × 10−168.88 × 10−161.20 × 10+001.62 × 10−143.97 × 10−151.24 × 10+012.00 × 10+012.00 × 10+011.20 × 10+002.15 × 10−06
Std0.00 × 10+000.00 × 10+006.79 × 10−013.57 × 10−152.38 × 10−151.66 × 10+001.79 × 10−031.91 × 10−032.86 × 10−015.11 × 10−07
Max8.88 × 10−168.88 × 10−162.50 × 10+002.22 × 10−147.99 × 10−151.56 × 10+012.00 × 10+012.00 × 10+011.88 × 10+003.13 × 10−06
Min8.88 × 10−168.88 × 10−162.98 × 10−017.99 × 10−158.88 × 10−168.68 × 10+002.00 × 10+012.00 × 10+017.22 × 10−011.20 × 10−06
F11Ave0.00 × 10+000.00 × 10+002.17 × 10−022.85 × 10−033.47 × 10−034.76 × 10−011.01 × 10−032.32 × 10−021.05 × 10+001.18 × 10−09
Std0.00 × 10+000.00 × 10+001.03 × 10−026.20 × 10−031.31 × 10−022.61 × 10−013.94 × 10−033.64 × 10−021.87 × 10−021.64 × 10−09
Max0.00 × 10+000.00 × 10+003.96 × 10−022.36 × 10−025.92 × 10−021.05 × 10+001.94 × 10−021.39 × 10−011.08 × 10+007.75 × 10−09
Min0.00 × 10+000.00 × 10+003.85 × 10−030.00 × 10+000.00 × 10+001.74 × 10−010.00 × 10+000.00 × 10+009.98 × 10−015.58 × 10−11
F12Ave1.53 × 10−071.84 × 10−052.55 × 10−033.22 × 10−026.53 × 10−031.66 × 10+013.08 × 10−012.03 × 10−013.33 × 10−023.60 × 10−04
Std2.74 × 10−073.22 × 10−052.00 × 10−031.85 × 10−025.54 × 10−037.62 × 10+001.35 × 10−011.01 × 10−012.32 × 10−022.97 × 10−04
Max1.54 × 10−061.63 × 10−049.35 × 10−037.91 × 10−022.06 × 10−023.36 × 10+017.37 × 10−016.41 × 10−011.13 × 10−011.25 × 10−03
Min1.48 × 10−112.03 × 10−093.04 × 10−046.51 × 10−036.35 × 10−043.08 × 10+001.10 × 10−016.63 × 10−027.97 × 10−031.12 × 10−04
F13Ave1.25 × 10−063.41 × 10−048.26 × 10−024.50 × 10−012.03 × 10−015.44 × 10+011.99 × 10+001.74 × 10+002.52 × 10−011.39 × 10−03
Std1.81 × 10−064.76 × 10−045.19 × 10−022.12 × 10−011.79 × 10−011.29 × 10+011.57 × 10−011.73 × 10−019.96 × 10−025.81 × 10−04
Max6.58 × 10−062.10 × 10−032.41 × 10−019.43 × 10−018.84 × 10−018.20 × 10+012.41 × 10+002.00 × 10+005.23 × 10−013.10 × 10−03
Min3.52 × 10−103.44 × 10−072.12 × 10−024.13 × 10−052.25 × 10−022.31 × 10+011.68 × 10+001.32 × 10+001.14 × 10−013.11 × 10−04
F14Ave0.99801.0641 3.2264 4.3297 2.3715 4.0197 1.5271 1.3948 1.0514 0.9980
Std0.00000.3562 3.0592 3.9557 2.8933 2.6425 0.8774 0.7936 0.0747 0.0000
Max0.99802.9821 11.7187 12.6705 10.7632 10.7632 2.9821 2.9821 1.3161 0.9980
Min0.99800.99800.99800.99800.99800.99800.99800.99800.9980 0.9980
F15Ave0.00030.0004 0.0030 0.0044 0.0006 0.0004 0.0012 0.0011 0.0101 0.0006
Std0.00000.0001 0.0058 0.0080 0.0003 0.0003 0.0002 0.0003 0.0092 0.0001
Max0.00040.0006 0.0204 0.0204 0.0015 0.0016 0.0014 0.0013 0.0381 0.0009
Min0.00030.00030.0004 0.00030.00030.00030.00030.00030.0008 0.0004
F16Ave−10.1531−10.1503 −8.2976 −9.9844 −8.1817 −8.3611 −2.6123 −2.8500 −5.4667 −9.7590
Std0.00010.0055 2.4388 0.9070 2.5852 2.8685 3.8453 3.5525 3.3752 1.2401
Max−10.1529−10.1272 −5.0552 −5.1002 −2.6305 −2.6295 −0.3507 −0.2731 −2.6219 −4.8213
Min−10.1532−10.1532−10.1532−10.1532−10.1531 −10.1532−10.1394 −10.1497 −10.1490 −10.1532
F17Ave−10.4028−10.4014 −9.5112 −10.0482 −9.9291 −5.8348 −5.5870 −4.7072 −5.8589 −10.4027
Std0.00020.0032 2.3345 1.3258 1.7790 3.0797 4.4521 4.4994 3.4796 0.0002
Max−10.4017−10.3898 −1.8376 −5.0877 −1.8374 −2.7337 −0.5211 −0.3724 −2.7345 −10.4021
Min−10.4028 −10.4029−10.4029−10.4028 −10.4028 −10.4003 −10.3867 −10.3926 −10.3960 −10.4029
F18Ave−10.5362−10.5315 −9.5308 −10.5360 −8.7797 −7.0671 −6.6092 −7.5390 −5.6906 −10.5360
Std0.00010.0097 2.3124 0.0002 2.9477 3.6474 3.6848 4.2592 3.6545 3.5575
Max−10.5359−10.4888 −1.8595 −10.5353 −1.8595 −2.2820 −0.4046 −0.5585 −2.4128 −10.5354
Min−10.5363 −10.5364−10.5364−10.5363 −10.5363 −10.5364−10.5143 −10.5320 −10.5318 −10.5364
Friedman Ave Rank1.92962.6500 6.4546 4.7259 4.9194 7.8500 6.6407 7.0565 7.8556 4.9176
Rank12635978104
Table 4. Test results of ITSO with improved metaheuristic algorithms on benchmark test functions, The bolded part is the best result.
Table 4. Test results of ITSO with improved metaheuristic algorithms on benchmark test functions, The bolded part is the best result.
FunctionCriteriaITSOAGPSOMPSOOBSCAPSOGSACGWOGWOCSIGWO
F1Ave0.00 × 10+001.91 × 10−031.77 × 10−037.49 × 10−252.06 × 10−047.05 × 10−742.48 × 10−596.21 × 10−61
Std0.00 × 10+003.31 × 10−036.02 × 10−034.02 × 10−246.37 × 10−041.29 × 10−735.24 × 10−598.61 × 10−61
Max0.00 × 10+001.44 × 10−022.94 × 10−022.24 × 10−232.87 × 10−035.88 × 10−732.14 × 10−584.34 × 10−60
Min0.00 × 10+001.75 × 10−065.93 × 10−072.85 × 10−392.03 × 10−191.47 × 10−771.01 × 10−626.50 × 10−63
F2Ave0.00 × 10+001.42 × 10+002.42 × 10+012.37 × 10−251.15 × 10−061.26 × 10−433.70 × 10−357.80 × 10−37
Std0.00 × 10+003.36 × 10+001.30 × 10+019.26 × 10−255.65 × 10−063.79 × 10−433.74 × 10−351.08 × 10−36
Max0.00 × 10+001.00 × 10+015.01 × 10+015.15 × 10−243.14 × 10−052.00 × 10−421.82 × 10−344.72 × 10−36
Min0.00 × 10+003.22 × 10−039.08 × 10−021.05 × 10−311.56 × 10−099.81 × 10−463.19 × 10−361.81 × 10−38
F3Ave0.00 × 10+001.40 × 10+031.17 × 10+043.01 × 10−038.81 × 10+039.47 × 10−188.02 × 10−162.61 × 10−10
Std0.00 × 10+001.76 × 10+037.66 × 10+031.58 × 10−028.17 × 10+032.72 × 10−173.36 × 10−159.44 × 10−10
Max0.00 × 10+007.59 × 10+032.85 × 10+048.82 × 10−023.56 × 10+041.36 × 10−161.88 × 10−145.24 × 10−09
Min0.00 × 10+001.30 × 10+025.04 × 10+022.30 × 10−131.07 × 10+036.58 × 10−231.63 × 10−201.73 × 10−14
F4Ave0.00 × 10+001.60 × 10+011.19 × 10+012.63 × 10−055.88 × 10+012.90 × 10−169.89 × 10−151.63 × 10−11
Std0.00 × 10+003.73 × 10+004.11 × 10+008.75 × 10−052.35 × 10+011.56 × 10−151.30 × 10−142.68 × 10−11
Max0.00 × 10+002.40 × 10+012.39 × 10+014.73 × 10−048.75 × 10+018.68 × 10−156.36 × 10−141.12 × 10−10
Min0.00 × 10+009.86 × 10+004.63 × 10+001.78 × 10−092.73 × 10+019.31 × 10−212.18 × 10−166.47 × 10−13
F5Ave2.18 × 10−041.43 × 10+023.93 × 10+042.82 × 10+012.67 × 10+062.66 × 10+012.68 × 10+012.28 × 10+01
Std4.10 × 10−049.98 × 10+014.44 × 10+043.39 × 10−011.44 × 10+076.64 × 10−017.46 × 10−013.30 × 10−01
Max1.98 × 10−034.46 × 10+029.01 × 10+042.89 × 10+018.00 × 10+072.79 × 10+012.85 × 10+012.35 × 10+01
Min5.28 × 10−072.82 × 10+012.43 × 10+012.77 × 10+012.26 × 10+012.52 × 10+012.60 × 10+012.17 × 10+01
F6Ave5.53 × 10−068.95 × 10−042.80 × 10−044.36 × 10+003.37 × 10+027.73 × 10−056.89 × 10−015.63 × 10−06
Std7.68 × 10−062.06 × 10−035.93 × 10−042.45 × 10−011.81 × 10+031.98 × 10−054.17 × 10−012.90 × 10−06
Max3.11 × 10−051.08 × 10−023.01 × 10−034.82 × 10+001.01 × 10+041.21 × 10−041.75 × 10+001.42 × 10−05
Min4.73 × 10−083.33 × 10−068.66 × 10−083.96 × 10+001.55 × 10−193.81 × 10−059.89 × 10−061.98 × 10−06
F7Ave1.93 × 10−045.00 × 10−025.01 × 10−012.09 × 10−037.57 × 10−028.69 × 10−028.27 × 10−041.14 × 10−03
Std1.41 × 10−041.82 × 10−021.56 × 10+001.46 × 10−032.52 × 10−024.29 × 10−023.29 × 10−045.01 × 10−04
Max6.89 × 10−048.82 × 10−028.08 × 10+006.56 × 10−031.18 × 10−012.13 × 10−011.36 × 10−032.66 × 10−03
Min3.33 × 10−051.67 × 10−021.78 × 10−023.42 × 10−042.16 × 10−022.97 × 10−021.64 × 10−043.07 × 10−04
F8Ave−1.26 × 10+04−9.65 × 10+03−8.99 × 10+03−4.07 × 10+03−7.29 × 10+03−5.18 × 10+03−1.10 × 10+04−9.46 × 10+03
Std1.58 × 10−025.74 × 10+026.40 × 10+022.65 × 10+026.50 × 10+021.68 × 10+031.45 × 10+031.10 × 10+03
Max−1.26 × 10+04−8.66 × 10+03−7.68 × 10+03−3.65 × 10+03−5.22 × 10+03−3.42 × 10+03−6.02 × 10+03−6.57 × 10+03
Min−1.26 × 10+04−1.09 × 10+04−1.02 × 10+04−4.80 × 10+03−8.62 × 10+03−9.85 × 10+03−1.24 × 10+04−1.14 × 10+04
F9Ave0.00 × 10+005.86 × 10+011.25 × 10+020.00 × 10+001.48 × 10+020.00 × 10+004.80 × 10−011.99 × 10+01
Std0.00 × 10+002.18 × 10+012.62 × 10+010.00 × 10+003.68 × 10+010.00 × 10+001.27 × 10+001.68 × 10+01
Max0.00 × 10+001.22 × 10+021.75 × 10+020.00 × 10+002.23 × 10+020.00 × 10+004.42 × 10+008.78 × 10+01
Min0.00 × 10+002.89 × 10+015.37 × 10+010.00 × 10+006.37 × 10+010.00 × 10+000.00 × 10+002.98 × 10+00
F10Ave8.88 × 10−162.46 × 10+001.53 × 10+004.47 × 10−021.54 × 10+018.11 × 10−151.55 × 10−141.37 × 10−14
Std0.00 × 10+005.69 × 10−018.25 × 10−011.62 × 10−014.32 × 10+006.38 × 10−162.12 × 10−152.53 × 10−15
Max8.88 × 10−164.55 × 10+003.10 × 10+008.12 × 10−011.91 × 10+011.15 × 10−142.22 × 10−141.51 × 10−14
Min8.88 × 10−161.50 × 10+001.35 × 10−034.44 × 10−151.50 × 10+007.99 × 10−151.15 × 10−147.99 × 10−15
F11Ave0.00 × 10+005.81 × 10−023.05 × 10+001.29 × 10−121.21 × 10+016.32 × 10−041.49 × 10−033.20 × 10−03
Std0.00 × 10+004.02 × 10−021.62 × 10+015.70 × 10−123.08 × 10+013.40 × 10−033.79 × 10−035.44 × 10−03
Max0.00 × 10+001.52 × 10−019.05 × 10+013.13 × 10−119.09 × 10+011.90 × 10−021.13 × 10−022.22 × 10−02
Min0.00 × 10+001.47 × 10−031.07 × 10−060.00 × 10+001.63 × 10−070.00 × 10+000.00 × 10+000.00 × 10+00
F12Ave1.53 × 10−071.80 × 10+001.28 × 10+004.81 × 10−018.53 × 10+063.27 × 10−023.60 × 10−022.39 × 10−07
Std2.74 × 10−071.15 × 10+001.33 × 10+006.87 × 10−024.60 × 10+072.00 × 10−021.53 × 10−021.12 × 10−07
Max1.54 × 10−064.14 × 10+006.26 × 10+006.31 × 10−012.56 × 10+081.06 × 10−017.96 × 10−026.07 × 10−07
Min1.48 × 10−112.82 × 10−031.68 × 10−053.12 × 10−015.22 × 10−016.56 × 10−036.47 × 10−031.16 × 10−07
F13Ave1.25 × 10−063.42 × 10+008.87 × 10−012.42 × 10+001.37 × 10+078.86 × 10−025.17 × 10−013.25 × 10−03
Std1.81 × 10−064.33 × 10+002.10 × 10+001.52 × 10−017.36 × 10+071.54 × 10−012.37 × 10−011.75 × 10−02
Max6.58 × 10−062.01 × 10+011.11 × 10+012.70 × 10+004.10 × 10+085.87 × 10−011.05 × 10+009.74 × 10−02
Min3.52 × 10−108.16 × 10−026.67 × 10−042.08 × 10+005.67 × 10+009.80 × 10−052.00 × 10−011.98 × 10−06
F14Ave0.99800.99800.99801.66123.16182.76565.00580.9980
Std0.00000.00000.00000.93412.96423.03614.57890.0000
Max0.99800.99800.99802.982110.763212.670512.67050.9980
Min0.99800.99800.99800.99800.99800.99800.99800.9980
F15Ave0.00030.00090.00270.00080.00320.00580.00030.0004
Std0.00000.00140.00590.00010.00610.00880.00000.0002
Max0.00040.00830.02040.00110.02040.02040.00030.0012
Min0.00030.00030.00030.00040.00030.00030.00030.0003
F16Ave−10.1531−7.5403−7.0458−9.5456−5.0697−7.0971−9.1031−9.9210
Std0.00012.64713.02151.30033.38062.49472.10620.9586
Max−10.1529−2.6829−2.6305−4.5249−2.6305−5.0552−4.0602−5.1008
Min−10.1532−10.1532−10.1532−10.0760−10.1532−10.1530−10.1531−10.1532
F17Ave−10.4028−10.0513−8.7116−10.1378−5.7383−8.6308−8.9906−10.4029
Std0.00021.31562.86160.14463.63672.50542.34130.0000
Max−10.4017−5.1288−2.7519−9.7125−1.8376−5.0877−5.0877−10.4029
Min−10.4028−10.4029−10.4029−10.3963−10.4029−10.4029−10.4028−10.4029
F18Ave−10.5362−10.3577−8.9633−10.2362−5.5384−8.8234−9.6410−10.5364
Std0.00010.96232.91030.16783.37552.65702.00150.0000
Max−10.5359−5.1756−2.4217−9.8002−2.4217−2.4217−5.1285−10.5364
Min−10.5363−10.5364−10.5364−10.5022−10.5364−10.5363−10.5363−10.5364
Friedman Ave Rank2.14265.33985.54545.42506.37134.17044.05462.9509
Rank15768432
Table 5. Wilcoxon’s rank sum test results for ITSO and the standard metaheuristic algorithm, The bolded part is the best result.
Table 5. Wilcoxon’s rank sum test results for ITSO and the standard metaheuristic algorithm, The bolded part is the best result.
Function ITSO VS.
TSOPSOGWOWOAPPASOASTOAGADE
F1p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F2p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F3p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F4p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F5p-value1.07 × 10−073.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F6p-value2.19 × 10−083.02 × 10−114.50 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F7p-value3.03 × 10−033.02 × 10−116.72 × 10−102.25 × 10−043.02 × 10−114.18 × 10−094.50 × 10−113.02 × 10−113.02 × 10−11
F8p-value1.70 × 10−023.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−117.39 × 10−11
F9p-valueNaN1.21 × 10−121.31 × 10−03NaN1.21 × 10−121.10 × 10−021.15 × 10−121.21 × 10−121.21 × 10−12
F10p-valueNaN1.21 × 10−125.17 × 10−133.14 × 10−081.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F11p-valueNaN1.21 × 10−121.10 × 10−021.61 × 10−011.21 × 10−121.61 × 10−011.92 × 10−101.21 × 10−121.21 × 10−12
F12p-value5.00 × 10−093.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F13p-value1.46 × 10−103.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F14p-value1.11 × 10−037.60 × 10−024.44 × 10−071.49 × 10−066.71 × 10−053.02 × 10−113.34 × 10−113.02 × 10−111.21 × 10−12
F15p-value8.77 × 10−024.06 × 10−111.95 × 10−033.56 × 10−041.10 × 10−066.12 × 10−104.18 × 10−093.02 × 10−116.70 × 10−11
F16p-value4.44 × 10−077.44 × 10−028.10 × 10−101.78 × 10−102.02 × 10−083.02 × 10−113.02 × 10−113.02 × 10−114.50 × 10−04
F17p-value1.49 × 10−046.36 × 10−075.97 × 10−093.50 × 10−093.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−114.41 × 10−09
F18p-value3.59 × 10−055.59 × 10−063.09 × 10−062.83 × 10−081.16 × 10−073.02 × 10−113.02 × 10−113.02 × 10−119.27 × 10−12
Table 6. Rank sum test results of Wilcoxon for ITSO with improved metaheuristics, The bolded part is the best result.
Table 6. Rank sum test results of Wilcoxon for ITSO with improved metaheuristics, The bolded part is the best result.
Function ITSO VS.
AGPSOMPSOOBSCAPSOGSACGWOGWOCSIGWO
F1p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F2p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F3p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F4p-value1.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−121.21 × 10−12
F5p-value3.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F6p-value1.86 × 10−093.01 × 10−073.02 × 10−111.33 × 10−013.02 × 10−114.98 × 10−114.36 × 10−02
F7p-value3.02 × 10−113.02 × 10−111.21 × 10−103.02 × 10−113.02 × 10−111.29 × 10−091.09 × 10−10
F8p-value3.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−11
F9p-value1.21 × 10−121.21 × 10−123.34 × 10−011.21 × 10−12NaN2.78 × 10−031.21 × 10−12
F10p-value1.21 × 10−121.21 × 10−121.19 × 10−121.21 × 10−126.13 × 10−141.20 × 10−132.57 × 10−13
F11p-value1.21 × 10−121.21 × 10−124.19 × 10−021.21 × 10−123.34 × 10−014.19 × 10−021.37 × 10−03
F12p-value3.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−111.61 × 10−06
F13p-value3.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.02 × 10−113.82 × 10−10
F14p-value1.21 × 10−121.72 × 10−123.02 × 10−111.00 × 10+007.74 × 10−068.84 × 10−071.72 × 10−12
F15p-value6.31 × 10−017.94 × 10−033.02 × 10−118.48 × 10−095.11 × 10−013.02 × 10−118.48 × 10−09
F16p-value6.61 × 10−016.62 × 10−013.02 × 10−117.78 × 10−033.69 × 10−112.37 × 10−107.56 × 10−09
F17p-value5.12 × 10−051.78 × 10−033.02 × 10−117.64 × 10−022.67 × 10−093.08 × 10−081.10 × 10−11
F18p-value4.23 × 10−093.39 × 10−043.02 × 10−117.91 × 10−033.50 × 10−091.75 × 10−054.11 × 10−12
Table 7. Results of ITSO and standard optimization algorithms for high-dimensional functions with dimension 100, The bolded part is the best result.
Table 7. Results of ITSO and standard optimization algorithms for high-dimensional functions with dimension 100, The bolded part is the best result.
FunctionCriteriaITSOTSOPSOGWOWOAPPASOASTOAGADE
F1Ave0.00 × 10+001.02 × 10−1761.06 × 10+021.90 × 10−292.84 × 10−1484.04 × 10+032.93 × 10−151.50 × 10−091.22 × 10+025.87 × 10+01
Std0.00 × 10+000.00 × 10+002.33 × 10+011.47 × 10−291.27 × 10−1471.55 × 10+035.93 × 10−152.60 × 10−092.47 × 10+011.02 × 10+01
Max0.00 × 10+003.06 × 10−1752.33 × 10+015.63 × 10−296.95 × 10−1477.69 × 10+033.17 × 10−149.70 × 10−091.76 × 10+028.38 × 10+01
Min0.00 × 10+007.89 × 10−2766.26 × 10+016.50 × 10−317.59 × 10−1621.53 × 10+033.01 × 10−176.90 × 10−128.46 × 10+013.92 × 10+01
F2Ave0.00 × 10+009.87 × 10−1012.19 × 10+025.45 × 10−185.69 × 10−1009.29 × 10+015.17 × 10−111.35 × 10−076.59 × 10+004.30 × 10+00
Std0.00 × 10+004.76 × 10−1005.13 × 10+013.14 × 10−182.04 × 10−994.06 × 10+014.82 × 10−112.30 × 10−075.38 × 10−014.12 × 10−01
Max0.00 × 10+002.64 × 10−995.13 × 10+011.51 × 10−179.96 × 10−992.23 × 10+021.87 × 10−109.83 × 10−077.80 × 10+005.21 × 10+00
Min0.00 × 10+006.59 × 10−1301.13 × 10+022.37 × 10−183.92 × 10−1125.75 × 10+011.70 × 10−124.66 × 10−094.99 × 10+003.49 × 10+00
F3Ave0.00 × 10+002.13 × 10−661.41 × 10+042.17 × 10+019.58 × 10+053.31 × 10+045.73 × 10−022.23 × 10+011.04 × 10+054.09 × 10+05
Std0.00 × 10+007.97 × 10−662.37 × 10+035.44 × 10+012.21 × 10+051.04 × 10+042.03 × 10−016.86 × 10+011.36 × 10+042.93 × 10+04
Max0.00 × 10+003.25 × 10−652.37 × 10+032.68 × 10+021.45 × 10+065.68 × 10+048.43 × 10−013.54 × 10+021.28 × 10+054.83 × 10+05
Min0.00 × 10+008.37 × 10−2009.91 × 10+032.99 × 10−033.86 × 10+051.40 × 10+049.58 × 10−071.79 × 10−027.97 × 10+043.39 × 10+05
F4Ave0.00 × 10+001.56 × 10−1031.02 × 10+014.94 × 10−037.77 × 10+015.38 × 10+015.70 × 10+015.81 × 10+013.02 × 10+018.62 × 10+01
Std0.00 × 10+006.84 × 10−1031.28 × 10+001.23 × 10−022.27 × 10+016.37 × 10+002.43 × 10+012.25 × 10+012.05 × 10+002.20 × 10+00
Max0.00 × 10+003.72 × 10−1021.28 × 10+006.48 × 10−029.61 × 10+016.53 × 10+018.86 × 10+018.92 × 10+013.46 × 10+019.02 × 10+01
Min0.00 × 10+002.95 × 10−1397.76 × 10+002.84 × 10−051.13 × 10+014.11 × 10+013.56 × 10+003.19 × 10+002.65 × 10+018.14 × 10+01
F5Ave6.26 × 10−041.22 × 10−011.06 × 10+059.74 × 10+019.77 × 10+011.14 × 10+069.86 × 10+019.85 × 10+013.68 × 10+036.34 × 10+04
Std1.04 × 10−032.56 × 10−012.64 × 10+047.30 × 10−013.89 × 10−015.27 × 10+052.61 × 10−012.70 × 10−017.79 × 10+021.46 × 10+04
Max4.76 × 10−031.09 × 10+002.64 × 10+049.84 × 10+019.83 × 10+012.07 × 10+069.88 × 10+019.87 × 10+015.13 × 10+031.11 × 10+05
Min4.16 × 10−071.11 × 10−047.14 × 10+049.60 × 10+019.70 × 10+012.15 × 10+059.80 × 10+019.79 × 10+012.51 × 10+034.01 × 10+04
F6Ave1.96 × 10−051.73 × 10−031.08 × 10+028.95 × 10+001.93 × 10+002.94 × 10+031.83 × 10+011.68 × 10+011.23 × 10+023.56 × 10+03
Std2.95 × 10−052.82 × 10−031.97 × 10+018.29 × 10−017.88 × 10−017.42 × 10+027.35 × 10−016.93 × 10−012.72 × 10+014.63 × 10+02
Max1.18 × 10−041.53 × 10−021.97 × 10+011.05 × 10+013.89 × 10+004.95 × 10+032.00 × 10+011.85 × 10+011.76 × 10+024.72 × 10+03
Min7.58 × 10−091.93 × 10−067.10 × 10+017.35 × 10+008.22 × 10−011.87 × 10+031.69 × 10+011.52 × 10+017.22 × 10+012.87 × 10+03
F7Ave1.85 × 10−041.26 × 10−046.93 × 10+022.71 × 10−031.71 × 10−037.00 × 10+002.36 × 10−037.14 × 10−038.75 × 10−017.61 × 10−01
Std1.73 × 10−041.30 × 10−041.55 × 10+021.09 × 10−031.16 × 10−033.45 × 10+001.98 × 10−034.30 × 10−031.42 × 10−011.00 × 10−01
Max7.72 × 10−046.20 × 10−041.55 × 10+025.46 × 10−034.76 × 10−031.81 × 10+017.52 × 10−032.30 × 10−021.20 × 10+009.64 × 10−01
Min7.70 × 10−075.87 × 10−064.30 × 10+026.00 × 10−042.04 × 10−053.54 × 10+008.93 × 10−051.76 × 10−035.66 × 10−015.72 × 10−01
F8Ave−4.19 × 10+04−4.19 × 10+04−2.08 × 10+04−1.64 × 10+04−3.90 × 10+04−2.19 × 10+04−1.09 × 10+04−1.14 × 10+04−4.16 × 10+04−1.81 × 10+04
Std9.54 × 10−026.38 × 10+012.15 × 10+032.25 × 10+033.99 × 10+031.07 × 10+031.73 × 10+031.83 × 10+034.93 × 10+015.52 × 10+02
Max−4.19 × 10+04−4.15 × 10+042.15 × 10+03−6.22 × 10+03−2.97 × 10+04−2.01 × 10+04−8.82 × 10+03−8.62 × 10+03−4.15 × 10+04−1.68 × 10+04
Min−4.19 × 10+04−4.19 × 10+04−2.41 × 10+04−1.92 × 10+04−4.19 × 10+04−2.46 × 10+04−1.49 × 10+04−1.72 × 10+04−4.17 × 10+04−1.91 × 10+04
F9Ave0.00 × 10+000.00 × 10+001.13 × 10+037.16 × 10−010.00 × 10+002.96 × 10+028.39 × 10−013.46 × 10+003.06 × 10+017.16 × 10+02
Std0.00 × 10+000.00 × 10+008.61 × 10+012.21 × 10+000.00 × 10+006.86 × 10+013.06 × 10+005.89 × 10+002.72 × 10+001.78 × 10+01
Max0.00 × 10+000.00 × 10+008.61 × 10+019.28 × 10+000.00 × 10+004.81 × 10+021.56 × 10+012.98 × 10+013.61 × 10+017.46 × 10+02
Min0.00 × 10+000.00 × 10+009.70 × 10+021.14 × 10−130.00 × 10+002.02 × 10+020.00 × 10+001.82 × 10−122.65 × 10+016.76 × 10+02
F10Ave8.88 × 10−168.88 × 10−165.56 × 10+001.11 × 10−134.56 × 10−151.56 × 10+012.00 × 10+012.00 × 10+012.81 × 10+003.04 × 10+00
Std0.00 × 10+000.00 × 10+003.84 × 10−018.93 × 10−152.67 × 10−159.42 × 10−012.92 × 10−043.20 × 10−041.77 × 10−012.81 × 10−01
Max8.88 × 10−168.88 × 10−163.84 × 10−011.36 × 10−137.99 × 10−151.71 × 10+012.00 × 10+012.00 × 10+013.14 × 10+003.99 × 10+00
Min8.88 × 10−168.88 × 10−164.71 × 10+009.33 × 10−148.88 × 10−161.35 × 10+012.00 × 10+012.00 × 10+012.41 × 10+002.29 × 10+00
F11Ave0.00 × 10+000.00 × 10+007.96 × 10−013.65 × 10−033.70 × 10−183.14 × 10+014.21 × 10−031.09 × 10−022.08 × 10+001.52 × 10+00
Std0.00 × 10+000.00 × 10+001.11 × 10−017.55 × 10−031.99 × 10−171.10 × 10+011.33 × 10−022.26 × 10−021.86 × 10−018.60 × 10−02
Max0.00 × 10+000.00 × 10+001.11 × 10−012.43 × 10−021.11 × 10−165.67 × 10+015.90 × 10−028.66 × 10−022.60 × 10+001.65 × 10+00
Min0.00 × 10+000.00 × 10+005.39 × 10−010.00 × 10+000.00 × 10+001.16 × 10+010.00 × 10+004.83 × 10−121.65 × 10+001.36 × 10+00
F12Ave3.96 × 10−089.37 × 10−065.62 × 10+002.44 × 10−011.78 × 10−026.30 × 10+047.36 × 10−016.39 × 10−012.37 × 10−016.16 × 10+06
Std4.03 × 10−089.78 × 10−062.37 × 10+005.86 × 10−029.00 × 10−031.29 × 10+056.09 × 10−028.33 × 10−026.96 × 10−022.10 × 10+06
Max1.52 × 10−073.91 × 10−052.37 × 10+004.17 × 10−013.85 × 10−026.80 × 10+058.66 × 10−018.63 × 10−013.74 × 10−011.08 × 10+07
Min5.53 × 10−121.55 × 10−081.37 × 10+001.57 × 10−017.39 × 10−036.07 × 10+016.21 × 10−015.17 × 10−011.01 × 10−012.33 × 10+06
F13Ave4.36 × 10−067.27 × 10−041.03 × 10+026.21 × 10+001.78 × 10+004.92 × 10+059.02 × 10+008.81 × 10+006.31 × 10+001.56 × 10+07
Std1.18 × 10−051.05 × 10−032.36 × 10+013.32 × 10−016.17 × 10−016.14 × 10+051.81 × 10−013.18 × 10−011.42 × 10+005.79 × 10+06
Max6.54 × 10−053.82 × 10−032.36 × 10+016.98 × 10+003.25 × 10+002.74 × 10+069.32 × 10+009.47 × 10+009.88 × 10+003.41 × 10+07
Min4.63 × 10−102.84 × 10−076.38 × 10+015.49 × 10+005.84 × 10−012.96 × 10+048.56 × 10+008.13 × 10+003.89 × 10+007.33 × 10+06
Friedman Ave Rank1.37311.88597.72054.30904.01418.49745.98976.33596.61038.2641
Rank12843105679
Table 8. Results of ITSO with standard optimization algorithms for high-dimensional functions of dimension 200, The bolded part is the best result.
Table 8. Results of ITSO with standard optimization algorithms for high-dimensional functions of dimension 200, The bolded part is the best result.
FunctionCriteriaITSOTSOPSOGWOWOAPPASOASTOAGADE
F1Ave0.00 × 10+001.56 × 10−1807.12 × 10+024.50 × 10−203.29 × 10−1453.25 × 10+048.09 × 10−124.51 × 10−071.79 × 10+033.13 × 10+04
Std0.00 × 10+000.00 × 10+008.69 × 10+012.89 × 10−201.30 × 10−1449.93 × 10+031.08 × 10−118.10 × 10−071.82 × 10+022.64 × 10+03
Max0.00 × 10+004.68 × 10−1798.87 × 10+021.37 × 10−196.70 × 10−1445.75 × 10+044.98 × 10−114.55 × 10−062.19 × 10+033.68 × 10+04
Min0.00 × 10+002.85 × 10−2835.48 × 10+025.70 × 10−213.32 × 10−1611.22 × 10+045.60 × 10−135.22 × 10−091.37 × 10+032.70 × 10+04
F2Ave0.00 × 10+001.19 × 10−1031.08 × 10+301.69 × 10−121.33 × 10−1003.84 × 10+024.99 × 10−092.91 × 10−063.47 × 10+013.25 × 10+02
Std0.00 × 10+006.34 × 10−1033.75 × 10+306.26 × 10−134.93 × 10−1001.02 × 10+023.69 × 10−094.74 × 10−062.23 × 10+002.91 × 10+01
Max0.00 × 10+003.53 × 10−1021.91 × 10+313.11 × 10−122.21 × 10−995.51 × 10+021.80 × 10−082.66 × 10−053.94 × 10+013.82 × 10+02
Min0.00 × 10+005.23 × 10−1416.42 × 10+027.54 × 10−131.62 × 10−1101.94 × 10+027.96 × 10−101.17 × 10−072.99 × 10+012.62 × 10+02
F3Ave0.00 × 10+001.19 × 10−458.32 × 10+043.19 × 10+034.26 × 10+061.20 × 10+057.05 × 10+011.15 × 10+033.44 × 10+051.60 × 10+06
Std0.00 × 10+006.40 × 10−451.81 × 10+042.92 × 10+031.38 × 10+063.54 × 10+041.78 × 10+021.21 × 10+032.72 × 10+041.09 × 10+05
Max0.00 × 10+003.56 × 10−441.34 × 10+051.26 × 10+046.64 × 10+062.43 × 10+057.00 × 10+024.15 × 10+033.88 × 10+051.81 × 10+06
Min0.00 × 10+005.37 × 10−2025.55 × 10+041.97 × 10+021.76 × 10+067.12 × 10+041.24 × 10−039.45 × 10+003.04 × 10+051.40 × 10+06
F4Ave0.00 × 10+004.58 × 10−961.91 × 10+019.43 × 10+007.69 × 10+016.38 × 10+019.21 × 10+019.15 × 10+015.06 × 10+019.80 × 10+01
Std0.00 × 10+002.47 × 10−951.30 × 10+005.17 × 10+002.16 × 10+018.42 × 10+003.26 × 10+002.66 × 10+002.13 × 10+006.48 × 10−01
Max0.00 × 10+001.38 × 10−942.14 × 10+012.91 × 10+019.83 × 10+017.63 × 10+019.79 × 10+019.75 × 10+015.48 × 10+019.88 × 10+01
Min0.00 × 10+002.56 × 10−1401.60 × 10+012.39 × 10+001.68 × 10+014.75 × 10+018.51 × 10+018.36 × 10+014.59 × 10+019.59 × 10+01
F5Ave1.34 × 10−031.45 × 10−011.73 × 10+061.98 × 10+021.97 × 10+021.52 × 10+071.99 × 10+021.99 × 10+021.05 × 10+051.22 × 10+08
Std2.75 × 10−031.90 × 10−012.93 × 10+054.90 × 10−013.12 × 10−019.15 × 10+061.37 × 10−012.13 × 10−011.96 × 10+041.80 × 10+07
Max1.45 × 10−028.13 × 10−012.14 × 10+061.98 × 10+021.98 × 10+024.57 × 10+071.99 × 10+021.99 × 10+021.54 × 10+051.55 × 10+08
Min4.10 × 10−081.14 × 10−051.17 × 10+061.96 × 10+021.97 × 10+025.47 × 10+061.98 × 10+021.98 × 10+025.78 × 10+048.51 × 10+07
F6Ave4.60 × 10−055.57 × 10−037.09 × 10+022.78 × 10+016.28 × 10+002.92 × 10+044.21 × 10+014.06 × 10+011.75 × 10+031.16 × 10+05
Std8.62 × 10−057.42 × 10−036.35 × 10+011.24 × 10+002.38 × 10+007.78 × 10+036.98 × 10−017.89 × 10−011.84 × 10+028.39 × 10+03
Max4.67 × 10−043.45 × 10−028.18 × 10+023.14 × 10+011.40 × 10+014.80 × 10+044.33 × 10+014.20 × 10+012.20 × 10+031.35 × 10+05
Min1.23 × 10−071.27 × 10−065.81 × 10+022.58 × 10+012.40 × 10+001.78 × 10+044.06 × 10+013.93 × 10+011.36 × 10+031.01 × 10+05
F7Ave2.67 × 10−041.03 × 10−045.92 × 10+034.46 × 10−032.18 × 10−035.04 × 10+015.35 × 10−031.49 × 10−024.31 × 10+002.49 × 10+02
Std1.78 × 10−049.94 × 10−056.37 × 10+021.52 × 10−032.03 × 10−032.21 × 10+013.62 × 10−037.66 × 10−036.40 × 10−013.87 × 10+01
Max6.36 × 10−044.04 × 10−047.11 × 10+038.74 × 10−037.90 × 10−031.30 × 10+021.30 × 10−023.26 × 10−025.78 × 10+003.29 × 10+02
Min2.88 × 10−057.08 × 10−064.65 × 10+031.63 × 10−031.18 × 10−052.16 × 10+011.10 × 10−033.76 × 10−033.37 × 10+001.93 × 10+02
F8Ave−8.38 × 10+04−8.38 × 10+04−4.27 × 10+04−2.89 × 10+04−7.77 × 10+04−3.48 × 10+04−1.60 × 10+04−1.63 × 10+04−8.1 × 10+04−2.6 × 10+04
Std9.39 × 10−021.60 × 10+023.34 × 10+034.53 × 10+031.07 × 10+042.32 × 10+033.74 × 10+032.39 × 10+033.68 × 10+026.52 × 10+02
Max−8.38 × 10+04−8.29 × 10+04−3.59 × 10+04−8.54 × 10+03−3.93 × 10+04−2.79 × 10+04−1.21 × 10+04−1.30 × 10+04−8.0 × 10+04−2.4 × 10+04
Min−8.38 × 10+04−8.38 × 10+04−4.97 × 10+04−3.52 × 10+04−8.38 × 10+04−3.77 × 10+04−2.53 × 10+04−2.06 × 10+04−8.1 × 10+04−2.7 × 10+04
F9Ave0.00 × 10+000.00 × 10+002.67 × 10+031.58 × 10+007.58 × 10−159.83 × 10+024.36 × 10−014.64 × 10+001.71 × 10+022.09 × 10+03
Std0.00 × 10+000.00 × 10+001.28 × 10+023.91 × 10+004.08 × 10−141.15 × 10+021.77 × 10+007.60 × 10+007.82 × 10+003.92 × 10+01
Max0.00 × 10+000.00 × 10+003.02 × 10+031.76 × 10+012.27 × 10−131.19 × 10+039.16 × 10+003.12 × 10+011.90 × 10+022.16 × 10+03
Min0.00 × 10+000.00 × 10+002.40 × 10+031.14 × 10−120.00 × 10+007.31 × 10+024.55 × 10−133.96 × 10−111.59 × 10+022.00 × 10+03
F10Ave8.88 × 10−168.88 × 10−168.31 × 10+001.28 × 10−113.38 × 10−151.64 × 10+012.00 × 10+012.00 × 10+015.12 × 10+001.52 × 10+01
Std0.00 × 10+000.00 × 10+006.02 × 10−014.38 × 10−122.08 × 10−158.28 × 10−011.41 × 10−041.85 × 10−041.59 × 10−017.30 × 10−01
Max8.88 × 10−168.88 × 10−161.10 × 10+012.86 × 10−117.99 × 10−151.89 × 10+012.00 × 10+012.00 × 10+015.40 × 10+001.67 × 10+01
Min8.88 × 10−168.88 × 10−167.17 × 10+006.41 × 10−128.88 × 10−161.50 × 10+012.00 × 10+012.00 × 10+014.80 × 10+001.38 × 10+01
F11Ave0.00 × 10+000.00 × 10+001.18 × 10+004.35 × 10−036.31 × 10−032.75 × 10+026.84 × 10−031.50 × 10−021.72 × 10+012.84 × 10+02
Std0.00 × 10+000.00 × 10+002.00 × 10−029.29 × 10−033.40 × 10−029.17 × 10+012.17 × 10−022.76 × 10−022.26 × 10+002.33 × 10+01
Max0.00 × 10+000.00 × 10+001.24 × 10+003.26 × 10−021.89 × 10−015.56 × 10+029.38 × 10−028.34 × 10−022.26 × 10+013.31 × 10+02
Min0.00 × 10+000.00 × 10+001.15 × 10+001.11 × 10−160.00 × 10+001.65 × 10+025.12 × 10−142.03 × 10−091.18 × 10+012.30 × 10+02
F12Ave4.30 × 10−086.28 × 10−062.00 × 10+024.63 × 10−012.52 × 10−022.06 × 10+068.82 × 10−018.19 × 10−013.12 × 10+001.07 × 10+09
Std8.22 × 10−088.59 × 10−062.91 × 10+025.48 × 10−029.63 × 10−031.85 × 10+063.99 × 10−024.23 × 10−023.51 × 10−011.25 × 10+08
Max3.29 × 10−073.70 × 10−051.55 × 10+035.90 × 10−014.25 × 10−027.34 × 10+069.81 × 10−019.14 × 10−014.08 × 10+001.30 × 10+09
Min1.92 × 10−106.80 × 10−093.34 × 10+013.63 × 10−011.27 × 10−021.16 × 10+058.11 × 10−017.35 × 10−012.35 × 10+008.45 × 10+08
F13Ave4.36 × 10−064.79 × 10−042.36 × 10+041.60 × 10+013.64 × 10+002.15 × 10+071.90 × 10+011.92 × 10+014.32 × 10+021.96 × 10+09
Std9.08 × 10−065.83 × 10−041.16 × 10+044.82 × 10−011.31 × 10+001.71 × 10+071.85 × 10−013.65 × 10−011.40 × 10+032.67 × 10+08
Max4.68 × 10−052.16 × 10−035.84 × 10+041.68 × 10+017.31 × 10+009.24 × 10+071.94 × 10+012.01 × 10+017.95 × 10+032.47 × 10+09
Min5.48 × 10−106.50 × 10−086.35 × 10+031.49 × 10+012.02 × 10+004.89 × 10+061.87 × 10+011.84 × 10+019.45 × 10+011.37 × 10+09
Friedman Ave Rank1.34231.8526 7.3949 4.3128 3.7615 8.1846 5.9692 6.2205 6.7590 9.2026
Rank12843956710
Table 9. Results of ITSO with standard optimization algorithms for high-dimensional functions of dimension 500, The bolded part is the best result.
Table 9. Results of ITSO with standard optimization algorithms for high-dimensional functions of dimension 500, The bolded part is the best result.
FunctionCriteriaITSOTSOPSOGWOWOAPPASOASTOAGADE
F1Ave0.00 × 10+004.57 × 10−2087.47 × 10+031.59 × 10−122.86 × 10−1451.77 × 10+056.04 × 10−099.97 × 10−057.40 × 10+047.60 × 10+05
Std0.00 × 10+000.00 × 10+003.83 × 10+028.49 × 10−131.54 × 10−1443.26 × 10+045.95 × 10−091.43 × 10−044.38 × 10+032.34 × 10+04
Max0.00 × 10+001.37 × 10−2068.26 × 10+033.88 × 10−128.56 × 10−1442.42 × 10+052.73 × 10−087.78 × 10−048.40 × 10+048.07 × 10+05
Min0.00 × 10+002.31 × 10−2636.84 × 10+033.99 × 10−136.02 × 10−1621.18 × 10+056.46 × 10−111.73 × 10−066.49 × 10+047.07 × 10+05
F2Ave1.70 × 10−055.73 × 10−981.97 × 10+1445.84 × 10−088.89 × 10−1011.82 × 10+472.03 × 10−073.57 × 10−053.59 × 10+028.25 × 10+146
Std5.20 × 10−053.08 × 10−971.06 × 10+1451.24 × 10−084.69 × 10−1009.37 × 10+471.87 × 10−073.28 × 10−051.01 × 10+013.38 × 10+147
Max2.86 × 10−041.72 × 10−965.91 × 10+1458.26 × 10−082.61 × 10−995.22 × 10+487.59 × 10−071.30 × 10−043.75 × 10+021.80 × 10+148
Min3.16 × 10−141.64 × 10−1406.19 × 10+432.96 × 10−083.00 × 10−1096.19 × 10+029.46 × 10−094.49 × 10−063.39 × 10+025.42 × 10+131
F3Ave4.31 × 10−2271.40 × 10−405.79 × 10+051.34 × 10+053.17 × 10+077.73 × 10+051.15 × 10+041.23 × 10+051.97 × 10+069.98 × 10+06
Std0.00 × 10+006.65 × 10−401.45 × 10+054.79 × 10+041.09 × 10+072.25 × 10+052.15 × 10+041.47 × 10+051.94 × 10+058.67 × 10+05
Max1.29 × 10−2253.69 × 10−399.47 × 10+052.90 × 10+056.04 × 10+071.28 × 10+061.03 × 10+057.64 × 10+052.35 × 10+061.21 × 10+07
Min0.00 × 10+002.46 × 10−1383.97 × 10+055.98 × 10+041.12 × 10+074.10 × 10+058.23 × 10−011.37 × 10+041.56 × 10+068.21 × 10+06
F4Ave0.00 × 10+001.12 × 10−962.80 × 10+015.87 × 10+018.38 × 10+016.75 × 10+019.80 × 10+019.82 × 10+017.49 × 10+019.92 × 10+01
Std0.00 × 10+006.00 × 10−961.29 × 10+007.52 × 10+001.52 × 10+016.81 × 10+005.65 × 10−016.74 × 10−011.18 × 10+002.56 × 10−01
Max0.00 × 10+003.34 × 10−953.20 × 10+017.99 × 10+019.80 × 10+018.37 × 10+019.90 × 10+019.93 × 10+017.67 × 10+019.96 × 10+01
Min0.00 × 10+001.55 × 10−1422.59 × 10+014.74 × 10+014.46 × 10+015.36 × 10+019.68 × 10+019.64 × 10+017.23 × 10+019.85 × 10+01
F5Ave2.26 × 10−033.07 × 10−015.44 × 10+074.98 × 10+024.96 × 10+021.71 × 10+084.99 × 10+024.99 × 10+023.59 × 10+073.89 × 10+09
Std5.22 × 10−033.60 × 10−017.04 × 10+061.33 × 10−014.49 × 10−019.10 × 10+071.42 × 10−016.13 × 10−013.85 × 10+061.46 × 10+08
Max2.81 × 10−021.21 × 10+007.25 × 10+074.98 × 10+024.97 × 10+025.55 × 10+084.99 × 10+025.01 × 10+024.20 × 10+074.15 × 10+09
Min2.34 × 10−062.81 × 10−034.17 × 10+074.97 × 10+024.95 × 10+026.68 × 10+074.98 × 10+024.99 × 10+022.83 × 10+073.47 × 10+09
F6Ave7.59 × 10−051.80 × 10−027.51 × 10+039.33 × 10+011.99 × 10+011.79 × 10+051.16 × 10+021.14 × 10+027.31 × 10+041.00 × 10+06
Std1.15 × 10−043.10 × 10−022.86 × 10+021.92 × 10+005.53 × 10+004.08 × 10+049.92 × 10−018.83 × 10−013.92 × 10+032.37 × 10+04
Max5.85 × 10−041.59 × 10−018.19 × 10+039.94 × 10+013.29 × 10+012.75 × 10+051.18 × 10+021.15 × 10+028.23 × 10+041.05 × 10+06
Min1.17 × 10−096.36 × 10−067.07 × 10+038.84 × 10+019.99 × 10+001.26 × 10+051.14 × 10+021.12 × 10+026.71 × 10+049.33 × 10+05
F7Ave2.87 × 10−041.03 × 10−045.70 × 10+041.07 × 10−022.57 × 10−031.49 × 10+038.93 × 10−032.93 × 10−022.31 × 10+022.32 × 10+04
Std3.05 × 10−041.02 × 10−042.06 × 10+032.93 × 10−033.24 × 10−037.92 × 10+024.49 × 10−031.42 × 10−022.58 × 10+011.11 × 10+03
Max1.66 × 10−034.17 × 10−046.19 × 10+041.69 × 10−021.58 × 10−025.00 × 10+031.83 × 10−026.23 × 10−022.95 × 10+022.52 × 10+04
Min3.02 × 10−053.13 × 10−065.30 × 10+045.49 × 10−032.86 × 10−055.42 × 10+021.52 × 10−031.29 × 10−021.77 × 10+022.05 × 10+04
F8Ave−2.09 × 10+05−2.09 × 10+05−9.76 × 10+04−5.91 × 10+04−1.89 × 10+05−5.67 × 10+04−2.72 × 10+04−2.69 × 10+04−1.63 × 10+05−3.97 × 10+04
Std3.56 × 10−012.61 × 10+021.77 × 10+048.89 × 10+032.38 × 10+043.27 × 10+036.44 × 10+034.64 × 10+031.84 × 10+031.17 × 10+03
Max−2.09 × 10+05−2.08 × 10+05−1.29 × 10+04−1.61 × 10+04−1.39 × 10+05−4.74 × 10+04−1.94 × 10+04−1.88 × 10+04−1.60 × 10+05−3.76 × 10+04
Min−2.09 × 10+05−2.09 × 10+05−1.12 × 10+05−6.62 × 10+04−2.09 × 10+05−6.21 × 10+04−4.45 × 10+04−3.80 × 10+04−1.68 × 10+05−4.36 × 10+04
F9Ave0.00 × 10+000.00 × 10+007.64 × 10+037.02 × 10+000.00 × 10+003.71 × 10+031.08 × 10+005.09 × 10+001.71 × 10+037.03 × 10+03
Std0.00 × 10+000.00 × 10+001.73 × 10+026.57 × 10+000.00 × 10+002.20 × 10+023.20 × 10+001.20 × 10+015.64 × 10+017.48 × 10+01
Max0.00 × 10+000.00 × 10+007.94 × 10+032.07 × 10+010.00 × 10+004.15 × 10+031.73 × 10+016.64 × 10+011.87 × 10+037.13 × 10+03
Min0.00 × 10+000.00 × 10+007.27 × 10+038.55 × 10−110.00 × 10+003.26 × 10+037.28 × 10−121.91 × 10−081.58 × 10+036.87 × 10+03
F10Ave8.88 × 10−168.88 × 10−161.29 × 10+015.36 × 10−083.49 × 10−151.73 × 10+012.00 × 10+012.00 × 10+011.26 × 10+012.08 × 10+01
Std0.00 × 10+000.00 × 10+002.42 × 10−011.36 × 10−082.58 × 10−158.43 × 10−018.72 × 10−055.84 × 10−051.78 × 10−011.43 × 10−02
Max8.88 × 10−168.88 × 10−161.36 × 10+018.09 × 10−087.99 × 10−151.90 × 10+012.00 × 10+012.00 × 10+011.29 × 10+012.08 × 10+01
Min8.88 × 10−168.88 × 10−161.24 × 10+012.62 × 10−088.88 × 10−161.58 × 10+012.00 × 10+012.00 × 10+011.22 × 10+012.08 × 10+01
F11Ave0.00 × 10+000.00 × 10+003.52 × 10+002.88 × 10−030.00 × 10+001.58 × 10+031.93 × 10−032.22 × 10−026.55 × 10+026.81 × 10+03
Std0.00 × 10+000.00 × 10+001.17 × 10−019.11 × 10−030.00 × 10+002.82 × 10+028.56 × 10−034.44 × 10−024.36 × 10+012.10 × 10+02
Max0.00 × 10+000.00 × 10+003.80 × 10+004.18 × 10−020.00 × 10+002.15 × 10+034.68 × 10−021.35 × 10−017.56 × 10+027.10 × 10+03
Min0.00 × 10+000.00 × 10+003.25 × 10+006.75 × 10−140.00 × 10+001.03 × 10+033.65 × 10−115.55 × 10−075.71 × 10+026.32 × 10+03
F12Ave4.62 × 10−084.32 × 10−068.10 × 10+057.44 × 10−013.70 × 10−021.03 × 10+081.03 × 10+009.96 × 10−013.14 × 10+061.61 × 10+10
Std8.70 × 10−086.17 × 10−062.51 × 10+052.82 × 10−021.18 × 10−021.32 × 10+081.80 × 10−022.15 × 10−028.38 × 10+055.59 × 10+08
Max4.34 × 10−072.90 × 10−051.56 × 10+068.06 × 10−016.68 × 10−027.49 × 10+081.07 × 10+001.04 × 10+004.74 × 10+061.68 × 10+10
Min4.10 × 10−131.27 × 10−083.93 × 10+056.91 × 10−011.71 × 10−025.17 × 10+069.94 × 10−019.51 × 10−011.81 × 10+061.49 × 10+10
F13Ave6.74 × 10−061.61 × 10−038.39 × 10+064.58 × 10+019.61 × 10+003.46 × 10+084.94 × 10+015.14 × 10+014.25 × 10+072.68 × 10+10
Std1.27 × 10−052.32 × 10−031.62 × 10+065.23 × 10−013.25 × 10+002.13 × 10+083.82 × 10−011.26 × 10+006.53 × 10+061.38 × 10+09
Max6.00 × 10−059.63 × 10−031.18 × 10+074.67 × 10+011.76 × 10+011.08 × 10+095.05 × 10+015.41 × 10+015.62 × 10+073.00 × 10+10
Min7.33 × 10−113.63 × 10−065.16 × 10+064.46 × 10+014.08 × 10+008.56 × 10+074.87 × 10+014.98 × 10+013.06 × 10+072.29 × 10+10
Friedman Ave Rank1.62441.7936 7.0923 4.3692 3.5590 7.9769 5.7231 6.2615 6.9949 9.6051
Rank12843956710
Table 10. Results of ITSO with improved optimization algorithms for 100-dimensional high-dimensional functions, The bolded part is the best result.
Table 10. Results of ITSO with improved optimization algorithms for 100-dimensional high-dimensional functions, The bolded part is the best result.
FunctionCriteriaITSOAGPSOMPSOOBSCAPSOGSACGWOGWOCSIGWO
F1Ave0.00 × 10+002.86 × 10+032.43 × 10+042.53 × 10−092.47 × 10+047.26 × 10−363.83 × 10−307.27 × 10−29
Std0.00 × 10+003.31 × 10+031.33 × 10+047.40 × 10−091.10 × 10+046.11 × 10−363.32 × 10−306.79 × 10−29
Max0.00 × 10+001.40 × 10+045.44 × 10+044.06 × 10−085.01 × 10+042.17 × 10−351.43 × 10−292.59 × 10−28
Min0.00 × 10+007.69 × 10+022.08 × 10+031.11 × 10−168.07 × 10+023.08 × 10−371.47 × 10−313.82 × 10−30
F2Ave0.00 × 10+001.07 × 10+022.40 × 10+022.82 × 10−134.14 × 10+176.79 × 10−222.69 × 10−188.04 × 10−19
Std0.00 × 10+002.83 × 10+013.15 × 10+019.22 × 10−132.23 × 10+187.45 × 10−221.80 × 10−183.93 × 10−19
Max0.00 × 10+001.74 × 10+022.98 × 10+024.94 × 10−121.24 × 10+194.02 × 10−217.07 × 10−181.98 × 10−18
Min0.00 × 10+006.05 × 10+011.87 × 10+026.79 × 10−187.05 × 10+019.28 × 10−235.13 × 10−193.24 × 10−19
F3Ave0.00 × 10+001.01 × 10+051.97 × 10+057.96 × 10+031.50 × 10+052.75 × 10+011.20 × 10+001.15 × 10+03
Std0.00 × 10+002.53 × 10+045.13 × 10+041.01 × 10+043.30 × 10+048.39 × 10+011.24 × 10+008.08 × 10+02
Max0.00 × 10+001.43 × 10+052.84 × 10+055.42 × 10+042.37 × 10+054.62 × 10+024.97 × 10+002.96 × 10+03
Min0.00 × 10+005.64 × 10+049.99 × 10+041.47 × 10+029.02 × 10+049.70 × 10−057.22 × 10−031.76 × 10+02
F4Ave0.00 × 10+005.14 × 10+016.57 × 10+013.72 × 10+018.60 × 10+012.50 × 10+011.57 × 10−051.57 × 10+00
Std0.00 × 10+004.19 × 10+005.27 × 10+001.25 × 10+011.05 × 10+012.84 × 10+012.20 × 10−051.90 × 10+00
Max0.00 × 10+006.30 × 10+017.42 × 10+016.07 × 10+019.79 × 10+018.14 × 10+011.17 × 10−047.36 × 10+00
Min0.00 × 10+004.26 × 10+015.69 × 10+011.46 × 10+017.09 × 10+016.67 × 10−067.86 × 10−073.45 × 10−02
F5Ave6.26 × 10−043.03 × 10+051.91 × 10+079.99 × 10+016.13 × 10+079.75 × 10+019.76 × 10+019.58 × 10+01
Std1.04 × 10−031.93 × 10+053.23 × 10+073.38 × 10+006.42 × 10+077.43 × 10−017.34 × 10−011.82 × 10+00
Max4.76 × 10−039.65 × 10+058.71 × 10+071.17 × 10+021.60 × 10+089.83 × 10+019.84 × 10+019.83 × 10+01
Min4.16 × 10−072.47 × 10+044.21 × 10+059.89 × 10+018.17 × 10+039.56 × 10+019.60 × 10+019.36 × 10+01
F6Ave1.96 × 10−052.78 × 10+031.98 × 10+042.23 × 10+012.01 × 10+042.27 × 10+009.36 × 10+005.19 × 10+00
Std2.95 × 10−052.27 × 10+031.14 × 10+045.76 × 10−011.28 × 10+048.92 × 10−018.84 × 10−018.84 × 10−01
Max1.18 × 10−041.10 × 10+044.57 × 10+042.34 × 10+015.02 × 10+044.48 × 10+001.14 × 10+016.71 × 10+00
Min7.58 × 10−094.61 × 10+021.69 × 10+032.13 × 10+015.56 × 10+024.60 × 10−017.84 × 10+003.58 × 10+00
F7Ave1.85 × 10−041.09 × 10+019.61 × 10+011.03 × 10−021.56 × 10+001.66 × 10−012.29 × 10−036.54 × 10−03
Std1.73 × 10−041.54 × 10+014.45 × 10+015.79 × 10−032.61 × 10−015.12 × 10−021.27 × 10−031.55 × 10−03
Max7.72 × 10−046.45 × 10+011.89 × 10+022.34 × 10−021.98 × 10+002.85 × 10−016.83 × 10−039.65 × 10−03
Min7.70 × 10−072.01 × 10+002.40 × 10+012.03 × 10−039.95 × 10−018.43 × 10−023.88 × 10−043.68 × 10−03
F8Ave−4.19 × 10+04−2.63 × 10+04−2.26 × 10+04−7.30 × 10+03−2.00 × 10+04−9.35 × 10+03−3.96 × 10+04−2.09 × 10+04
Std9.54 × 10−022.04 × 10+031.78 × 10+034.77 × 10+021.78 × 10+033.86 × 10+039.03 × 10+026.19 × 10+03
Max−4.19 × 10+04−2.16 × 10+04−1.93 × 10+04−6.55 × 10+03−1.71 × 10+04−6.23 × 10+03−3.77 × 10+04−1.14 × 10+04
Min−4.19 × 10+04−3.02 × 10+04−2.72 × 10+04−8.53 × 10+03−2.42 × 10+04−1.87 × 10+04−4.11 × 10+04−2.93 × 10+04
F9Ave0.00 × 10+004.39 × 10+027.13 × 10+021.71 × 10−085.69 × 10+022.65 × 10−141.84 × 10−011.06 × 10+02
Std0.00 × 10+004.38 × 10+017.98 × 10+019.18 × 10−087.50 × 10+014.81 × 10−149.89 × 10−014.83 × 10+01
Max0.00 × 10+005.42 × 10+028.85 × 10+025.12 × 10−077.61 × 10+021.14 × 10−135.51 × 10+001.77 × 10+02
Min0.00 × 10+003.41 × 10+025.77 × 10+020.00 × 10+004.29 × 10+020.00 × 10+000.00 × 10+002.46 × 10+01
F10Ave8.88 × 10−161.37 × 10+011.80 × 10+015.01 × 10+001.92 × 10+013.85 × 10−141.03 × 10−131.02 × 10−13
Std0.00 × 10+001.27 × 10+001.33 × 10+003.86 × 10+004.85 × 10−013.26 × 10−158.35 × 10−159.73 × 10−15
Max8.88 × 10−161.56 × 10+011.95 × 10+011.50 × 10+012.00 × 10+014.35 × 10−141.22 × 10−131.29 × 10−13
Min8.88 × 10−161.10 × 10+011.42 × 10+011.67 × 10−071.81 × 10+013.29 × 10−148.62 × 10−147.90 × 10−14
F11Ave0.00 × 10+001.85 × 10+011.71 × 10+021.71 × 10−063.16 × 10+020.00 × 10+003.22 × 10−031.09 × 10−03
Std0.00 × 10+008.60 × 10+008.61 × 10+014.10 × 10−061.43 × 10+020.00 × 10+008.40 × 10−034.18 × 10−03
Max0.00 × 10+004.32 × 10+013.93 × 10+021.68 × 10−056.29 × 10+020.00 × 10+003.18 × 10−022.00 × 10−02
Min0.00 × 10+006.56 × 10+002.66 × 10+011.08 × 10−131.20 × 10+020.00 × 10+000.00 × 10+000.00 × 10+00
F12Ave3.96 × 10−082.17 × 10+021.02 × 10+051.16 × 10+002.47 × 10+081.26 × 10−012.24 × 10−018.95 × 10−02
Std4.03 × 10−085.59 × 10+021.52 × 10+051.42 × 10−012.68 × 10+085.36 × 10−025.43 × 10−022.81 × 10−02
Max1.52 × 10−073.13 × 10+036.10 × 10+051.71 × 10+001.02 × 10+093.67 × 10−014.05 × 10−011.60 × 10−01
Min5.53 × 10−122.55 × 10+012.32 × 10+029.83 × 10−014.07 × 10+026.62 × 10−021.62 × 10−014.44 × 10−02
F13Ave4.36 × 10−065.66 × 10+043.14 × 10+071.15 × 10+014.51 × 10+086.19 × 10+006.08 × 10+004.56 × 10+00
Std1.18 × 10−059.38 × 10+041.02 × 10+081.40 × 10+004.28 × 10+085.01 × 10−014.03 × 10−015.58 × 10−01
Max6.54 × 10−055.01 × 10+054.13 × 10+081.59 × 10+011.64 × 10+097.26 × 10+006.66 × 10+005.74 × 10+00
Min4.63 × 10−101.88 × 10+036.23 × 10+041.01 × 10+011.48 × 10+045.17 × 10+005.21 × 10+003.21 × 10+00
Friedman Ave Rank1.15135.9282 7.1949 4.9333 7.2385 3.1628 3.0551 3.3359
Rank16758324
Table 11. Results of ITSO with improved optimization algorithms for 200-dimensional high-dimensional functions, The bolded part is the best result.
Table 11. Results of ITSO with improved optimization algorithms for 200-dimensional high-dimensional functions, The bolded part is the best result.
FunctionCriteriaITSOAGPSOMPSOOBSCAPSOGSACGWOGWOCSIGWO
F1Ave0.00 × 10+003.67 × 10+041.18 × 10+051.93 × 10−048.52 × 10+042.38 × 10−247.40 × 10−216.90 × 10−19
Std0.00 × 10+006.31 × 10+031.72 × 10+043.60 × 10−041.41 × 10+042.24 × 10−247.08 × 10−215.66 × 10−19
Max0.00 × 10+005.02 × 10+041.60 × 10+051.32 × 10−031.22 × 10+059.31 × 10−243.32 × 10−202.91 × 10−18
Min0.00 × 10+002.29 × 10+048.06 × 10+042.61 × 10−095.58 × 10+043.79 × 10−251.38 × 10−211.34 × 10−19
F2Ave0.00 × 10+004.26 × 10+027.28 × 10+023.53 × 10−106.34 × 10+373.17 × 10−156.16 × 10−135.01 × 10−13
Std0.00 × 10+008.60 × 10+018.24 × 10+019.07 × 10−103.41 × 10+381.37 × 10−152.89 × 10−131.69 × 10−13
Max0.00 × 10+006.85 × 10+028.79 × 10+024.82 × 10−091.90 × 10+397.19 × 10−151.71 × 10−129.37 × 10−13
Min0.00 × 10+002.81 × 10+025.78 × 10+027.07 × 10−136.84 × 10+021.22 × 10−152.45 × 10−132.64 × 10−13
F3Ave0.00 × 10+004.25 × 10+057.64 × 10+057.69 × 10+045.16 × 10+053.99 × 10+031.19 × 10+034.26 × 10+04
Std0.00 × 10+001.03 × 10+051.67 × 10+055.16 × 10+041.07 × 10+054.12 × 10+038.09 × 10+021.01 × 10+04
Max0.00 × 10+006.21 × 10+051.18 × 10+062.02 × 10+057.20 × 10+051.59 × 10+042.90 × 10+036.35 × 10+04
Min0.00 × 10+002.54 × 10+054.67 × 10+053.81 × 10+033.52 × 10+051.55 × 10+021.33 × 10+022.51 × 10+04
F4Ave0.00 × 10+006.32 × 10+017.71 × 10+018.80 × 10+019.73 × 10+017.62 × 10+011.45 × 10−013.23 × 10+01
Std0.00 × 10+003.49 × 10+007.00 × 10+004.53 × 10+001.28 × 10+002.98 × 10+011.85 × 10−013.65 × 10+00
Max0.00 × 10+007.37 × 10+019.66 × 10+019.47 × 10+019.89 × 10+011.00 × 10+027.38 × 10−014.01 × 10+01
Min0.00 × 10+005.62 × 10+016.82 × 10+017.59 × 10+019.25 × 10+017.29 × 10+001.54 × 10−032.64 × 10+01
F5Ave1.34 × 10−032.04 × 10+072.59 × 10+086.35 × 10+031.47 × 10+081.98 × 10+021.98 × 10+021.97 × 10+02
Std2.75 × 10−037.46 × 10+069.35 × 10+071.39 × 10+041.17 × 10+083.23 × 10−015.30 × 10−011.05 × 10+00
Max1.45 × 10−024.81 × 10+075.21 × 10+086.45 × 10+044.83 × 10+081.98 × 10+021.98 × 10+021.98 × 10+02
Min4.10 × 10−089.92 × 10+069.04 × 10+072.01 × 10+022.20 × 10+061.97 × 10+021.96 × 10+021.94 × 10+02
F6Ave4.60 × 10−053.52 × 10+041.21 × 10+054.87 × 10+018.85 × 10+041.73 × 10+012.80 × 10+012.15 × 10+01
Std8.62 × 10−059.21 × 10+032.00 × 10+043.11 × 10+002.24 × 10+043.12 × 10+001.03 × 10+001.33 × 10+00
Max4.67 × 10−046.11 × 10+041.61 × 10+056.51 × 10+011.35 × 10+052.38 × 10+013.02 × 10+012.51 × 10+01
Min1.23 × 10−072.24 × 10+048.38 × 10+044.70 × 10+014.69 × 10+041.20 × 10+012.63 × 10+011.94 × 10+01
F7Ave2.67 × 10−041.68 × 10+021.16 × 10+035.05 × 10−021.76 × 10+011.65 × 10−014.69 × 10−031.49 × 10−02
Std1.78 × 10−041.03 × 10+023.88 × 10+024.49 × 10−023.15 × 10+005.30 × 10−021.76 × 10−033.29 × 10−03
Max6.36 × 10−045.83 × 10+022.16 × 10+032.18 × 10−012.77 × 10+013.17 × 10−018.79 × 10−032.42 × 10−02
Min2.88 × 10−057.03 × 10+014.67 × 10+025.94 × 10−031.02 × 10+018.10 × 10−021.25 × 10−038.67 × 10−03
F8Ave−8.38 × 10+04−4.41 × 10+04−3.58 × 10+04−1.06 × 10+04−2.99 × 10+04−1.31 × 10+04−7.76 × 10+04−3.57 × 10+04
Std9.39 × 10−022.28 × 10+032.53 × 10+036.61 × 10+022.14 × 10+031.76 × 10+031.14 × 10+031.37 × 10+04
Max−8.38 × 10+04−3.92 × 10+04−2.87 × 10+04−9.30 × 10+03−2.31 × 10+04−1.03 × 10+04−7.53 × 10+04−1.50 × 10+04
Min−8.38 × 10+04−4.88 × 10+04−4.11 × 10+04−1.17 × 10+04−3.50 × 10+04−1.84 × 10+04−8.00 × 10+04−5.52 × 10+04
F9Ave0.00 × 10+001.20 × 10+031.73 × 10+037.24 × 10−041.22 × 10+031.89 × 10−131.54 × 10+001.91 × 10+02
Std0.00 × 10+007.91 × 10+011.07 × 10+023.82 × 10−031.07 × 10+021.86 × 10−134.17 × 10+001.26 × 10+02
Max0.00 × 10+001.33 × 10+031.92 × 10+032.13 × 10−021.44 × 10+034.55 × 10−132.05 × 10+015.49 × 10+02
Min0.00 × 10+001.04 × 10+031.57 × 10+032.62 × 10−101.00 × 10+030.00 × 10+002.27 × 10−131.22 × 10+01
F10Ave8.88 × 10−161.76 × 10+011.96 × 10+011.11 × 10+011.96 × 10+012.69 × 10−135.80 × 10−125.51 × 10−11
Std0.00 × 10+002.94 × 10−019.58 × 10−025.35 × 10+003.38 × 10−016.17 × 10−141.99 × 10−122.37 × 10−11
Max8.88 × 10−161.82 × 10+011.98 × 10+011.76 × 10+012.00 × 10+014.59 × 10−131.18 × 10−111.04 × 10−10
Min8.88 × 10−161.71 × 10+011.94 × 10+018.06 × 10−051.90 × 10+011.86 × 10−132.13 × 10−122.51 × 10−11
F11Ave0.00 × 10+003.06 × 10+021.14 × 10+031.99 × 10−031.26 × 10+031.32 × 10−032.29 × 10−039.43 × 10−04
Std0.00 × 10+007.74 × 10+011.70 × 10+027.71 × 10−032.22 × 10+024.94 × 10−035.96 × 10−033.77 × 10−03
Max0.00 × 10+004.16 × 10+021.51 × 10+034.26 × 10−021.95 × 10+032.01 × 10−022.04 × 10−021.93 × 10−02
Min0.00 × 10+001.72 × 10+026.90 × 10+022.99 × 10−099.41 × 10+020.00 × 10+001.11 × 10−161.11 × 10−16
F12Ave4.30 × 10−083.15 × 10+063.55 × 10+082.42 × 10+046.59 × 10+082.52 × 10−014.73 × 10−011.15 × 10+01
Std8.22 × 10−082.76 × 10+062.41 × 10+081.30 × 10+054.45 × 10+081.02 × 10−015.34 × 10−027.44 × 10+00
Max3.29 × 10−071.24 × 10+078.80 × 10+087.26 × 10+051.54 × 10+096.71 × 10−015.63 × 10−012.61 × 10+01
Min1.92 × 10−106.03 × 10+056.82 × 10+071.18 × 10+007.72 × 10+061.26 × 10−013.62 × 10−013.80 × 10−01
F13Ave4.36 × 10−062.29 × 10+079.81 × 10+082.52 × 10+031.21 × 10+091.60 × 10+011.60 × 10+012.08 × 10+01
Std9.08 × 10−061.15 × 10+074.11 × 10+081.30 × 10+048.19 × 10+084.01 × 10−014.37 × 10−011.65 × 10+01
Max4.68 × 10−056.66 × 10+071.85 × 10+097.24 × 10+043.28 × 10+091.67 × 10+011.72 × 10+011.07 × 10+02
Min5.48 × 10−108.68 × 10+061.33 × 10+082.02 × 10+012.10 × 10+071.53 × 10+011.51 × 10+011.36 × 10+01
Friedman Ave Rank1.05005.8128 7.2436 5.0487 7.0872 3.1038 2.9205 3.7333
Rank16857324
Table 12. Results of ITSO with improved optimization algorithms for 500-dimensional high-dimensional functions, The bolded part is the best result.
Table 12. Results of ITSO with improved optimization algorithms for 500-dimensional high-dimensional functions, The bolded part is the best result.
FunctionCriteriaITSOAGPSOMPSOOBSCAPSOGSACGWOGWOCSIGWO
F1Ave0.00 × 10+002.87 × 10+056.66 × 10+054.67 × 10+015.43 × 10+052.47 × 10−154.98 × 10−131.37 × 10−10
Std0.00 × 10+001.95 × 10+043.56 × 10+041.79 × 10+025.79 × 10+041.88 × 10−152.53 × 10−137.70 × 10−11
Max0.00 × 10+003.16 × 10+057.27 × 10+059.24 × 10+026.41 × 10+058.44 × 10−151.11 × 10−123.73 × 10−10
Min0.00 × 10+002.44 × 10+055.68 × 10+055.48 × 10−044.31 × 10+056.45 × 10−161.17 × 10−133.88 × 10−11
F2Ave1.70 × 10−052.19 × 10+271.20 × 10+1427.33 × 10−074.26 × 10+2679.16 × 10−102.59 × 10−081.46 × 10+270
Std5.20 × 10−051.18 × 10+286.46 × 10+1421.85 × 10−06INF3.35 × 10−106.73 × 10−09INF
Max2.86 × 10−046.56 × 10+283.60 × 10+1431.01 × 10−051.28 × 10+2691.76 × 10−094.51 × 10−084.37 × 10+271
Min3.16 × 10−141.46 × 10+031.94 × 10+031.79 × 10−102.97 × 10+924.68 × 10−101.72 × 10−081.55 × 10−03
F3Ave4.31 × 10−2272.44 × 10+064.17 × 10+068.89 × 10+053.01 × 10+061.63 × 10+055.98 × 10+044.89 × 10+05
Std0.00 × 10+005.48 × 10+056.55 × 10+053.61 × 10+056.48 × 10+056.42 × 10+042.61 × 10+046.16 × 10+04
Max1.29 × 10−2253.63 × 10+065.57 × 10+062.30 × 10+064.78 × 10+063.49 × 10+051.14 × 10+056.23 × 10+05
Min0.00 × 10+001.27 × 10+062.31 × 10+064.21 × 10+052.03 × 10+065.51 × 10+041.47 × 10+043.77 × 10+05
F4Ave0.00 × 10+007.43 × 10+019.88 × 10+019.83 × 10+019.87 × 10+019.99 × 10+011.91 × 10+015.30 × 10+01
Std0.00 × 10+002.86 × 10+003.56 × 10−015.37 × 10−017.42 × 10−014.81 × 10−014.30 × 10+002.79 × 10+00
Max0.00 × 10+007.99 × 10+019.94 × 10+019.90 × 10+019.97 × 10+011.00 × 10+022.93 × 10+015.84 × 10+01
Min0.00 × 10+006.81 × 10+019.79 × 10+019.70 × 10+019.63 × 10+019.74 × 10+018.34 × 10+004.76 × 10+01
F5Ave2.26 × 10−033.39 × 10+082.11 × 10+091.08 × 10+068.30 × 10+084.98 × 10+024.97 × 10+026.58 × 10+02
Std5.22 × 10−035.58 × 10+071.65 × 10+081.91 × 10+061.88 × 10+082.65 × 10−014.49 × 10−012.28 × 10+02
Max2.81 × 10−024.73 × 10+082.50 × 10+091.03 × 10+071.32 × 10+094.98 × 10+024.98 × 10+021.39 × 10+03
Min2.34 × 10−062.24 × 10+081.80 × 10+097.25 × 10+033.34 × 10+084.97 × 10+024.96 × 10+024.98 × 10+02
F6Ave7.59 × 10−052.82 × 10+056.85 × 10+051.41 × 10+025.79 × 10+059.34 × 10+019.38 × 10+018.35 × 10+01
Std1.15 × 10−042.74 × 10+042.92 × 10+043.21 × 10+015.76 × 10+042.95 × 10+001.73 × 10+002.39 × 10+00
Max5.85 × 10−043.53 × 10+057.31 × 10+052.37 × 10+026.80 × 10+059.81 × 10+019.84 × 10+018.88 × 10+01
Min1.17 × 10−092.27 × 10+056.20 × 10+051.23 × 10+024.47 × 10+058.37 × 10+019.04 × 10+017.88 × 10+01
F7Ave2.87 × 10−045.36 × 10+031.96 × 10+048.80 × 10+003.56 × 10+021.01 × 10−011.38 × 10−022.22 × 10−01
Std3.05 × 10−041.08 × 10+031.83 × 10+031.79 × 10+017.90 × 10+013.77 × 10−024.95 × 10−037.10 × 10−02
Max1.66 × 10−038.63 × 10+032.34 × 10+048.66 × 10+015.33 × 10+021.90 × 10−012.99 × 10−023.53 × 10−01
Min3.02 × 10−053.77 × 10+031.55 × 10+045.90 × 10−022.33 × 10+021.38 × 10−026.96 × 10−037.80 × 10−02
F8Ave−2.09 × 10+05−7.68 × 10+04−6.37 × 10+04−1.70 × 10+04−4.79 × 10+04−2.93 × 10+04−1.67 × 10+05−7.48 × 10+04
Std3.56 × 10−014.74 × 10+035.11 × 10+031.17 × 10+033.83 × 10+032.22 × 10+033.08 × 10+033.14 × 10+04
Max−2.09 × 10+05−6.81 × 10+04−5.58 × 10+04−1.46 × 10+04−3.95 × 10+04−2.59 × 10+04−1.59 × 10+05−2.39 × 10+04
Min−2.09 × 10+05−8.50 × 10+04−7.70 × 10+04−1.98 × 10+04−5.69 × 10+04−3.51 × 10+04−1.74 × 10+05−1.13 × 10+05
F9Ave0.00 × 10+004.12 × 10+035.62 × 10+032.25 × 10+003.61 × 10+032.66 × 10−092.36 × 10+001.76 × 10+02
Std0.00 × 10+001.57 × 10+021.60 × 10+021.21 × 10+013.75 × 10+021.43 × 10−083.82 × 10+001.02 × 10+02
Max0.00 × 10+004.40 × 10+035.93 × 10+036.75 × 10+014.20 × 10+037.96 × 10−081.52 × 10+014.94 × 10+02
Min0.00 × 10+003.73 × 10+035.29 × 10+037.29 × 10−102.96 × 10+033.64 × 10−121.73 × 10−115.60 × 10+01
F10Ave8.88 × 10−161.88 × 10+012.02 × 10+011.69 × 10+012.00 × 10+011.60 × 10−092.86 × 10−084.98 × 10−07
Std0.00 × 10+001.43 × 10−016.81 × 10−025.75 × 10+005.50 × 10−024.63 × 10−108.97 × 10−091.52 × 10−07
Max8.88 × 10−161.92 × 10+012.03 × 10+012.02 × 10+012.01 × 10+012.63 × 10−095.80 × 10−088.82 × 10−07
Min8.88 × 10−161.86 × 10+012.00 × 10+012.93 × 10−031.98 × 10+017.59 × 10−101.45 × 10−082.51 × 10−07
F11Ave0.00 × 10+002.56 × 10+036.11 × 10+033.11 × 10−016.49 × 10+031.01 × 10−158.37 × 10−043.73 × 10−03
Std0.00 × 10+001.93 × 10+023.17 × 10+026.01 × 10−014.82 × 10+024.94 × 10−164.51 × 10−037.72 × 10−03
Max0.00 × 10+002.92 × 10+036.67 × 10+033.24 × 10+007.60 × 10+032.55 × 10−152.51 × 10−022.36 × 10−02
Min0.00 × 10+002.12 × 10+035.46 × 10+036.89 × 10−055.75 × 10+034.44 × 10−162.92 × 10−144.71 × 10−12
F12Ave4.62 × 10−082.06 × 10+084.24 × 10+092.55 × 10+062.41 × 10+095.68 × 10−018.38 × 10−016.43 × 10+01
Std8.70 × 10−084.89 × 10+075.51 × 10+084.10 × 10+069.93 × 10+081.06 × 10−012.68 × 10−016.67 × 10+00
Max4.34 × 10−073.01 × 10+085.21 × 10+091.39 × 10+075.27 × 10+098.29 × 10−011.40 × 10+008.90 × 10+01
Min4.10 × 10−131.29 × 10+082.92 × 10+094.49 × 10+007.28 × 10+084.12 × 10−015.02 × 10−015.32 × 10+01
F13Ave6.74 × 10−068.39 × 10+089.05 × 10+091.11 × 10+074.81 × 10+094.61 × 10+014.69 × 10+019.74 × 10+02
Std1.27 × 10−051.39 × 10+087.61 × 10+081.64 × 10+071.49 × 10+095.52 × 10−011.56 × 10+008.90 × 10+01
Max6.00 × 10−051.16 × 10+091.06 × 10+106.19 × 10+078.87 × 10+094.80 × 10+015.16 × 10+011.17 × 10+03
Min7.33 × 10−116.06 × 10+087.16 × 10+091.32 × 10+022.55 × 10+094.52 × 10+014.33 × 10+018.18 × 10+02
Friedman Ave Rank1.18465.7308 7.3744 5.0231 6.7923 3.1154 2.6487 4.1308
Rank16857324
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Yang, W.; Xia, K.; Li, T.; Xie, M.; Zhao, Y. An Improved Transient Search Optimization with Neighborhood Dimensional Learning for Global Optimization Problems. Symmetry 2021, 13, 244. https://doi.org/10.3390/sym13020244

AMA Style

Yang W, Xia K, Li T, Xie M, Zhao Y. An Improved Transient Search Optimization with Neighborhood Dimensional Learning for Global Optimization Problems. Symmetry. 2021; 13(2):244. https://doi.org/10.3390/sym13020244

Chicago/Turabian Style

Yang, Wenbiao, Kewen Xia, Tiejun Li, Min Xie, and Yaning Zhao. 2021. "An Improved Transient Search Optimization with Neighborhood Dimensional Learning for Global Optimization Problems" Symmetry 13, no. 2: 244. https://doi.org/10.3390/sym13020244

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop