An Improved Atom Search Optimization With Cellular
An Improved Atom Search Optimization With Cellular
fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
Date of publication xxxx 00, 0000, date of current version xxxx 00, 0000.
Digital Object Identifier 10.1109/ACCESS.2017.DOI
ABSTRACT Atom search optimization (ASO) is a newly developed metaheuristic algorithm inspired
by molecular basis dynamics. The paramount challenge in ASO is that it is prone to stagnation in local
optima and premature convergence. To solve these issues, this paper uses a cellular automata structure, a
Lévy flight and adaptive weight strategies to help ASO balance exploration and exploitation; the proposed
method is named CALFASO. First, the cellular automata structure provides more information exchange for
the population and enriches the diversity of the population. Second, a Lévy flight has the characteristics of
a random walk, its short-step long-term search can improve the global search capability of the algorithm,
and its short-term long-step mutations can help the algorithm jump out of local optima. Third, adaptive
weights can effectively improve convergence performance. Finally, the proposed CALFASO was evaluated
on the CEC2017 test set and real-world engineering problems and compared with classical and novel
evolutionary algorithms to verify its performance. The experimental results and statistical analysis show that
the performance of the proposed CALFASO algorithm is better than that of the other selected algorithms.
INDEX TERMS Atom search optimization, Evolutionary algorithms, Cellular automata, Lévy flight
VOLUME 4, 2016 1
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
algorithm motivated by the transverse orientation of moths convergence due to attraction, and the randomness of the LF
in nature. In summary, it can be seen that the inspiration and strategy increases the ability to jump, preventing the atoms
mechanism of metaheuristic algorithms based on populations from agglomerating in the later stage and falling into a local
are different, but they have obvious advantages compared optimum. Meanwhile, adaptive weights are used to balance
with those of solution-based algorithms: i) Information ex- exploration and exploitation. To the best of the authors’
change between populations, mutual learning, and common knowledge, there is no study proposed in the literature to
growth can improve the convergence performance and op- improve the ASO with a CA structure, LFs and adaptive
timization ability of the algorithm. ii) Collaboration among weights. The main contributions and motivation of this paper
populations balances exploration and exploitation better. can be summarized as follows:
Atom search optimization (ASO) [20] is a novel physical 1) Cellular automata (CA) are used to enhance information
metaheuristic algorithm that is inspired by molecular dynam- exchange and enrich population diversity. The CA structure
ics. ASO mimics the interaction between atoms (attraction can provide more effective information exchange and prevent
and repulsion) resulting from the Lennard-Jones potential the decrease in exploration ability caused by excessive atom
and the constraint forces resulting from the bond-length attraction. In this paper, we use six classic CA structures and
potential. In ASO, the position of each atom in the search choose the best structure for comparison with the selected
space represents the solution measured by the mass. The algorithm based on the sensitivity test.
heavier the mass is, the better the solution is, and vice 2) The LF strategy can help an atom generate more random
versa. Light atoms are good for exploration, and heavy atoms operations during the iteration process and help the atom
are good for exploitation. Through a series of benchmark jump out of local optima. Research has shown that the
function tests and successful application in the dispersion LF strategy is applicable to many metaheuristic algorithms
coefficient estimation of groundwater, ASO has shown strong [25]–[27]. The Lévy index β for controlling stability is a
competitiveness and performance. Some efforts on ASO have key parameter, and changes in the parameter β will affect
been made in terms of real-world problems and theoretical the distribution of the LF. According to related research
research. An ASO algorithm-based hybrid antenna array with [28], [29], when β ∈ [1, 2], the LF will obtain the best
receive beamforming was utilized to control sidelobe level performance. Therefore, we performed constant and random
and steering [21] in 2019. The ASO algorithm and sine- number sensitivity tests for β to ensure the stability of the
cosine algorithm (SCA) were integrated for automatic data algorithm. Through the sensitivity tests of the CA and LF
clustering as proposed by Mohamed Abd Elaziz et al. [22] in strategies, the best structure of the CA and parameters β
2019. Ahmed M. Agwa et al. [23] used the ASO algorithm of the LF were selected, and the comparison test for the
for the steady-state modeling of fuel cells in 2019. Baran algorithms was performed.
[24] proposed a chaotic atom search optimization algorithm 3) The adaptive weight is a linearly decreasing function; in
(ChASO) to help the ASO algorithm balance exploration the early stages of the iteration, global search is guaranteed
and exploitation, which was successfully applied to DC mo- to occur, and in the later stages of the iteration, the stability
tor speed control. However, similar to other metaheuristic of the atom is maintained, and small-scale exploration is
algorithms, although the original ASO algorithm is simple performed. Therefore, the adaptive weight is used to help the
and easy to implement, it suffers from two main drawbacks: population transition from exploration to exploitation during
premature convergence and falling into local optima. In ASO, the iterative process.
in the early stage of the iteration, there is a wide range 4) The proposed CALFASO algorithm was tested on the
of mutual attraction between atoms. Attraction will cause CEC2017 [30]–[32] test set and engineering problems, and
atoms to tend to aggregate, lose the ability to explore the it was compared with classic, novel and high-performing
entire search space, and converge prematurely. At the end variants of the other algorithms. Meanwhile, to obtain the
of the iteration, the weak repulsive force cannot truly help best CA structure and LF parameters, sensitivity analysis
the atoms jump out of local optima, and each atom will was performed. To more clearly show the contribution of
also be attracted by the best atom (with the best fitness), the different methods proposed, a synergy analysis of each
causing the atoms to gather near the best atom, which causes strategy was performed.
it to fall into a local optimum. Premature convergence affects 5) Cellular automata (CA), a Lévy Flight (LF) and adaptive
exploration, and falling into local optima affects exploitation. weights are applied to improve the performance of the ASO
Therefore, balancing exploration and exploitation is one of algorithm. The experimental results and statistical analysis
the core problems of the algorithm. Exploration emphasizes also verify the correctness of the hypothesis. Detailed statis-
global search—conducting extensive searches through the tical analysis are given in this paper based on qualitative anal-
entire search space—with the goal of finding more promising ysis, quantitative analysis, convergence preference, pairwise
optimal areas. Exploitation emphasizes local search and finds comparative analysis (Wilcoxon signed rank test) and the
optimal solutions in promising areas. Therefore, the motiva- Friedman test. The statistical analysis more clearly validates
tion of our proposed method is to help balance the atomic the effectiveness of the improvement.
interactions in the ASO algorithm. The CA structure is used The paper is structured as follows. In Section II, the origi-
to provide good information exchange to prevent premature nal ASO algorithm is briefly introduced. The detailed presen-
2 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
tation of the proposed CALFASO algorithm is described in difference vector. rij is the Euclidean distance between the
Section III. Benchmark functions, parameter settings, sensi- ith and the jth atoms.
tivity tests and engineering problems are provided in Section
IV. The experimental results and statistical analysis will be t − 1 3 − 20t
η(t) = χ(1 − ) e T (4)
discussed in Section V. Conclusions and prospects for future T
research will be given in Section VI.
where χ is the depth weight and is set to 50 in this
paper. T is the maximum number of iterations. Therefore,
II. ATOM SEARCH OPTIMIZATION (ASO)
there are two main factors affecting the interaction force
In ASO [20], the position of each atom in the feasible
F : η(t) and h. The functional behavior of F , with differ-
solution space represents a solution and is described by its
ent η(η= 1, 5, 10, 30, 50) corresponding to h values ranging
mass. Heavier atoms have smaller acceleration and repre-
from 0.9 to 2, is illustrated in Fig. 1. The scaled distance
sent better solutions. Lighter atoms have greater acceleration
between two atoms is defined by 5.
and represent worse solutions. There are interaction forces
between atoms: attraction and repulsion. In the iterative rij (t)
process, repulsion can effectively prevent the premature con- hmin , σ(t) < hmin
rij (t) rij (t)
σ(t) , hmin ≤ σ(t) ≤ hmax
vergence of an atom, and certain attraction can guide the hij (t) = (5)
atom’s movement. In atomic systems, there are three main rij (t)
hmax , σ(t) > hmax
mathematical representations: interaction forces, geometric
constraints, and atomic motion. Through atomic interaction, where hmin and hmax denote the lower and upper bounds
attraction and repulsion balance exploration and exploitation of the scaled distance h, respectively, and are expressed as 6.
well.
hmin = g0 + g(t)
A. INTERACTION FORCE (6)
hmax = u
The L-J potential between atoms is the source of atomic
interaction forces, and the sum of the forces acting on the where g0 is the lowest limit, set to 1.1, and u is the upper
ith atom is described as (1). limit, set to 1.24. g(t) is the drift factor, which can make the
X algorithm drift from exploration to exploitation and is defined
Fid (t) = randj Fijd (t) (1) by 7.
j∈Kbest
where randj [0,1] is a random number. Kbest is a collec- π t
tion containing the K best atoms, which consist of the first K g(t) = 0.1 × sin × (7)
2 T
atoms with the best fitness function values. During the early
iterations, to perform more exploration, each atom needs to The length scale σ(t) in 5 denotes the collision diameter
interact with as many atoms with better fitness values as pos- and is defined by 8.
sible, which are its K neighbors. During the final iterations,
P
to perform more exploitation, each atom needs to interact
xij (t)
with as few atoms with better fitness values as possible as j∈Kbest
σ(t) =
xij (t), (8)
K(t)
its K neighbors. Therefore, K gradually decreases as the
iteration progresses and is described by 2. 2
r
t
K(t) = N − (N − 2) × (2) B. GEOMETRIC CONSTRAINTS
T
Geometric constraints in molecular dynamics appear as co-
where N is the size of the atomic population, t is the valent bond connections in atomic motion. To solve the
current iteration and T is the maximum number of iterations. optimization problem, assume that each atom is connected
Fijd (t) is the interaction force applied to the ith atom by the to the atom with the best fitness value, so the constraint force
jth atom at the tth iteration to solve the optimization problem can be described by (9).
and is described by (3).
Gdi (t) = λ(t)(xdbest (t) − xdi (t)) (9)
h i ~r
−13 −7 ij
Fij (t) = −η(t) 2(hij (t)) − (hij (t)) (3) where xbest (t) is the position of the best atom at the tth
rij
iteration. The best atom is the atom with the best fitness. The
where η(t) is the depth function to adjust the repulsion Lagrangian multiplier is defined by (10).
region or attraction region and can be expressed by (4).
rij 20t
hij (t) = σ(t) is the ratio of the distance between two atoms λ(t) = θe− T (10)
to the length scale, which in this paper is called the scaled
distance between two atoms. ~rij = ~xj − ~xi is the position where θ is the multiplier weight and is set to 0.2.
VOLUME 4, 2016 3
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
where mi (t) is the mass of each atom and can be calculated Similarly, adaptive weight is a very widely used and simple
by the expressions (12) and (13). method. The most classic is the weight factor in PSO [6] to
F iti (t)−F itbest (t)
help the algorithm transition from exploration to exploita-
− F it tion in iteration. An example of recent success is hetero-
Mi (t) = e worst (t)−F itbest (t) (12)
geneous comprehensive learning particle swarm optimiza-
Mi (t)
mi (t) = PN (13) tion (HCLPSO) [43], which sets different adaptive weights
j=1 Mj (t) and helps different subpopulations complete their tasks. The
where F itbest (t) and F itworst (t) are the best and worst three strategies have strong theoretical support, which has
fitness values at the tth iteration, respectively. prompted us to use them to improve the performance of the
Therefore, the velocity and position can be expressed as original ASO.
(14) and (15).
A. CELLULAR AUTOMATA (CA) STRUCTURE
vid (t + 1) = randdi vid (t) + adi (t) (14) CA were first proposed by Von Neumann and Ulam in
1966. In contrast to general dynamics models, CA are not
xdi (t + 1) = xdi (t) + vid (t + 1) (15)
determined by strictly defined physical equations or functions
where i = 1, 2, · · · , N and N is the size of the popu- but are constituted by a series of rules constructed by models.
lation. d = 1, 2, · · · , D, D is the dimension of the search CA are characterized by discrete time, space, and state. Each
4 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
prevents the atoms from stagnation due to falling into local -150
-400 -350 -300 -250 -200 -150 -100 -50 0 50 100
optima during the movement and helps atoms perform global
search on a wider area. The equation of an LF distribution
FIGURE 4. Trajectory of the Lévy flight (the number of steps is 500, the
based on a Fourier transform can be described by (18) [42]. number of dimensions is 3, and the random number β = 1.4; the random walk
h i is characterized by short steps for long-term search and occasional long-step
β jumping).
F (k) = exp −α|k| ) (18)
where the skewness and scale factor α ∈ [−1, 1]. Deb and
adjusted. The adaptive weight parameters are set according
Lee’s [50] [51] research found that different β values affect
to classical PSO [6]. In this paper, the adaptive weight w is
the distribution of an LF. The larger β is, the smaller the step
defined by (23).
size, and vice versa. Therefore, to obtain better parameters
and ensure the stability of the Lévy distribution, the Man- w = 0.9 − 0.5 ∗ t/T (23)
tegna technique [52] is used to obtain the LF parameters. The
step size is described by (19). Therefore, through analysis of the three strategies, we
find that they can help atoms jump out of local optima,
→
prevent premature convergence, and balance exploration and
u →
rand(1, Dim) ⊕ levi(β) ∼ 0.01 ( (t) − X α (t)) (19)
−β X
exploitation; the velocity is defined by (24).
v
where parameters u and v are obtained by the normal vid (t + 1) = w ∗ randdi vid (t). ∗ LF (β)
(24)
distribution described by (20), where σu is defined as (21). + randdi (Sid − xdi (t)) + adi
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
In Figs. 7-10, the convergence curves of different functions the composite functions f21 − f30 , the proposed CALFASO
are shown. A convergence curve can clearly show the con- algorithm achieves the best average results on functions
vergence rate and convergence accuracy. For the unimodal f21 − f24 and f29 . The ASO algorithms achieved the best
function f1 , simple multimodal function f9 , and composite average results on functions f22 and f26 . SPSO2011, VS,
function f22 , after a short period of exploration, the conver- DSA and BMA achieved the best average results on functions
gence curve drops rapidly. For the composite function f27 , f28 , f25 , f27 , f30 , respectively. The proposed CALFASO
the convergence curve drops slowly, indicating that more algorithm has a total rank of 83.5, and it ultimately ranks
local optimal operations are being performed. Therefore, first, with significantly better performance than other selected
we can conclude that complex functions execute a longer algorithms. It is worth noting that the proposed CALFASO
convergence process to ensure the accuracy of convergence. algorithm has more advantages in solving complex func-
Different algorithms have their own key factors, and acceler- tions because it benefits from the combination of the CA
ation is a core parameter in this paper. It can be seen from structure’s information exchange and the LF strategy’s long
the trajectory of acceleration that the acceleration tends to and short jumps. These strategies significantly improve the
stabilize after a brief small-scale oscillation, which is of great algorithm’s convergence performance and its ability to avoid
significance for balancing exploration and exploitation. local optima.
Through the above qualitative analysis, the four qualitative Tables 7-8 present the results for 50 and 100 dimen-
parameters show the performance of the proposed CAL- sions, respectively. On 50 and 100 dimensions, the proposed
FASO algorithm from different perspectives. In summary, the CALFASO algorithm has 13 and 15 functions ranked first,
proposed CALFASO algorithm has good convergence and respectively. For 50 dimensions, its total rank is 65, and
optimal trajectory, and it balances exploration and exploita- its final rank is 1. On 100 dimensions, its total rank is 65,
tion well. and its final rank is 1. The experimental results show that
with the increase of dimensions, the performance of the
B. RESULTS OF DIFFERENT ALGORITHMS ON proposed CALFASO algorithm is better than that of the other
CEC2017 BENCHMARK FUNCTIONS algorithms, which proves its stability and anti-interference
In this section, the proposed CALFASO algorithm is com- to a certain extent. In summary, the proposed CALFASO
pared with 9 other selected algorithms on the CEC2017 test algorithm shows better performance on the CEC2017 test
set. To ensure the validity and fairness of the results, the set, balancing the exploration and exploitation better than the
following parameters were set: The population size was 50, other algorithms.
the maximum number of evaluations was 300,000, and the
number of independent runs was 30. We used 3 dimensions C. CONVERGENCE PREFERENCE OF THE
(30, 50, and 100) to test the stability of the algorithm. To ALGORITHMS
observe the experimental results more clearly, each function There is no optimization algorithm that can best perform
is ranked according to the best average result, and the ranking for all different types of problems, hence the performance
of each function is arithmetically combined to obtain the total evaluation of the proposed algorithm should come from
rank and the final rank. different perspectives by using multifarious benchmark func-
Table 6 shows the test results on 30 dimensions. The tions. Therefore, in this section, different types of functions
proposed CALFASO algorithm ranks first on 13 functions, on different dimensions are randomly selected, and their
and its performance is significantly better than that of other convergence processes are constructed to evaluate the perfor-
algorithms. For the unimodal functions, SPSO2011, VS and mance of the proposed CALFASO algorithm. The maximum
the BMA achieved the best average results on function f3 . number of evaluations FES is 300,000. To save calculation
The BMA also achieved the best average results on function costs, the result is calculated every 100 times. The conver-
f1 . The proposed CALFASO algorithm obtained satisfactory gence graph intuitively shows the convergence performance
results on both functions f1 and f3 . For the simple multi- of an algorithm and is an important metric for evaluating the
modal functions f4 − f10 , the performance of the proposed algorithm. As shown in Fig. 11, we selected the convergence
CALFASO algorithm on functions f5 − f10 is better than that curves of different functions on different dimensions. Dif-
of the other selected algorithms. The BMA achieved the best ferent types of functions can comprehensively evaluate the
average result on function f4 . CLPSO and the DSA achieved performance of the algorithm. From Fig. 11, we can intu-
the best average result on function f6 , and the DSA and ASO itively see that the proposed CALFASO algorithm has good
achieved the best average result on function f9 . For hybrid convergence performance and obtains satisfactory results in
functions f11 − f20 , the proposed CALFASO algorithm both convergence rate and accuracy. On 30 dimensions, the
ranks first on functions f11 and f17 . The BMA achieved the proposed CALFASO performs a better convergence than the
best average result on functions f12 − f15 and f18 − f19 . others on functions f5 , f8 , f10 , f21 , f24 . On 50 dimensions,
CLPSO achieved the best average result on functions f16 the proposed CALFASO performs a better convergence than
and f20 . The proposed CALFASO algorithm has certain the others on functions f5 , f20 , f24 , f26 . For function f1 ,
advantages in solving simple multimodal functions, and the the GSA is superior the others. On 100 dimensions, the
BMA has certain advantages in solving hybrid functions. For proposed CALFASO performs a better convergence than the
VOLUME 4, 2016 9
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
FIGURE 7. Qualitative results of function f1 for four qualitative indicators: the search process, trajectory curve, convergence curve, and trajectory curve of acceleration.
FIGURE 8. Qualitative results of function f9 for four qualitative indicators: the search process, trajectory curve, convergence curve, and trajectory curve of acceleration.
others on functions f3 , f8 , f10 , f13 , f21 . Figs. 11 show to its competitors on the benchmark functions, including
that from the perspective of the convergence performance, unimodal, multimodal, hybrid and composition functions.
the proposed CALFASO is highly competitive compared
10 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
FIGURE 9. Qualitative results of function f22 for four qualitative indicators: search process, trajectory curve, convergence curve, and trajectory curve of acceleration.
FIGURE 10. Qualitative results of function f27 for four qualitative indicators: search process, trajectory curve, convergence curve, and trajectory curve of acceleration.
D. COMPARISON OF STATISTICAL RESULTS GIVEN BY tical results given by different algorithms for the gear train
DIFFERENT ENGINEERING PROBLEMS design—except for the OSA and BOA, all the algorithms
In this section, the results of two engineering problems are can obtain the target value results. As seen from Table 12—
discussed. As shown in Table 10—the comparison of statis-
VOLUME 4, 2016 11
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
a comparison of the statistical results given by different al- respectively. Table 14 shows that in the Friedman test, the
gorithms for the tension/compression spring design—the VS proposed CALFASO algorithm achieves the best results in
algorithm obtains the best average result. Among the results the different dimensions and has obvious advantages over the
of the optimal values, the proposed CALFASO algorithm selected algorithms.
is closest to the target value. In summary, the proposed
CALFASO algorithm is still competitive on unconstrained VI. CONCLUSIONS AND PROSPECTS
and constrained engineering problems. In this paper, the CA structure, Lévy flight and adaptive
weight are used to help ASO balance exploration and ex-
E. STATISTICAL ANALYSIS ploitation; the new method is named CALFASO. To verify
Statistical analysis is a scientific, accurate, objective evalua- the performance of the proposed CALFASO algorithm, the
tion method, and it is of great significance for the methodical CEC2017 test set and two real-world engineering problems
verification of experimental results [55]. This paper uses non- were used for testing. To analyze the experimental results
parametric statistical tests to analyze the significant differ- for all aspects, quantitative and qualitative analyses were
ences between the proposed CALFASO algorithm and other performed, and statistical analysis further verified the sta-
selected algorithms. For pairwise comparison of the problem- bility and accuracy of the algorithm. In summary, the per-
solving success of evolutionary algorithms, a problem-based formance of the proposed CALFASO algorithm is superior
or multi-problem-based statistical comparison method can be to that of other selected algorithms in this paper. The CA
used [56], [57]. strategy provides more information exchange for the atoms
In this paper, the Wilcoxon signed rank test (WSRT) was and enriches the diversity of the population. The LF strategy
used to perform a pairwise comparison test, where the sig- effectively helps the population to explore and avoid falling
nificance level was α = 0.05. WSRT is a nonparametric test into local optima. Adaptive weight effectively improves the
that can be used to test which algorithm has better statistical convergence performance of the algorithm. The conclusion
performance when multiple algorithms are compared on dif- shows that the three strategies have a good effect on ASO
ferent benchmark functions. ‘+’ represents that the proposed performance.
CALFASO outperforms the comparison algorithm at a 95% It is worth noting that the strategy proposed in this paper
significance level (α = 0.05). ‘=’ indicates that there is no still has some possibility for improvement, such as devel-
significant difference between the proposed CALFASO algo- oping a new CA structure, as the inherent CA structure
rithm and the comparison algorithm. ‘−’ indicates that the limits the population’s communication opportunities. At the
proposed CALFASO algorithm shows poorer performance same time, the LF trajectory of each individual may be
than the comparison algorithm. The last line gives a summary more conducive to the search of the population. At the
of the three comparisons (+/ = /−). In this paper, the same time, nonlinear weights may have advantages over
average result of each algorithm running independently 30 linear weights. The proposed CALFASO algorithm, with
times is used for the WRST. To comprehensively analyze the the help of CA, an LF, and adaptive weights, solves the
results of the statistical analysis, the WRST was performed single-objective optimization problem of CEC2017 well and
on 3 dimensions (30, 50, 100). As shown in Table 9, 11 and has good performance in engineering cases. However, at the
13, the performance of the proposed CALFASO algorithm same time, there are more thought-provoking observations.
in the pairwise comparison is significantly better than that The concept of the neighbor structure provided by cellular
of the other selected algorithms. The proposed CALFASO automata is applied in the ASO algorithm. This approach
performs well compared to the classical algorithm, emerging only helps to increase information exchange and give atoms
algorithm and excellent algorithm variants. It is particularly a better movement trend. Analysis of the chaotic behavior of
worth noting that the three proposed strategies have greatly cellular automata may be more important. At the same time,
improved the performance of the original ASO algorithm. In the parameter settings in a LF are analyzed manually. There
the comparison of the 30, 50, and 100 dimensions, the WRST may be a large number of parameters for different strategies,
results of the proposed CALFASO and the original ASO and automatic parameter determination is more promising
algorithm are 14/10/5, 18/8/3, and 21/7/1, respectively. than manual determination. From the experimental results
It is clear from the results that the performance of the and analysis, CA and the LF have made great contributions to
proposed CALFASO is even better in higher dimensions. improve the performance of the algorithm, and their ease of
As the number of dimensions increases, the advantages be- implementation is their advantage. All methods boil down to
come more apparent. Table 14 shows the mean rank of all the ingenuity of mathematics, making their analysis and inte-
algorithms in this paper according to the Friedman test [58] gration attractive. At the same time, real improvement should
on all test functions, and the highest rank is shown in bold. not be only measured by test functions and engineering cases.
Additionally, the corresponding p-values are listed in the last After improving the performance of the algorithm, it is worth
row. The Friedman statistic is distributed according to chi- exploring its potential to solve complex real-world problems.
square with 7 degrees of freedom, and the p-values of the dif- In the future, our work will start from the following prin-
ferent dimensions calculated by the Friedman test are 7.68E- ciples: (1) Research on the ASO algorithm can be extended
11, 7.38E-11, and 4.23E-11 for 30, 50, and 100 dimensions, to multi-objective optimization problems. (2) The ASO al-
VOLUME 4, 2016 13
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
gorithm should be applied to neural network optimization [20] W. Zhao, L. Wang, and Z. Zhang, “Atom search optimization and its
problems, such as BP and RBF neural networks. (3) More im- application to solve a hydrogeologic parameter estimation problem,”
Knowledge-Based Systems, vol. 163, pp. 283–304, 2019.
provements can be made to the CA structure and LFs. (4) Dif- [21] M. A. Almagboul, F. Shu, Y. Qian, X. Zhou, J. Wang, and J. Hu, “Atom
ferent versions of ASO applications should be developed for search optimization algorithm based hybrid antenna array receive beam-
real-world problems. (5) Stability and convergence analysis forming to control sidelobe level and steering the null,” AEU-International
Journal of Electronics and Communications, vol. 111, p. 152854, 2019.
are difficult points of evolutionary algorithms. Convergence [22] M. A. Elaziz, N. Nabil, A. A. Ewees, and S. Lu, “Automatic data clustering
analysis of ASO algorithm will be studied in the future. based on hybrid atom search optimization and sine-cosine algorithm,” in
2019 IEEE Congress on Evolutionary Computation (CEC). IEEE, 2019,
pp. 2315–2322.
ACKNOWLEDGMENT [23] A. M. Agwa, A. A. El-Fergany, and G. M. Sarhan, “Steady-state modeling
The authors thank the anonymous reviewers for providing of fuel cells based on atom search optimizer,” Energies, vol. 12, no. 10, p.
valuable comments to improve this paper. 1884, 2019.
[24] B. Hekimoğlu, “Optimal tuning of fractional order pid controller for dc
motor speed control via chaotic atom search optimization algorithm,”
REFERENCES IEEE Access, vol. 7, pp. 38 100–38 114, 2019.
[25] H. Haklı and H. Uğuz, “A novel particle swarm optimization algorithm
[1] X. Yang, “Introduction to mathematical optimization,” From Linear Pro-
with levy flight,” Applied Soft Computing, vol. 23, pp. 333–345, 2014.
gramming to Metaheuristics, 2008.
[26] J.-H. Lin, C.-W. Chou, C.-H. Yang, H.-L. Tsai et al., “A chaotic levy flight
[2] Y. Zhou, J. Wang, Y. Zhou, Z. Qiu, Z. Bi, and Y. Cai, “Differential
bat algorithm for parameter estimation in nonlinear dynamic biological
evolution with guiding archive for global numerical optimization,” Applied
systems,” Computer and Information Technology, vol. 2, no. 2, pp. 56–63,
Soft Computing, vol. 43, pp. 424–440, 2016.
2012.
[3] A. A. Heidari, R. A. Abbaspour, and A. R. Jordehi, “An efficient chaotic
[27] A. F. Kamaruzaman, A. M. Zain, S. M. Yusuf, and A. Udin, “Levy
water cycle algorithm for optimization tasks,” Neural Computing and
flight algorithm for optimization problems-a literature review,” in Applied
Applications, vol. 28, no. 1, pp. 57–85, 2017.
Mechanics and Materials, vol. 421. Trans Tech Publ, 2013, pp. 496–501.
[4] ——, “Gaussian bare-bones water cycle algorithm for optimal reactive
[28] M. M. Zaw and E. E. Mon, “Web document clustering using cuckoo
power dispatch in electrical power systems,” Applied Soft Computing,
search clustering algorithm based on levy flight,” International Journal of
vol. 57, pp. 657–671, 2017.
Innovation and Applied Studies, vol. 4, no. 1, pp. 182–188, 2013.
[5] S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi, “Optimization by simulated
annealing,” science, vol. 220, no. 4598, pp. 671–680, 1983. [29] R. Jensi and G. W. Jiji, “An enhanced particle swarm optimization with
levy flight for global optimization,” Applied Soft Computing, vol. 43, pp.
[6] R. Eberhart and J. Kennedy, “A new optimizer using particle swarm
248–261, 2016.
theory,” in MHS’95. Proceedings of the Sixth International Symposium
on Micro Machine and Human Science. IEEE, 1995, pp. 39–43. [30] P. J. B. N.H.Awad, M.Z.Ali, “Problem definitions and evaluation criteria
for the cec 2017 special session and competition on single objective real-
[7] A. R. Jordehi, “Binary particle swarm optimisation with quadratic transfer
parameter numerical optimization,” International Journal of Intelligent
function: A new binary optimisation algorithm for optimal scheduling of
Computing and Cybernetics, 2016.
appliances in smart homes,” Applied Soft Computing, vol. 78, pp. 465–
480, 2019. [31] R. Salgotra, U. Singh, and S. Saha, “Improved cuckoo search with better
[8] B. Jana, S. Mitra, and S. Acharyya, “Repository and mutation based search capabilities for solving cec2017 benchmark problems,” in 2018
particle swarm optimization (rmpso): A new pso variant applied to recon- IEEE Congress on Evolutionary Computation (CEC). IEEE, 2018, pp.
struction of gene regulatory network,” Applied Soft Computing, vol. 74, 1–7.
pp. 330–355, 2019. [32] R. Salgotra, U. Singh, S. Saha, and A. Nagar, “New improved salshade-
[9] R. Storn and K. Price, “Differential evolution-a simple and efficient cnepsin algorithm with adaptive parameters,” in 2019 IEEE Congress on
heuristic for global optimization over continuous spaces,” Journal of global Evolutionary Computation (CEC). IEEE, 2019, pp. 3150–3156.
optimization, vol. 11, no. 4, pp. 341–359, 1997. [33] P. A. Davidson, “An introduction to magnetohydrodynamics,” 2002.
[10] J. H. Holland, “Adaptation in natural and artificial systems. 1975,” Ann [34] J. Conway, “The game of life,” Scientific American, vol. 223, no. 4, p. 4,
Arbor, MI: University of Michigan Press and, 1992. 1970.
[11] S. Mirjalili, S. M. Mirjalili, and A. Lewis, “Grey wolf optimizer,” Ad- [35] Y. Shi, H. Liu, L. Gao, and G. Zhang, “Cellular particle swarm optimiza-
vances in engineering software, vol. 69, pp. 46–61, 2014. tion,” Information Sciences, vol. 181, no. 20, pp. 4460–4493, 2011.
[12] E. Rashedi, H. Nezamabadi-Pour, and S. Saryazdi, “Gsa: a gravitational [36] J. Yi, L. Gao, X. Li, and J. Gao, “An efficient modified harmony search
search algorithm,” Information sciences, vol. 179, no. 13, pp. 2232–2248, algorithm with intersect mutation operator and cellular local search for
2009. continuous function optimization problems,” Applied Intelligence, vol. 44,
[13] R. Salgotra and U. Singh, “The naked mole-rat algorithm,” Neural Com- no. 3, pp. 725–753, 2016.
puting and Applications, vol. 31, no. 12, pp. 8837–8857, 2019. [37] E. Alba and B. Dorronsoro, “The exploration/exploitation tradeoff in
[14] S. Khalilpourazari and S. Khalilpourazary, “Optimization of time, cost dynamic cellular genetic algorithms,” IEEE transactions on evolutionary
and surface roughness in grinding process using a robust multi-objective computation, vol. 9, no. 2, pp. 126–142, 2005.
dragonfly algorithm,” Neural Computing and Applications, pp. 1–12, [38] D. W. Sims, E. J. Southall, N. E. Humphries, G. C. Hays, C. J. Bradshaw,
2018. J. W. Pitchford, A. James, M. Z. Ahmed, A. S. Brierley, M. A. Hindell
[15] I. Aljarah, H. Faris, and S. Mirjalili, “Optimizing connection weights in et al., “Scaling laws of marine predator search behaviour,” Nature, vol.
neural networks using the whale optimization algorithm,” Soft Computing, 451, no. 7182, p. 1098, 2008.
vol. 22, no. 1, pp. 1–15, 2018. [39] X.-S. Yang and S. Deb, “Cuckoo search via lévy flights,” in 2009 World
[16] R. Salgotra, U. Singh, and S. Saha, “New cuckoo search algorithms with Congress on Nature & Biologically Inspired Computing (NaBIC). IEEE,
enhanced exploration and exploitation properties,” Expert Systems with 2009, pp. 210–214.
Applications, vol. 95, pp. 384–420, 2018. [40] A. K. Bhateja, A. Bhateja, S. Chaudhury, and P. Saxena, “Cryptanalysis of
[17] M. A. El Aziz and A. E. Hassanien, “Modified cuckoo search algorithm vigenere cipher using cuckoo search,” Applied Soft Computing, vol. 26,
with rough sets for feature selection,” Neural Computing and Applications, pp. 315–324, 2015.
vol. 29, no. 4, pp. 925–934, 2018. [41] G. Kalantzis, C. Shang, Y. Lei, and T. Leventouri, “Investigations of a gpu-
[18] K. Kaur, U. Singh, and R. Salgotra, “An enhanced moth flame optimiza- based levy-firefly algorithm for constrained optimization of radiation ther-
tion,” Neural Computing and Applications, pp. 1–35, 2018. apy treatment planning,” Swarm and Evolutionary Computation, vol. 26,
[19] A. K. Qin, V. L. Huang, and P. N. Suganthan, “Differential evolution pp. 191–201, 2016.
algorithm with strategy adaptation for global numerical optimization,” [42] W. A. Hussein, S. Sahran, and S. N. H. S. Abdullah, “Patch-levy-based
IEEE transactions on Evolutionary Computation, vol. 13, no. 2, pp. 398– initialization algorithm for bees algorithm,” Applied Soft Computing,
417, 2008. vol. 23, pp. 104–121, 2014.
14 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
[43] N. Lynn and P. N. Suganthan, “Heterogeneous comprehensive learning FIRST A. AUTHOR was born in Baoding, Hebei
particle swarm optimization with enhanced exploration and exploitation,” Province, China, in 1995. He received a B.E.
Swarm and Evolutionary Computation, vol. 24, pp. 11–24, 2015. degree in electrical engineering and automation
[44] S. Wolfram, A new kind of science. Wolfram media Champaign, IL, from Yan Shan University in 2018. He is currently
2002, vol. 5. pursuing an M.S. degree in control science and
[45] ——, Cellular automata and complexity: collected papers. CRC Press, engineering from the School of Electronic and
2018. Information Engineering, University of Science
[46] M. Guidolin, A. S. Chen, B. Ghimire, E. C. Keedwell, S. Djordjević, and
and Technology Liaoning, Anshan, China.
D. A. Savić, “A weighted cellular automata 2d inundation model for rapid
flood analysis,” Environmental Modelling & Software, vol. 84, pp. 378–
394, 2016.
[47] R. Alonso-Sanz, “Cellular automata with memory,” Cellular Automata: A
Volume in the Encyclopedia of Complexity and Systems Science, Second
Edition, pp. 153–183, 2018.
[48] C. Lu, L. Gao, and J. Yi, “Grey wolf optimizer with cellular topological
structure,” Expert Systems with Applications, vol. 107, pp. 89–114, 2018.
[49] G. M. Viswanathan, V. Afanasyev, S. Buldyrev, E. Murphy, P. Prince,
and H. E. Stanley, “Lévy flight search patterns of wandering albatrosses,”
Nature, vol. 381, no. 6581, p. 413, 1996.
[50] X.-S. Yang and S. Deb, “Multiobjective cuckoo search for design opti- SECOND B. AUTHOR was born in Anshan,
mization,” Computers & Operations Research, vol. 40, no. 6, pp. 1616– Liaoning, China. He received B.S. and M.S. de-
1624, 2013.
grees in control science and engineering from the
[51] C.-Y. Lee and X. Yao, “Evolutionary algorithms with adaptive lévy muta-
University of Science and Technology Liaoning,
tions,” in Proceedings of the 2001 Congress on Evolutionary Computation
(IEEE Cat. No. 01TH8546), vol. 1. IEEE, 2001, pp. 568–575. Anshan, in 1987 and 1990, respectively, and a
[52] R. N. Mantegna, “Fast, accurate algorithm for numerical simulation of levy Ph.D. in control science from Dalian University
stable stochastic processes,” Physical Review E, vol. 49, no. 5, p. 4677, of Technology, China, in 2005. He is currently a
1994. Professor and a graduate student supervisor in the
[53] R. Paulavičius, Y. D. Sergeyev, D. E. Kvasov, and J. Žilinskas, “Globally- School of Electronic and Information Engineering,
biased disimpl algorithm for expensive global optimization,” Journal of University of Science and Technology Liaoning,
Global Optimization, vol. 59, no. 2-3, pp. 545–567, 2014. Anshan, China. His main research area of interest is the modeling of complex
[54] E. Sandgren, “Nonlinear integer and discrete programming in mechanical industry processes and intelligent control.
design optimization,” Journal of Mechanical Design, vol. 112, no. 2, pp.
223–229, 1990.
[55] S. García, A. Fernández, J. Luengo, and F. Herrera, “Advanced non-
parametric tests for multiple comparisons in the design of experiments
in computational intelligence and data mining: Experimental analysis of
power,” Information Sciences, vol. 180, no. 10, pp. 2044–2064, 2010.
[56] J. Derrac, S. García, D. Molina, and F. Herrera, “A practical tutorial on
the use of nonparametric statistical tests as a methodology for comparing
evolutionary and swarm intelligence algorithms,” Swarm and Evolutionary
Computation, vol. 1, no. 1, pp. 3–18, 2011. THIRD C. AUTHOR was born in Chengde, Hebei
[57] P. Civicioglu, “Backtracking search optimization algorithm for numerical Province, China, in 1996. He received a B.E.
optimization problems,” Applied Mathematics and Computation, vol. 219, degree in automation from Liaoning University
no. 15, pp. 8121–8144, 2013. of Science and Technology in 2018. He is cur-
[58] H. Liu, G. Ding, and B. Wang, “Bare-bones particle swarm optimization rently pursuing an M.S. degree in control science
with disruption operator,” Applied Mathematics and Computation, vol. and engineering at the School of Electronics and
238, pp. 106–122, 2014. Information Engineering, Liaoning University of
[59] M. Zambrano-Bigiarini, M. Clerc, and R. Rojas, “Standard particle swarm Science and Technology Liaoning, Anshan, China.
optimisation 2011 at cec-2013: A baseline for future pso improvements,”
in 2013 IEEE Congress on Evolutionary Computation. IEEE, 2013, pp.
2337–2344.
[60] J. J. Liang, A. K. Qin, P. N. Suganthan, and S. Baskar, “Comprehensive
learning particle swarm optimizer for global optimization of multimodal
functions,” IEEE transactions on evolutionary computation, vol. 10, no. 3,
pp. 281–295, 2006.
[61] B. Doğan and T. Ölmez, “A new metaheuristic for numerical function
optimization: Vortex search algorithm,” Information Sciences, vol. 293,
pp. 125–145, 2015.
[62] P. Civicioglu, “Transforming geocentric cartesian coordinates to geodetic FOURTH D. AUTHOR was born in Zibo, Shang-
coordinates by using differential search algorithm,” Computers & Geo- dong Province, China, in 1995. He received a B.E.
sciences, vol. 46, pp. 229–247, 2012.
degree in automation engineering from the Uni-
[63] Q. Zhang, R. Wang, J. Yang, A. Lewis, F. Chiclana, and S. Yang, “Biology
versity of Jinan Quancheng College in 2019. He is
migration algorithm: a new nature-inspired heuristic methodology for
global optimization,” Soft Computing, pp. 1–26, 2018. currently pursuing an M.S. degree in control sci-
[64] M. Jain, S. Maurya, A. Rani, and V. Singh, “Owl search algorithm: a ence and engineering at the School of Electronics
novel nature-inspired heuristic paradigm for global optimization,” Journal and Information Engineering, Liaoning University
of Intelligent & Fuzzy Systems, vol. 34, no. 3, pp. 1573–1582, 2018. of Science and Technology Liaoning, Anshan,
[65] S. Arora and S. Singh, “Butterfly optimization algorithm: a novel approach China.
for global optimization,” Soft Computing, vol. 23, no. 3, pp. 715–734,
2019.
VOLUME 4, 2016 15
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
16 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
VOLUME 4, 2016 17
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
18 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
VOLUME 4, 2016 19
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
20 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
VOLUME 4, 2016 21
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
22 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
TABLE 9. Determining the algorithm that statistically provides the best solution for each benchmark function by utilizing the two-sided Wilcoxon signed-rank test
(α = 0.05): 30 dimensions.
Fun. SPSO2011 vs CALFASO CLPSO vs CALFASO VS vs CALFASO DSA vs CALFASO GSA vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 0.41652148 275 190 = 5.75E-06 455 10 - 0.658296677 329 136 = 1.73004E-06 465 0 - 0.861198 275 190 =
f3 3.8753E-06 462 3 - 1.73E-06 0 465 + 1.72351E-06 465 0 - 1.7344E-06 0 465 + 1.72E-06 0 465 +
f4 0.00276527 450 15 - 0.049492 450 15 - 0.068713631 437 28 = 0.059835601 444 21 = 0.000125 165 300 +
f5 2.1565E-05 114 351 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 1.7344E-06 0 465 + 1.72E-06 0 465 +
f6 1.5871E-06 0 465 + 1.55E-06 0 465 + 1.70299E-06 0 465 + 1 450 0 = 1.66E-06 0 465 +
f7 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.7344E-06 0 465 + 1.7344E-06 0 465 + 0.120445 255 210 =
f8 1.9209E-06 30 435 + 1.73E-06 0 465 + 1.73222E-06 0 465 + 1.7344E-06 0 465 + 1.73E-06 0 465 +
f9 1.3635E-06 0 465 + 1.68E-06 0 465 + 1.69227E-06 0 465 + 9.93433E-05 30 435 + 2.03E-06 0 435 +
f10 1.7333E-06 0 465 + 3.72E-05 140 325 + 5.79245E-05 165 300 + 9.71105E-05 140 325 + 1.92E-06 30 435 +
f11 1.0246E-05 140 325 + 0.370923 255 210 = 1.73331E-06 0 465 + 0.813016851 329 136 = 2.12E-06 30 435 +
f12 1.972E-05 87 378 + 1.64E-05 30 435 + 2.35198E-06 30 435 + 2.84342E-05 30 435 + 1.73E-06 0 465 +
f13 1.7333E-06 0 465 + 1.73E-06 465 0 - 1.73004E-06 0 465 + 0.018518975 255 210 - 1.73E-06 0 465 +
f14 0.0752056 212 253 = 9.31E-06 59 406 + 0.308602058 360 105 = 0.000615641 437 28 - 1.73E-06 0 465 +
f15 1.7333E-06 0 465 + 4.07E-05 450 15 - 1.73331E-06 0 465 + 0.025637124 420 45 - 0.000453 189 276 +
f16 0.05708993 275 190 = 0.012453 374 91 - 0.68835149 345 120 = 0.958990172 360 105 = 1.73E-06 0 465 +
f17 3.3987E-05 87 378 + 0.544006 234 231 = 9.31059E-06 30 435 + 0.004114031 255 210 - 1.73E-06 0 465 +
f18 0.00020507 165 300 + 0.010444 234 231 - 0.370922658 360 105 = 0.042766688 410 55 - 0.000261 114 351 +
f19 1.7333E-06 0 465 + 1.02E-05 462 3 - 1.91613E-06 30 435 + 0.614314564 345 120 = 0.658322 294 171 =
f20 0.13589744 212 253 = 0.14704 374 91 = 1.97295E-05 114 351 + 0.503832969 329 136 = 1.73E-06 0 465 +
f21 1.7333E-06 0 465 + 2.84E-05 30 435 + 1.7344E-06 0 465 + 1.7344E-06 0 465 + 1.73E-06 0 465 +
f22 0.828125 459 6 = 1.5E-06 0 465 + 3.03484E-06 0 406 + 0.003464804 294 136 - 1.56E-06 0 465 +
f23 3.8799E-06 59 406 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 1.7344E-06 0 465 + 1.73E-06 0 465 +
f24 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 1.7344E-06 0 465 + 1.73E-06 0 465 +
f25 4.7265E-06 114 351 + 1.73E-06 465 0 - 2.59671E-05 464 1 - 1.7344E-06 465 0 - 1.73E-06 0 465 +
f26 0.7035637 275 190 = 0.115599 360 105 = 1.73331E-06 0 465 + 0.07864666 189 276 = 0.829009 294 171 =
f27 0.00119734 234 231 - 1.73E-06 465 0 - 0.158844482 387 78 = 1.7344E-06 465 0 - 1.73E-06 0 465 +
f28 0.00032005 399 3 - 0.057057 275 190 = 0.014766428 275 190 - 0.030009891 275 190 - 0.008723 294 171 -
f29 1.7344E-06 0 465 + 3.72E-05 114 351 + 1.73331E-06 0 465 + 3.18168E-06 87 378 + 1.73E-06 0 465 +
f30 1.73E-06 0 465 + 0.001962 189 276 + 1.7344E-06 0 465 + 0.245190309 329 136 = 1.73E-06 0 465 +
+/=/- 19/6/4 15/5/9 20/6/3 11/8/10 24/4/1
Fun BMA vs CALFASO OSA vs CALFASO BOA vs CALFASO ASO vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 1.73E-06 465 0 - 1.73E-06 0 465 + 1.73222E-06 0 465 + 0.093666919 212 253 =
f3 1.7116E-06 465 0 - 1.73E-06 0 465 + 1.71269E-06 0 465 + 1.91613E-06 30 435 +
f4 3.4036E-05 462 3 - 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.14137899 399 66 =
f5 1.73E-06 0 465 + 1.73E-06 0 465 + 1.73222E-06 0 465 + 5.06967E-05 140 325 +
f6 1.7224E-06 0 465 + 1.56E-06 0 465 + 1.51654E-06 0 465 + 0.00012207 0 406 +
f7 1.7344E-06 0 465 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.000283079 165 300 +
f8 1.7344E-06 0 465 + 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.006434781 212 253 +
f9 1.7213E-06 0 465 + 1.64E-06 0 465 + 1.52926E-06 0 465 + 1 30 253 =
f10 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.000358884 189 276 +
f11 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.001832068 165 300 +
f12 1.7333E-06 465 0 - 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.000160464 114 351 +
f13 1.7333E-06 465 0 - 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.049498046 420 45 -
f14 1.7333E-06 465 0 - 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.106394173 234 231 =
f15 1.7988E-05 450 15 - 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.544006208 345 120 =
f16 1.9209E-06 30 435 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.543995559 329 136 =
f17 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.003378012 165 300 +
f18 1.7333E-06 465 0 - 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.002765274 189 276 +
f19 2.352E-06 462 3 - 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.271142526 399 66 =
f20 2.1619E-05 114 351 + 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.171376389 212 253 =
f21 1.7333E-06 0 465 + 1.73E-06 0 465 + 2.59671E-05 189 276 + 1.23808E-05 140 325 +
f22 0.00086637 30 325 + 1.5E-06 0 465 + 1.19771E-06 0 465 + 0.5 87 120 =
f23 1.7333E-06 0 465 + 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.001483498 165 300 +
f24 1.7344E-06 0 465 + 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.004388579 255 210 -
f25 2.352E-06 464 1 - 1.73E-06 0 465 + 1.73331E-06 0 465 + 0.00183258 459 6 -
f26 4.2832E-06 30 435 + 1.73E-06 0 465 + 1.73004E-06 0 465 + 0.001592246 399 66 -
f27 0.04491324 437 28 - 1.73E-06 0 465 + 1.7344E-06 0 465 + 0.781258073 360 105 =
f28 0.30815392 329 136 = 1.72E-06 0 465 + 1.71269E-06 0 465 + 0.002091083 374 78 -
f29 1.7344E-06 0 465 + 1.73E-06 0 465 + 1.73331E-06 0 465 + 1.73331E-06 0 465 +
f30 6.8892E-05 459 6 - 1.73E-06 0 465 + 1.73331E-06 0 465 + 3.87306E-06 87 378 +
+/=/- 16/1/12 29/0/0 29/0/0 14/10/5
TABLE 10. Comparison of statistical results given by different algorithms for the gear train design.
VOLUME 4, 2016 23
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
TABLE 11. Determining the algorithm that statistically provides the best solution for each benchmark function by utilizing the two-sided Wilcoxon signed-rank test
(α = 0.05): 50 dimensions.
Fun. SPSO2011 vs CALFASO CLPSO vs CALFASO VS vs CALFASO DSA vs CALFASO GSA vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 0.42836897 294 171 = 0.000955 234 231 - 7.50959E-06 59 406 + 0.213297549 255 210 = 0.00921 399 66 -
f3 2.0952E-06 30 435 + 1.73E-06 0 465 + 1.72677E-06 465 0 - 1.73331E-06 0 465 + 1.73E-06 0 465 +
f4 0.01102822 399 66 - 0.001819 450 15 - 0.975373491 312 153 = 0.001483068 444 21 - 0.000114 140 325 +
f5 1.5263E-06 0 465 + 1.59E-06 0 465 + 1.69227E-06 0 465 + 1.72895E-06 0 465 + 1.69E-06 0 465 +
f6 1.1048E-06 0 465 + 1.57E-06 0 465 + 1.688E-06 0 465 + 1.70514E-06 0 465 + 1.49E-06 0 465 +
f7 1.6583E-06 0 465 + 1.71E-06 0 465 + 1.69655E-06 0 465 + 1.73222E-06 0 465 + 1.72E-06 0 465 +
f8 1.7181E-06 0 465 + 1.72E-06 0 465 + 1.72677E-06 0 465 + 1.73222E-06 0 465 + 1.73E-06 0 465 +
f9 1.7041E-06 0 465 + 1.72E-06 0 465 + 1.72677E-06 0 465 + 2.35198E-06 59 406 + 1.71E-06 0 465 +
f10 1.6966E-06 0 465 + 1.69E-06 0 465 + 0.001611521 275 190 - 2.34621E-06 30 435 + 1.63E-06 0 465 +
f11 1.6966E-06 0 465 + 1.66E-06 0 465 + 1.69227E-06 0 465 + 5.78983E-05 189 276 + 1.68E-06 0 465 +
f12 4.6613E-06 87 378 + 1.68E-06 0 465 + 1.7246E-06 0 465 + 1.73331E-06 0 465 + 1.73E-06 0 465 +
f13 1.703E-06 0 465 + 3.72E-06 87 378 + 1.67948E-06 0 465 + 0.000419255 140 325 + 1.66E-06 0 465 +
f14 8.9714E-06 114 351 + 1.63E-06 0 465 + 0.001577699 212 253 + 3.72426E-05 87 378 + 1.71E-06 0 465 +
f15 1.6912E-06 0 465 + 2.3E-05 450 15 - 1.69655E-06 0 465 + 0.000388111 212 253 + 1.68E-06 0 465 +
f16 7.9627E-05 140 325 + 5.04E-06 87 378 + 1.89945E-06 30 435 + 2.12664E-06 30 435 + 1.72E-06 0 465 +
f17 0.35949199 255 210 = 0.67315 329 136 = 3.36958E-05 59 406 + 0.013974564 212 253 + 1.66E-06 0 465 +
f18 0.00018425 87 378 + 2.85E-05 30 435 + 3.0586E-05 30 435 + 3.11081E-05 30 435 + 3.06E-05 30 435 +
f19 1.6998E-06 0 465 + 1.65E-06 465 0 - 1.71918E-06 0 465 + 0.428417818 374 91 = 0.64328 360 105 =
f20 1.8144E-06 30 435 + 0.003723 275 190 - 1.61469E-06 0 465 + 5.2135E-06 59 406 + 1.62E-06 0 465 +
f21 1.9477E-06 30 435 + 1.58E-06 0 465 + 1.68907E-06 0 465 + 1.7344E-06 0 465 + 1.7E-06 0 465 +
f22 9.5959E-05 87 378 + 1.68E-06 0 465 + 4.63968E-06 30 435 + 0.271142526 312 153 = 1.68E-06 0 465 +
f23 2.2723E-06 30 435 + 1.72E-06 0 465 + 1.70514E-06 0 465 + 1.7344E-06 0 465 + 1.65E-06 0 465 +
f24 1.6827E-06 0 465 + 1.65E-06 0 465 + 1.71809E-06 0 465 + 1.7344E-06 0 465 + 1.71E-06 0 465 +
f25 0.79675106 275 190 = 0.59954 420 45 = 0.040346382 420 45 - 0.082206466 410 55 = 1.66E-06 0 465 +
f26 0.00015766 59 406 + 1.72E-06 0 465 + 1.71918E-06 0 465 + 1.7344E-06 0 465 + 7.64E-06 59 406 +
f27 1.688E-06 0 465 + 0.279998 374 91 = 0.036736469 329 136 - 0.102010695 410 55 = 1.72E-06 0 465 +
f28 0.00256966 410 55 - 0.298509 374 91 = 0.000385629 420 45 - 0.289464319 345 120 = 1.71E-06 0 465 +
f29 1.6795E-06 0 465 + 0.177081 374 91 = 1.86995E-06 30 435 + 2.12532E-06 30 435 + 1.69E-06 0 465 +
f30 1.688E-06 0 465 + 1.65E-06 465 0 - 1.72895E-06 0 465 + 1.7344E-06 465 0 - 1.72E-06 0 465 +
+/=/- 24/3/2 18/5/6 23/1/5 21/6/2 27/1/1
Fun BMA vs CALFASO OSA vs CALFASO BOA vs CALFASO ASO vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 0.00237892 212 253 + 1.71E-06 0 465 + 1.67948E-06 0 465 + 0.002237559 212 253 +
f3 1.7268E-06 465 0 - 1.73E-06 0 465 + 1.73004E-06 0 465 + 1.73222E-06 0 465 +
f4 1.9006E-06 464 1 - 1.72E-06 0 465 + 1.71701E-06 0 465 + 0.101874773 275 190 =
f5 1.671E-06 0 465 + 1.69E-06 0 465 + 1.70945E-06 0 465 + 4.66666E-06 30 435 +
f6 1.4533E-06 0 465 + 1.62E-06 0 465 + 1.51849E-06 0 465 + 1.47889E-06 0 465 +
f7 1.7041E-06 0 465 + 1.72E-06 0 465 + 1.67312E-06 0 465 + 0.115357859 294 171 =
f8 1.7192E-06 0 465 + 1.73E-06 0 465 + 1.71161E-06 0 465 + 1.72026E-06 0 465 +
f9 1.6955E-06 0 465 + 1.65E-06 0 465 + 1.72134E-06 0 465 + 2.38546E-06 464 0 -
f10 1.6312E-06 0 465 + 1.68E-06 0 465 + 1.61983E-06 0 465 + 0.105931503 374 91 =
f11 1.717E-06 0 465 + 1.63E-06 0 465 + 1.69762E-06 0 465 + 1.6987E-06 0 465 +
f12 1.7203E-06 465 0 - 1.73E-06 0 465 + 1.70407E-06 0 465 + 2.53974E-05 87 378 +
f13 4.6856E-06 114 351 + 1.71E-06 0 465 + 1.72026E-06 0 465 + 0.213067448 360 105 =
f14 1.6479E-06 465 0 - 1.71E-06 0 465 + 1.71701E-06 0 465 + 0.000818862 165 300 +
f15 0.00017326 455 10 - 1.69E-06 0 465 + 1.6987E-06 0 465 + 5.71959E-05 140 325 +
f16 1.7094E-06 0 465 + 1.71E-06 0 465 + 1.64996E-06 0 465 + 0.000147072 189 276 +
f17 1.7084E-06 0 465 + 1.71E-06 0 465 + 1.70514E-06 0 465 + 0.213140129 329 136 =
f18 1.6955E-06 465 0 - 1.67E-06 0 465 + 1.6573E-06 0 465 + 0.347528924 429 36 =
f19 1.6689E-06 465 0 - 1.71E-06 0 465 + 1.67948E-06 0 465 + 0.490258801 255 210 =
f20 1.6014E-06 0 465 + 1.59E-06 0 465 + 1.6987E-06 0 465 + 0.006704096 234 231 -
f21 1.6955E-06 0 465 + 1.71E-06 0 465 + 1.69227E-06 0 465 + 0.000114466 140 325 +
f22 2.5424E-06 0 435 + 1.66E-06 0 465 + 1.67948E-06 0 465 + 0.733803304 387 78 =
f23 1.7279E-06 0 465 + 1.71E-06 0 465 + 1.66045E-06 0 465 + 1.88878E-06 30 435 +
f24 1.7094E-06 0 465 + 1.72E-06 0 465 + 1.67736E-06 0 465 + 1.70192E-06 0 465 +
f25 0.02532555 429 36 - 1.71E-06 0 465 + 1.6594E-06 0 465 + 0.021520573 189 276 +
f26 1.7008E-06 0 465 + 1.7E-06 0 465 + 1.70837E-06 0 465 + 3.34703E-05 59 406 +
f27 2.7675E-06 30 435 + 1.71E-06 0 465 + 1.651E-06 0 465 + 1.71918E-06 0 465 +
f28 0.0014519 399 66 - 1.71E-06 0 465 + 1.70514E-06 0 465 + 0.000185783 455 10 -
f29 1.6626E-06 0 465 + 1.66E-06 0 465 + 1.61366E-06 0 465 + 2.24716E-06 59 406 +
f30 0.06539147 312 153 = 1.71E-06 0 465 + 1.64786E-06 0 465 + 1.70084E-06 0 465 +
+/=/- 19/1/9 29/0/0 29/0/0 18/8/3
TABLE 12. Comparison of the statistical results given by different algorithms for the tension/compression spring design.
24 VOLUME 4, 2016
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI
10.1109/ACCESS.2020.2979921, IEEE Access
TABLE 13. Determining the algorithm that statistically provides the best solution for each benchmark function by utilizing the two-sided Wilcoxon signed-rank test
(α = 0.05): 100 dimensions.
Fun. SPSO2011 vs CALFASO CLPSO vs CALFASO VS vs CALFASO DSA vs CALFASO GSA vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 0.50382169 374 91 = 0.236589 374 91 = 1.32761E-05 87 378 + 0.019514364 420 45 - 0.018145 420 45 -
f3 1.7322E-06 0 465 + 1.71E-06 0 465 + 1.671E-06 465 0 - 1.72895E-06 0 465 + 1.7E-06 0 465 +
f4 3.7067E-05 455 10 - 0.071663 234 231 = 0.000696758 455 10 - 2.15869E-05 462 3 - 1.7E-06 0 465 +
f5 1.9185E-06 30 435 + 1.71E-06 0 465 + 1.69334E-06 0 465 + 1.73222E-06 0 465 + 1.7E-06 0 465 +
f6 1.7322E-06 0 465 + 0.056171 140 325 = 1.58612E-06 0 465 + 7.67385E-06 450 15 - 1.67E-06 0 465 +
f7 1.7333E-06 0 465 + 1.71E-06 0 465 + 1.71377E-06 0 465 + 1.7344E-06 0 465 + 1.65E-06 0 465 +
f8 1.9197E-06 30 435 + 1.71E-06 0 465 + 1.66045E-06 0 465 + 1.73222E-06 0 465 + 1.7E-06 0 465 +
f9 0.97538391 345 120 = 1.4E-06 0 465 + 1.40411E-06 0 465 + 1.73331E-06 0 465 + 1.65E-06 0 465 +
f10 1.7333E-06 0 465 + 1.63E-06 0 465 + 1.73816E-05 87 378 + 1.73331E-06 0 465 + 1.89E-06 30 435 +
f11 0.00022206 59 406 + 1.7E-06 0 465 + 2.66327E-06 59 406 + 1.7344E-06 0 465 + 1.7E-06 0 465 +
f12 0.00048952 140 325 + 1.69E-06 0 465 + 1.69655E-06 0 465 + 1.92092E-06 30 435 + 1.71E-06 0 465 +
f13 1.7289E-06 0 465 + 2.01E-06 30 435 + 1.58511E-06 0 465 + 0.00089443 165 300 + 1.68E-06 0 465 +
f14 2.1201E-06 464 1 - 1.91E-06 30 435 + 0.004613221 114 351 + 5.74839E-06 30 435 + 0.002712 87 378 +
f15 1.7322E-06 0 465 + 1.89E-06 30 435 + 1.60546E-06 0 465 + 0.78126371 374 91 = 1.7E-06 0 465 +
f16 0.00642281 189 276 + 2.56E-06 59 406 + 8.20469E-06 87 378 + 1.7344E-06 0 465 + 1.68E-06 0 465 +
f17 0.13588709 275 190 = 0.404275 360 105 = 6.28576E-06 59 406 + 1.7344E-06 0 465 + 1.69E-06 0 465 +
f18 2.6002E-06 462 3 - 1.71E-06 0 465 + 4.62087E-06 59 406 + 1.7344E-06 0 465 + 1.69E-06 0 465 +
f19 1.73E-06 0 465 + 4.03E-05 114 351 + 1.68907E-06 0 465 + 0.184621877 312 153 = 1.71E-06 0 465 +
f20 1.7333E-06 0 465 + 3.68E-05 140 325 + 0.00052173 189 276 + 1.7344E-06 0 465 + 1.72E-06 0 465 +
f21 1.7333E-06 0 465 + 1.71E-06 0 465 + 1.70514E-06 0 465 + 1.7344E-06 0 465 + 1.69E-06 0 465 +
f22 1.7322E-06 0 465 + 1.68E-06 0 465 + 0.001814714 212 253 + 1.7344E-06 0 465 + 1.72E-06 0 465 +
f23 1.353E-05 59 406 + 1.68E-06 0 465 + 1.6531E-06 0 465 + 0.001035681 255 210 - 1.69E-06 0 465 +
f24 2.1253E-06 30 435 + 1.67E-06 0 465 + 1.68587E-06 0 465 + 1.7344E-06 0 465 + 1.68E-06 0 465 +
f25 0.00016021 437 28 - 0.796993 387 78 = 0.152241458 399 66 = 0.015658483 410 55 - 1.66E-06 0 465 +
f26 2.1214E-06 30 435 + 1.66E-06 0 465 + 1.66256E-06 0 465 + 1.7344E-06 0 465 + 1.64E-06 0 465 +
f27 1.7333E-06 0 465 + 0.036746 410 55 - 0.00056394 189 276 + 4.7292E-06 462 3 - 1.7E-06 0 465 +
f28 1.7322E-06 465 0 - 0.125018 387 78 = 8.35981E-06 455 10 - 0.009271025 410 55 - 1.68E-06 0 465 +
f29 1.7235E-06 0 465 + 9.47E-05 165 300 + 1.63224E-06 0 465 + 2.35198E-06 59 406 + 1.63E-06 0 465 +
f30 1.7322E-06 0 465 + 0.349091 374 91 = 1.71918E-06 0 465 + 8.18775E-05 450 15 - 1.72E-06 0 465 +
+/=/- 21/3/5 21/7/1 25/1/3 19/2/8 28/0/1
Fun BMA vs CALFASO OSA vs CALFASO BOA vs CALFASO ASO vs CALFASO
p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win p-Value R+ R- Win
f1 0.08188258 429 36 = 1.68E-06 0 465 + 1.67948E-06 0 465 + 0.338075795 410 55 =
f3 0.03318507 444 21 - 1.69E-06 0 465 + 1.61983E-06 0 465 + 1.61366E-06 0 465 +
f4 2.6025E-05 462 3 - 1.7E-06 0 465 + 1.69013E-06 0 465 + 4.10158E-06 30 435 +
f5 1.7148E-06 0 465 + 1.64E-06 0 465 + 1.64473E-06 0 465 + 1.72243E-06 0 465 +
f6 1.6752E-06 0 465 + 1.7E-06 0 465 + 1.68693E-06 0 465 + 1.70407E-06 0 465 +
f7 1.6891E-06 0 465 + 1.65E-06 0 465 + 1.64786E-06 0 465 + 0.105644529 345 120 =
f8 1.571E-06 0 465 + 1.66E-06 0 465 + 1.69227E-06 0 465 + 1.71809E-06 0 465 +
f9 1.6437E-06 0 465 + 1.68E-06 0 465 + 1.6594E-06 0 465 + 2.99539E-05 464 1 -
f10 1.6869E-06 0 465 + 1.7E-06 0 465 + 1.63744E-06 0 465 + 0.000276709 140 325 +
f11 2.8183E-06 59 406 + 1.65E-06 0 465 + 1.6987E-06 0 465 + 2.64378E-06 30 435 +
f12 0.00017395 450 15 - 1.68E-06 0 465 + 1.7246E-06 0 465 + 0.428234573 234 231 =
f13 1.8994E-06 30 435 + 1.66E-06 0 465 + 1.69013E-06 0 465 + 1.6531E-06 0 465 +
f14 1.6322E-06 465 0 - 1.65E-06 0 465 + 1.60751E-06 0 465 + 0.018028184 212 253 +
f15 0.00866761 234 231 - 1.68E-06 0 465 + 1.651E-06 0 465 + 0.236415003 374 91 =
f16 1.7148E-06 0 465 + 1.71E-06 0 465 + 1.67948E-06 0 465 + 0.000123618 165 300 +
f17 1.7127E-06 0 465 + 1.68E-06 0 465 + 1.69227E-06 0 465 + 0.205288147 387 78 =
f18 1.6944E-06 465 0 - 1.7E-06 0 465 + 1.71593E-06 0 465 + 0.000122597 140 325 +
f19 0.00023672 140 325 + 1.69E-06 0 465 + 1.6912E-06 0 465 + 0.004078592 189 276 +
f20 1.7019E-06 0 465 + 1.71E-06 0 465 + 1.68055E-06 0 465 + 0.00010494 87 378 +
f21 1.7257E-06 0 465 + 1.65E-06 0 465 + 1.69548E-06 0 465 + 1.70514E-06 0 465 +
f22 1.6944E-06 0 465 + 1.68E-06 0 465 + 1.67842E-06 0 465 + 0.089548148 294 171 =
f23 1.6322E-06 0 465 + 1.69E-06 0 465 + 1.68374E-06 0 465 + 1.68055E-06 0 465 +
f24 1.7116E-06 0 465 + 1.72E-06 0 465 + 1.71161E-06 0 465 + 1.71809E-06 0 465 +
f25 8.346E-06 459 6 - 1.67E-06 0 465 + 1.63536E-06 0 465 + 1.651E-06 0 465 +
f26 1.6636E-06 0 465 + 1.66E-06 0 465 + 1.71161E-06 0 465 + 1.87324E-05 87 378 +
f27 0.00095579 140 325 + 1.7E-06 0 465 + 1.68907E-06 0 465 + 1.67206E-06 0 465 +
f28 1.8478E-06 464 1 - 1.71E-06 0 465 + 1.70622E-06 0 465 + 0.001702015 212 253 +
f29 1.6848E-06 0 465 + 1.67E-06 0 465 + 1.671E-06 0 465 + 9.498E-05 165 300 +
f30 2.3062E-06 462 3 - 1.7E-06 0 465 + 1.70192E-06 0 465 + 0.991790439 399 66 =
+/=/- 19/1/9 29/0/0 29/0/0 21/7/1
TABLE 14. Average rankings achieved with the Friedman test on all benchmarks. The highest ranking is shown in bold.
VOLUME 4, 2016 25
This work is licensed under a Creative Commons Attribution 4.0 License. For more information, see https://creativecommons.org/licenses/by/4.0/.