Next Article in Journal
Focused Overview of Mycobacterium tuberculosis VapBC Toxin–Antitoxin Systems Regarding Their Structural and Functional Aspects: Including Insights on Biomimetic Peptides
Next Article in Special Issue
MPPT of PEM Fuel Cell Using PI-PD Controller Based on Golden Jackal Optimization Algorithm
Previous Article in Journal
LFVB-BioSLAM: A Bionic SLAM System with a Light-Weight LiDAR Front End and a Bio-Inspired Visual Back End
Previous Article in Special Issue
Design of Intelligent Neuro-Supervised Networks for Brain Electrical Activity Rhythms of Parkinson’s Disease Model
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Hybrid Manta Ray Foraging Algorithm with Cuckoo Search for Global Optimization and Three-Dimensional Wireless Sensor Network Deployment Problem

1
College of Artificial Intelligence, Guangxi Minzu University, Nanning 530006, China
2
Guangxi Key Laboratories of Hybrid Computation and IC Design Analysis, Nanning 530006, China
3
Faculty of Information Science and Technology, Universiti Kebangsaan Malaysia, Bangi 43600, Selangor, Malaysia
4
Xiangsihu College, Guangxi Minzu University, Nanning 530225, China
*
Authors to whom correspondence should be addressed.
Biomimetics 2023, 8(5), 411; https://doi.org/10.3390/biomimetics8050411
Submission received: 19 June 2023 / Revised: 9 August 2023 / Accepted: 15 August 2023 / Published: 5 September 2023
(This article belongs to the Special Issue Biomimicry for Optimization, Control, and Automation)

Abstract

:
In this paper, a new hybrid Manta Ray Foraging Optimization (MRFO) with Cuckoo Search (CS) algorithm (AMRFOCS) is proposed. Firstly, quantum bit Bloch spherical coordinate coding is used for the initialization of the population, which improves the diversity of the expansion of the traversal ability of the search space. Secondly, the dynamic disturbance factor is introduced to balance the exploratory and exploitative search ability of the algorithm. Finally, the unique nesting strategy of the cuckoo and Levy flight is introduced to enhance the search ability. AMRFOCS is tested on CEC2017 and CEC2020 benchmark functions, which is also compared and tested by using different dimensions and other state-of-the-art metaheuristic algorithms. Experimental results reveal that the AMRFOCS algorithm has a superior convergence rate and optimization precision. At the same time, the nonparametric Wilcoxon signed-rank test and Friedman test show that the AMRFOCS has good stability and superiority. In addition, the proposed AMRFOCS is applied to the three-dimensional WSN coverage problem. Compared with the other four 3D deployment methods optimized by metaheuristic algorithms, the AMRFOCS effectively reduces the redundancy of sensor nodes, possesses a faster convergence speed and higher coverage and then provides a more effective and practical deployment scheme.

1. Introduction

A wireless sensor network (WSN) is a wireless network composed of a set of sensor nodes, which is applied to monitor and record all aspects of the region of interest [1]. WSNs have been widely used in disaster relief, public safety, smart-city construction [2], agricultural monitoring and other fields [3,4]. One of the important problems in WSNs is optimizing the deployment of sensor nodes, which determines the regional coverage, overall network connectivity and network service quality of the WSN [5].
At present, the deployment of WSNs on a two-dimensional plane has been relatively well studied, while three-dimensional deployment has been less researched. The 3D deployment of wireless sensor networks is divided into two types: one is deployed in the 3D space, and the other is deployed on the surface [6]. The coverage optimization of wireless sensor networks on 3D surfaces has become a heated topic in wireless sensor network research due to its complexity and practicality [7].
Recently, researchers have applied a variety of bionic metaheuristic swarm intelligence algorithms to improve the performances of wireless sensor networks, including the extended coverage area, network lifetime, routing protocol, sensor random deployment, energy consumption model, etc. Table 1 specifically demonstrates the optimization performance of swarm intelligence algorithms in wireless sensor networks in recent years.
The swarm intelligence (SI) category has received abundant attention recently [8]. SI is a group-based algorithm driven by biological group behavior [9]. The diverse species in nature exhibit unique behaviors and habits. Swarm intelligence algorithms are mainly based on the foraging, communication and reproductive behaviors of biological organisms. Representative examples of these behaviors include Particle Swarm Optimization (PSO) [10], Ant Colony Optimization (ACO) [11], Cuckoo Search (CS) [12] algorithms, Artificial Bee Colony (ABC) [13], the Grey Wolf Optimizer (GWO) [14], the Butterfly Optimization Algorithm (BOA) [15], the Whale Optimization Algorithm (WOA) [16], Harris hawks optimization (HHO) [17], Manta Ray Foraging Optimization (MRFO) [18], Jellyfish Search (JS) [19], the Honey Badger Algorithm (HBA) [20], Sand Cat Swarm Optimization (SCSO) [21], the Dandelion Optimizer (DO) [22], the Coati Optimization Algorithm (COA) [23], the Fire Hawk Optimizer (FHO) [24] and the Sea-horse Optimizer (SHO) [25].
MRFO is a swarm intelligence algorithm proposed in 2020. Its inspiration comes from the foraging behavior of manta rays, which simulates three different foraging strategies: chain foraging, spiral foraging and flip-bucket foraging. In the foraging process, the conversion of different foraging methods is formulated as a conversion based on global and local optimization. MRFO has an excellent global optimization ability, as it has fewer adjustable parameters, simpler implementations and lower computational cost. It has been widely used in electrical engineering [26], civil engineering [27], image segmentation [28], photovoltaic models [29], network engineering [30] and structural design [31].
Although MRFO has been applied in many fields, previous studies have shown that its exploration ability is weak [32], and it is easy to stagnate the local optimum [33]. In order to solve this problem, this paper improves MRFO and applies it to WSN node deployment on a three-dimensional surface.
The structure of this paper is presented as follows: Section 2 focuses on the basic algorithm. In Section 3, the approach is proposed. Section 4 describes the experimental results and comparison of the CEC2017 and CEC2020 benchmark functions with AMRFOCS. Section 5 is about the application of AMRFOCS in the development optimization of wireless sensor nodes, and Section 6 contains conclusions and future work.
Table 1. The differences in the applications of different algorithms in WSNs.
Table 1. The differences in the applications of different algorithms in WSNs.
AlgorithmApplication in WSNsKey FeaturesAdvantagesLimitations
PSO [2]Coverage maximization, network lifetimeSwarm-based optimization, global search capabilityFast convergence, reduce costs, coverage enhancementScale limitations, obstacles not considered
CS [3]Node localizationThe flight characteristics of the cuckooBetter convergence, calculation accuracyTime consuming, complex implementation
WOA [34]Coverage optimizationSocial Behavior of humpback whalesHigh coverage, low deployment cost2D, convergence speed
GWO [35]Coverage optimizationGroup hunting behavior of gray wolvesEasy implementation, high search efficiencyTime consuming, 2D
SSA [36]Network data aggregationSquirrel foraging behaviorLow energy consumption, high accuracy2D, convergence speed
SMA [37]Node localization, 3DBehavior of slime moldLow complexity, high convergenceCPU time, high memory
ABC [38]Routing protocolHoney bee behaviorReduced convergence delay, low energy consumptionTime consuming, complex implementation
HBA [39]Smart cityForaging behavior of honey badgersLow energy consumption, high accuracyScale limitations, complex implementation
BOA [40]Energy efficiencyBehavior of butterfliesLow complexity, high efficiencyComplex implementation
ACO [40]Energy efficiencyForaging behavior of antsLow complexityHigh memory
PIO [41]Coverage optimizationPigeon homing behaviorBetter convergence, high efficiency2D, time consuming

2. Preliminary

2.1. Manta Ray Foraging Optimization

The Manta Ray Foraging Optimization (MRFO) algorithm is a new population-based swarm intelligence optimization algorithm used to simulate animal foraging behaviors and characteristics. The main inspiration of this algorithm is the special and manifold foraging behavior of manta rays. In order to distinguish their different behaviors, they are described as chain foraging, spiral foraging and flipping foraging. In particular, if the physical space of the manta ray motion corresponds to the search space of the MRFO algorithm, the position x i d ( t ) of the manta ray is the solution in the searching region, and the place x b e s t d ( t ) of the optimal food source is the optimal solution in the search region.
During the cyclone foraging stage, the manta ray swims forward spirally. According to the value of the convergence factor (C) (the ratio of the number of iterations to the maximum number of iterations), it is decided to choose the best position obtained at present, which is helpful for development or to choose the reference random position, which is helpful for exploration:
β = 2 e r 1 T M a x t + 1 T M a x sin ( 2 π r 1 )
x i d ( t + 1 ) = { x b e s t d + r [ x b e s t d ( t ) x i d ( t ) ] + β [ x b e s t d ( t ) x i d ( t ) ]     i = 1 x b e s t d + r [ x i 1 d ( t ) x i d ( t ) ] + β [ x b e s t d ( t ) x i d ( t ) ]     i = 2 , , N
where β is the weight coefficient, T M a x is the maximum number of iterations and r 1 is a random number in [0, 1]:
x rand d = r ( U p d L o w d ) + L o w d
x i d ( t + 1 ) = { x r a n d d + r [ x r a n d d ( t ) x i d ( t ) ] + β [ x r a n d d ( t ) x i d ( t ) ]     i = 1 x r a n d d + r [ x i 1 d ( t ) x i d ( t ) ] + β [ x r a n d d ( t ) x i d ( t ) ]     i = 2 , , N
where x r a n d d denotes an arbitrary position in the searching region and U p d and L o w d are the upper and lower limits of the dth dimension, respectively.
In the chain foraging stage, the position of the manta ray individual is updated according to the previous individual position and the optimal food source position:
α = 2 r | log ( r ) |
x i d ( t + 1 ) = { x i d + r [ x b e s t d ( t ) x i d ( t ) ] + α [ x b e s t d ( t ) x i d ( t ) ]       i = 1 x i d + r [ x i 1 d ( t ) x i d ( t ) ] + α [ x b e s t d ( t ) x i d ( t ) ]       i = 2 , , N
where x i d ( t ) presents the position of the ith individual at time t in the dth dimension, r is a random vector within [0, 1] and a is a weight coefficient. The position update of the ith individual is determined by the position x i 1 d ( t ) of the (i − 1)th current individual and the position x b e s t ( t ) of the food.
In somersault foraging, the new positions can be represented as
x i d ( t + 1 ) = x i d ( t ) + S r ( x b e s t d ( t ) x i d ( t ) ) ,   i = 1 , , N
where S = 2 and S is the somersault factor, which determines the search range of each flip.

2.2. Cuckoo Search Algorithm

The main inspiration for the Cuckoo Search (CS) algorithm comes from the interesting parasitic brooding behavior of cuckoos. In order to describe the Cuckoo Search algorithm, the following three idealized rules are used: First, each cuckoo lays an egg in a nest at a time, and the nest is randomly selected. Second, the nest with high-quality eggs is retained as a continuous generation; that is, the optimal solution is retained. Third, it is assumed that the existing host nest is invariable, and the host discovers the eggs laid by the cuckoo with a probability of 0 ≤ P ≤ 1 and then throws away the eggs or discards the existing nest.
The parasitic nest of cuckoo eggs represents the solution of the search space, and the location of the parasitic nest represents the fitness value of the solution. In the optimization process of CS, parameter P affects the transition between local development and global search. The nest location update mechanism conforms to the Levy flight, and the equation is updated as follows:
x i t + 1 = x i t + α L e v y ( λ )
where x i t represents the position of the ith bird nest in the kth generation nest, represents point-to-point multiplication, a represents the step length control quantity and L e v y ( λ ) is a random search path.

3. The Proposed Method

In MRFO, the transition of the different foraging modes of manta rays is only determined by the comparison of random numbers. The imbalance between exploration and exploitation greatly affects the performance of the algorithm. In order to enhance the performance of MRFO, this paper improves it from two aspects: First, the dynamic disturbance factor strategy is introduced to balance exploration and development to ensure accuracy, and the AMRFO algorithm is proposed. Secondly, the CS algorithm is mixed on the basis of AMRFO, and the exploration ability of CS is used to enhance the global convergence ability of the algorithm and to avoid low efficiency and the local optimum.

3.1. Dynamic Perturbation Factor Strategy

In the original MRFO algorithm, the excess of the exploitation and exploration of cyclone foraging is determined by the comparison between the random number (rand) and the convergence factor (C) (the ratio of the number of iterations to the maximum number of iterations). When the random number is less than the convergence factor, the manta ray carries out the global search and expands the exploration range. When the random number is greater than the convergence factor, the manta ray performs a local search to improve the efficiency of the local search. However, the disadvantage is that the early and late decline in the convergence factor is the same, resulting in the inability to perform a local search better in the early stage and the inability to perform a partial search more effectively in the later step, which will lead to disadvantages in handling actual optimization problems. In most cases, it cannot be guaranteed that the global optimal solution can be obtained at the end of the convergence; there will be premature convergence, and the model will fall into a local optimum later. The convergence factor is generally improved from linear to nonlinear so that the previous convergence factor can be smoothly decreased and the global exploration capability can be augmented. The steep decline at the later stage enhances its local mining capacity. In this paper, a new dynamic factor strategy will be introduced to improve its accuracy. The perturbation factor P is shown in Equation (9), and the updated parameter M is shown in Equation (10):
P = r a n d n ( sin ω ( π 2 t t max ) + cos ( π 2 t t max ) 1 )
M = a ( 2 × r a n d 1 ) + P
where randn represents a random number that obeys a Gaussian normal distribution; ω represents a constant that determines the peak position of the perturbation factor; and M is a part of the position update, which balances the global search and local exploitation in cyclone foraging. Figure 1 shows that M changes with the increase in the number of iterations. It can be embraced from the comparison in the figure that when ω = 3 , the amplitude of the disturbance factor is large and stable, and it is also verified in subsequent experiments that it can improve the performance of the algorithm.

3.2. Hybrid CS with AMRFO

All population-based metaheuristic algorithms such as MRFO and CS essentially solve optimization problems by maintaining a compromise between development and exploration. In MRFO, chain foraging and flip-bucket foraging update the position of the search agent around the optimal position, focusing on the development performance of the algorithm. However, the special features of spiral foraging are used to improve global exploration. CS has a special flight strategy that cannot easily fall into the local optimum and has a strong global search ability. CS is embedded into AMRFO to further optimize the algorithm’s performance, prevent the model from falling into the local optimum and improve the convergence rate and preciseness.

3.3. The Proposed AMRFOCS

To express the proposed algorithm more clearly, Algorithm 1 gives the pseudo code of the proposed AMRFOCS, and Figure 2 is the workflow chart of the proposed AMRFOCS algorithm.
Algorithm 1: AMRFOCS
1. Input: The number of generations (T), size of the population (N), and the upper and lower bounds Up and Low.
2. Output: Optimal solution xbest.
3. Initialize the population and parameters α , β , S , P , M , ω
4. Compute the fitness of every initialized agent and sort all agents according to their fitness values.
5. while t < T do:
6.  if rand < 0.5 then
7.    if |M| < 1 then
8.      Update x i based on Equation (4).
9.    else if then
10.      Update x i on the usage of Equation (9).
11.    end if
12.  else if then
13.     Update x i on the usage of Equation (6)
14.  end if
15.  for i = 1:N do
16.     Update x i based on Equation (7).
17.     if f ( x i ( t + 1 ) )   <   f ( x best ) then
18.        x b e s t = x i ( t + 1 )
19.     end if
20.   end for
21.   Sort the new population according to fitness.
22.    t   =   t + 1
23. end while
24. return

3.4. The Computational Complexity of AMRFOCS

One of the main metrics of the optimization algorithm is the execution time. The modifications of AMRFOCS include the dynamic perturbation factor and the hybridizing of CS. When the population size, the dimension of the optimization problem and the maximum number of iterations are set to N, D and T, respectively, the complexity of AMRFOCS can be calculated in the following ways: The complexity of the initialization phase is O ( N × D ) , the complexity of the dynamic disturbance factor is O ( N ) and the complexity of the algorithm update solution is O ( N × D ) . When performing T iterations, the total time complexity of AMRFOCS is O ( N × D + T × ( N + N × D + N × D + N × D ) ) = O ( N × ( D + T + 3 × T × D ) ) , which is higher than the O ( T × N × D ) of the original MRFO.

4. Experimental Results and Discussion

In this section, in order to evaluate the performance of the proposed AMRFOCS and verify its effectiveness, two highly respected function families are used: thirty CEC 2017 and ten CEC 2020 benchmark functions. The improved AMRFOCS is compared with other well-known optimization algorithms in multiple dimensions. Information about the benchmark function is shown in Table 2 and Table 3. The environmental conditions of all the simulation experiments involve Intel® Core™ i7-9700 CPU @ 3.00 GHz, 16 GB RAM, the Windows 10 operating system and the MATLAB 2021b platform.

4.1. Comparison of AMRFOCS with Other Algorithms on CEC2017

4.1.1. Analysis and Discussion of Results

In this section, AMRFOCS is compared with eight other metaheuristic algorithms, including ACO [42], ABC [43], SMA [44], PSO [45], GA, DE [46], WOA [46] and MRFO [18]. In order to ensure the fairness and rigor of the experiment, parameters are set in each selected algorithm, as shown in Table 4. Except for the parameters in Table 4, the other parameters are consistent. Each algorithm was run independently 30 times with dimensions of 30 and 50 and a population size of 50 and 30, and the maximum number of iterations was set to 500. The results of 30 independent runs are listed in Table 5 and Table 6.
Table 5 and Table 6 show four indicators, namely the mean value (mean), standard deviation (std), minimum value (min) and maximum value (max), as well as the sort value of the algorithm. In addition, at the 5% significance level, the Wilcoxon rank-sum test [47] is used to affirm whether AMRFOCS has a significant contribution to other algorithms. “-” represents ‘‘not applicable’’, which means that the best algorithm cannot be statistically compared with itself in the rank-sum test [39]. Table 5 and Table 6 give the algorithm’s ranking in different test functions and the p-value of the rank-sum test. The table’s bold data are the eight algorithms’ optimal minimum values (maximum values, mean values or standard deviation). Additionally, the last row of Table 5 and Table 6 lists three symbols (+/−/=) to show the number of functions whereby AMRFOCS has a superior (+) performance, the number of functions whereby AMRFOCS has the same behavior as other algorithms (=) and the number of functions whereby AMRFOCS is at a disadvantage.
Table 5 and Table 6 show that AMROCS provides topnotch results in most functions, especially when dealing with unimodal functions (F1, F3), multimodal (F5), mixed (F11, F12, F13, F16, F19, F20 and F17) and combined functions (F20, F21, F24 and F28–F30). Therefore, AMRFOCS has the smallest average rank ranking, with more than 32% of the features in these tests achieving an optimal performance. This experimental result confirms the effective exploration and utilization ability of the proposed AMRFOCS in exploring and accurately utilizing the optimal solution and avoiding many local optimums in high-dimensional combinatorial functions. The table also shows the p value of AMRFOCS and the other algorithms, which confirms the significant difference between the AMRFOCS proposed in this paper and other algorithms. Therefore, AMRFOCS is a faithful and steady-going algorithm.
Table 2. CEC2017 benchmark functions summary [48].
Table 2. CEC2017 benchmark functions summary [48].
TypeNo.FunctionsRange F min
Unimodal FunctionF1Shifted and Rotated Bent Cigar Function[−100, 100]100
F2Shifted and Rotated Sum of Different Power Function[−100, 100]200
F3Shifted and Rotated Zakharov Function[−100, 100]300
Simple
Multimodal
Functions
F4Shifted and Rotated Rosenbrock’s Function[−100, 100]400
F5Shifted and Rotated Rastrigin’s Function[−100, 100]500
F6Shifted and Rotated Expanded Scaffer’s F6 Function[−100, 100]600
F7Shifted and Rotated Lunacek Bi_Rastrigin Function[−100, 100]700
F8Shifted and Rotated Noncontinuous Rastrigin’s Function[−100, 100]800
F9Shifted and Rotated Levy Function[−100, 100]900
F10Shifted and Rotated Schwefel’s Function[−100, 100]1000
Hybrid FunctionsF11Hybrid Function 1 (N = 3)[−100, 100]1100
F12Hybrid Function 2 (N = 3)[−100, 100]1200
F13Hybrid Function 3 (N =3)[−100, 100]1300
F14Hybrid Function 4 (N = 4)[−100, 100]1400
F15Hybrid Function 5 (N = 4)[−100, 100]1500
F16Hybrid Function 6 (N = 4)[−100, 100]1600
F17Hybrid Function 6 (N =5)[−100, 100]1700
F18Hybrid Function 6 (N =5)[−100, 100]1800
F19Hybrid Function 6 (N =5)[−100, 100]1900
F20Hybrid Function 6 (N = 6)[−100, 100]2000
Composition FunctionsF21Composition Function 1 (N = 3)[−100, 100]2100
F22Composition Function 2 (N = 3)[−100, 100]2200
F23Composition Function 3 (N = 4)[−100, 100]2300
F24Composition Function 4 (N = 4)[−100, 100]2400
F25Composition Function 5 (N = 5)[−100, 100]2500
F26Composition Function 6 (N = 5)[−100, 100]2600
F27Composition Function 7 (N = 6)[−100, 100]2700
F28Composition Function 8 (N = 6)[−100, 100]2800
F29Composition Function 9 (N = 3)[−100, 100]2900
F30Composition Function 10 (N = 3)[−100, 100]3000
Table 3. The CEC2020 benchmark functions [49].
Table 3. The CEC2020 benchmark functions [49].
TypeNo.FunctionsRange F min
Unimodal FunctionF1Shifted and Rotated Bent Cigar Function (CEC 2017 F1)[−100, 100]100
Basic FunctionsF2Shifted and Rotated Schwefel’s Function (CEC 2014 F11)[−100, 100]1100
F3Shifted and Rotated Lunacek Bi_Rastrigin Function (CEC 2017 F7)[−100, 100]700
F4Expanded Rosenbrock’s plus Griewangk’s Function (CEC2017 F19)[−100, 100]1900
Hybrid FunctionsF5Hybrid Function 1 (N = 3) (CEC 2014 F17)[−100, 100]1700
F6Hybrid Function 2 (N = 4) (CEC 2017 F16)[−100, 100]1600
F7Hybrid Function 3 (N = 5) (CEC 2014 F21)[−100, 100]2100
Composition FunctionsF8Composition Function 1 (N = 3) (CEC 2017 F22)[−100, 100]2200
F9Composition Function 2 (N = 4) (CEC 2017 F24)[−100, 100]2400
F10Composition Function 3 (N = 5) (CEC 2017 F25)[−100, 100]2500
Table 4. Parameter settings of different algorithms.
Table 4. Parameter settings of different algorithms.
AlgorithmParametersSetting Value
ABCa1
k[1, 10]
p[−1, 1]
ACOr0.9
P0.2
y[−5, 5]
s0.1
DEf0.5
c0.9
GAl20
g0.9
c1
s0
SMAz0.03
PSOa2.0
c2.0
WOAb1
MRFOS2
Table 5. Comparison of results obtained—CEC2017 benchmark functions (30D).
Table 5. Comparison of results obtained—CEC2017 benchmark functions (30D).
FunctionABC [43]ACO [42]DE [46]GASMA [44]PSO [45]WOA [46]MRFOAMRFOCS
F1Min1.0154 × 1089.7148 × 10104.1095 × 1064.8990 × 10101.5430 × 1031.2997 × 1075.9003 × 1081.4427 × 1023.1760 × 102
Max8.3189 × 1081.5513 × 10111.9979 × 1071.0217 × 10112.2200 × 1042.5143 × 1075.9382 × 1092.0702 × 1041.9893 × 104
Mean3.1937 × 1081.2948 × 10111.1488 × 1078.2198 × 10107.1400 × 1031.9757 × 1072.1909 × 1095.1159 × 1034.2103 × 103
Std1.7466 × 1081.3586 × 10104.4221 × 1061.2920 × 10105.7760 × 1032.6789 × 1061.2084 × 1096.2854 × 1034.4114 × 103
Rank694835721
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.4643 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F2Min1.3826 × 10393.0174 × 10423.7900 × 10202.6307 × 10393.9166 × 1086.9869 × 1051.8526 × 10245.0665 × 10316.2613 × 104
Max2.7949 × 10441.8218 × 10551.1983 × 10262.7913 × 10522.6824 × 10142.6965 × 10223.3101 × 10356.1316 × 10423.3447 × 1014
Mean1.1188 × 10436.7792 × 10537.1918 × 10241.2717 × 10511.7130 × 10138.9883 × 10202.1003 × 10342.9023 × 10412.5585 × 1013
Std5.0853 × 10433.3270 × 10542.2580 × 10255.1032 × 10514.9641 × 10134.9231 × 10217.2555 × 10341.1238 × 10427.2185 × 1013
Rank794823561
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.5137 × 10−25.4617 × 10−93.0199 × 10−113.0199 × 10−11-
F3Min9.3798 × 1041.6570 × 1056.7056 × 1041.5029 × 1052.5152 × 1039.7560 × 1031.2175 × 1053.2351 × 1033.7305 × 103
Max5.2367 × 1055.3531 × 10101.4788 × 1052.7782 × 1062.8997 × 1044.0783 × 1044.5221 × 1052.7003 × 1041.8743 × 104
Mean1.1306 × 1051.9316 × 1091.1091 × 1054.0455 × 1051.2249 × 1042.1596 × 1042.6893 × 1051.1526 × 1041.0662 × 104
Std1.0781 × 1049.7489 × 1091.9454 × 1045.1915 × 1056.1721 × 1037.2295 × 1036.3779 × 1046.3253 × 1033.6521 × 103
Rank695824731
p-value1.2118 × 10−121.2118 × 10−121.2118 × 10−121.2118 × 10−12NaN1.2118 × 10−121.2118 × 10−12NaN-
F4Min5.8946 × 1021.0314 × 1044.8507 × 1028.8614 × 1034.7389 × 1024.0953 × 1026.3226 × 1024.7040 × 1024.1566 × 102
Max8.2750 × 1026.5144 × 1045.6890 × 1024.5406 × 1045.2629 × 1025.3342 × 1021.3639 × 1035.2245 × 1025.2182 × 102
Mean7.1050 × 1024.2604 × 1045.3124 × 1022.5276 × 1044.9765 × 1025.0183 × 1029.3728 × 1024.9125 × 1024.9033 × 102
Std5.9761 × 1011.2617 × 1041.8107 × 1019.5705 × 1031.4174 × 1012.3918 × 1011.8251 × 1021.8396 × 1012.4232 × 101
Rank695834721
p-value3.0199 × 10−113.0199 × 10−116.7220 × 10−103.0199 × 10−113.0317 × 10−21.3345 × 10−13.0199 × 10−113.0199 × 10−11-
F5Min7.1654 × 1029.5422 × 1026.9318 × 1029.3910 × 1025.8094 × 1026.2262 × 1027.5584 × 1026.0248 × 1025.9751 × 102
Max7.8028 × 1021.2844 × 1037.5963 × 1021.1767 × 1037.5104 × 1027.7320 × 1021.0409 × 1037.7262 × 1027.5371 × 102
Mean7.5297 × 1021.1637 × 1037.2788 × 1021.0489 × 1036.2679 × 1026.9384 × 1028.4935 × 1026.9020 × 1026.6148 × 102
Std1.5245 × 1017.3984 × 1011.2938 × 1016.2624 × 1013.1612 × 1013.4506 × 1016.8712 × 1014.6749 × 1014.3148 × 101
Rank693815742
p-value3.3386 × 10−33.0199 × 10−117.9782 × 10−23.0199 × 10−111.6980 × 10−87.6183 × 10−17.0881 × 10−84.0772 × 10−11-
F6Min6.0000 × 1026.9858 × 1026.0322 × 1026.8868 × 1026.0060 × 1026.4167 × 1026.5717 × 1026.0133 × 1026.0349 × 102
Max6.2288 × 1027.6250 × 1026.1152 × 1027.4279 × 1026.1350 × 1026.6457 × 1026.9289 × 1026.5316 × 1026.5961 × 102
Mean6.0000 × 1026.2900 × 1016.0631 × 1027.1490 × 1026.0340 × 1026.5720 × 1026.7537 × 1026.2528 × 1026.2502 × 102
Std2.7437 × 10001.2400 × 1011.8413 × 1001.2006 × 1012.4610 × 1005.6088 × 1009.1749 × 1001.2338 × 1011.4127 × 101
Rank173925846
p-value6.3560 × 10−53.0199 × 10−111.3289 × 10−103.0199 × 10−114.4440 × 10−77.3803 × 10−105.4941 × 10−119.9186 × 10−11-
F7Min9.6084 × 1023.1096 × 1039.3278 × 1022.2940 × 1038.0722 × 1029.3742 × 1021.1594 × 1038.5152 × 1028.5189 × 102
Max1.0117 × 1033.8617 × 1039.9053 × 1023.4478 × 1039.7487 × 1021.1843 × 1031.4545 × 1031.2944 × 1031.2630 × 103
Mean9.9282 × 1024.2000 × 1019.6627 × 1022.8176 × 1038.6422 × 1021.1061 × 1031.2986 × 1031.0147 × 1031.0224 × 103
Std1.2683 × 1011.2200 × 1011.2768 × 1012.9262 × 1023.9480 × 1015.0331 × 1016.7914 × 1011.2166 × 1021.1825 × 102
Rank342915867
p-value8.5338 × 10−13.0199 × 10−114.5146 × 10−23.0199 × 10−112.4386 × 10−92.6015 × 10−84.9752 × 10−113.0199 × 10−11-
F8Min8.7478 × 1021.2947 × 1031.0047 × 1031.1921 × 1038.6985 × 1029.0755 × 1029.3940 × 1008.7562 × 10028.8855 × 102
Max1.0846 × 1031.4828 × 1031.0568 × 1031.3960 × 1039.7051 × 1021.0308 × 1031.1676 × 1031.0159 × 1031.0030 × 103
Mean8.9952 × 1025.2300 × 1011.0304 × 1031.2837 × 1039.1685 × 1029.5942 × 1021.0438 × 1039.4463 × 1029.3939 × 102
Std6.9538 × 1001.0200 × 1011.2740 × 1015.3439 × 1013.1005 × 1013.4689 × 1014.8060 × 1013.3363 × 1012.8957 × 101
Rank256917843
p-value3.0199 × 10−113.0199 × 10−114.5043 × 10−113.0199 × 10−112.0023 × 10−68.8830 × 10−13.8202 × 10−103.0199 × 10−11-
F9Min7.0032 × 1031.9054 × 1042.0538 × 1031.4697 × 1041.9214 × 1035.1607 × 1036.7932 × 1036.3749 × 1031.9424 × 103
Max1.6985 × 1044.7601 × 1044.5199 × 1033.0143 × 1041.0980 × 1049.6916 × 1033.2571 × 1041.2225 × 1048.5475 × 103
Mean1.1643 × 1043.7500 × 1042.7952 × 1032.4068 × 1045.2442 × 1037.6564 × 1031.3059 × 1049.7479 × 1035.1747 × 103
Std2.3773 × 1035.9949 × 1036.0699 × 1024.0708 × 1032.2777 × 1031.1944 × 1035.8199 × 1031.3856 × 1031.6948 × 103
Rank691834752
p-value3.6897 × 10−113.0199 × 10−114.1178 × 10−63.0199 × 10−116.5204 × 10−16.0459 × 10−74.1997 × 10−101.4643 × 10−10-
F10Min8.4132 × 1039.7867 × 1037.7355 × 1038.1999 × 1033.0770 × 1034.6398 × 1035.0641 ×1033.6012 × 1032.5686 × 103
Max9.8864 × 1031.1866 × 1049.3152 × 1031.0092 × 1046.3150 × 1037.0070 × 1038.6416 × 1037.2093 × 1037.7606 × 103
Mean9.2739 × 1031.0854 × 1048.7408 × 1039.4494 × 1034.6711 × 1035.7831 × 1036.9687 × 1034.7415 × 1035.1107 × 103
Std2.8525 × 1023.4400 × 1033.7295 × 1024.5335 × 1027.2820 × 1026.1827 × 1029.2541 × 1027.1060 × 1029.3500 × 102
Rank795813624
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−119.2344 × 10−18.1465 × 10−51.0702 × 10−91.6132 × 10−10-
F11Min5.5276 × 1031.3745 × 1041.1986 × 1037.5074 × 1031.1490 × 1031.2088 × 1032.6028 × 1031.1349 × 1031.1368 × 103
Max1.6185 × 1042.8377 × 1051.2875 × 1035.8373 × 1041.3760 × 1031.3374 × 1031.3561 × 1041.3641 × 1031.2840 × 103
Mean1.0463 × 1046.3637 × 1041.2488 × 1032.8766 × 1041.2660 × 1031.2665 × 1037.0216 × 1031.2207 × 1031.2037 × 103
Std2.6622 × 1035.2876 × 1042.1263 × 1011.2367 × 1045.2560 × 1012.9995 × 1012.9811 × 1035.8135 × 1014.4210 × 101
Rank792854631
p-value3.0199 × 10−113.0199 × 10−112.0681 × 10−23.0199 × 10−112.2658 × 10−33.0059 × 10−43.0199 × 10−113.0199 × 10−11
F12Min2.2161 × 1081.4479 × 10101.2600 × 1065.2363 × 1094.8730 × 1052.1766 × 1063.3151 × 1072.8406 × 1047.3759 × 104
Max9.3358 × 1083.9797 × 10101.0749 × 1072.6238 × 10108.5280 × 1064.2295 × 1078.9433 × 1082.3103 × 1061.5100 × 106
Mean4.5281 × 1082.6199 × 10104.3229 × 1061.5373 × 10102.9180 × 1061.6871 × 1072.8065 × 1084.6619 × 1053.5144 × 105
Std1.5863 × 1086.5010 × 1092.4314 × 1065.1740 × 1091.9490 × 1061.0816 × 1072.2948 × 1085.0090 × 1053.1390 × 105
Rank794835621
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.5727 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F13Min1.1452 × 1049.2894 × 1094.2655 × 1034.2862 × 1099.4720 × 1033.6456 × 1054.6561 × 1051.3532 × 1031.5607 × 103
Max2.6848 × 1074.8535 × 10102.2415 × 1042.8201 × 10107.1220 × 1044.7730 × 1068.7062 × 1065.9713 × 1046.2857 × 104
Mean1.7766 × 1042.2200 × 1039.2416 × 1031.3551 × 10103.5200 × 1041.0753 × 1062.9308 × 1061.6871 × 1041.9422 × 104
Std7.5745 × 1031.2200 × 1023.7397 × 1035.5841 × 1092.5470 × 1047.7927 × 1052.3216 × 1061.5084 × 1041.8341 × 104
Rank451967823
p-value3.0199 × 10−113.0199 × 10−115.1060 × 10−13.0199 × 10−117.6588 × 10−53.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F14Min9.6728 × 1045.2670 × 1061.4663 × 1031.7641 × 1069.4450 × 1034.9433 × 1034.7043 × 1042.9000 × 1032.8036 × 103
Max1.0616 × 1061.8985 × 1081.5120 × 1031.2344 × 1081.9580 × 1052.0460 × 1051.3090 × 1075.4617 × 1044.0539 × 104
Mean2.0324 × 1057.3300 × 1011.4927 × 1032.5264 × 1071.0290 × 1054.4592 × 1043.3724 × 1061.6243 × 1041.1884 × 104
Std5.5827 × 1047.3300 × 1029.1438 × 1002.5037 × 1075.2110 × 1044.6969 × 1042.9973 × 1061.4535 × 1049.1818 × 103
Rank751964832
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−117.7725 × 10−91.6813 × 10−43.0199 × 10−116.6955 × 10−11-
F15Min2.0459 × 1031.8897 × 1091.5964 × 1031.9734 × 1081.9910 × 1035.8591 × 1048.3870 × 1041.5717 × 1031.5505 × 103
Max5.5536 × 1061.3480 × 10101.7114 × 1036.2995 ×1094.3310 × 1043.3304 × 1052.2859 × 1074.0793 × 1044.2819 × 104
Mean8.8916 × 1035.2400 × 1031.6582 × 1032.6018 × 1092.4960 × 10 41.5894 × 1052.1739 × 1068.7091 × 1031.1109 × 104
Std3.1246 × 1037.7000 × 1022.5041 × 1011.3775 × 1091.4300 × 1046.5396 × 1044.2818 × 1069.2998 × 1031.2935 × 104
Rank461957823
p-value3.0199 × 10−113.0199 × 10−116.5183 × 10−93.0199 × 10−111.7836 × 10−43.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F16Min2.0452 × 1035.8741 × 1033.1551 × 1034.8248 × 1031.7720 × 1032.7007 × 1032.4831 × 1032.1619 × 1031.9438 × 103
Max4.3828 × 1031.3395 × 1043.8340 × 1031.1386 × 1043.2970 × 1033.5684 × 1036.7716 × 1033.2044 × 1033.2119 × 103
Mean4.0016 × 1035.5600 × 1033.5677 × 1036.7991 × 1032.5070 × 1033.1605 × 1034.2004 × 1032.6004 × 1032.4746 × 103
Std2.2691 × 1022.2000 × 1021.8219 × 1021.3622 × 1033.3580 × 1022.4959 × 1028.2898 × 1023.1577 × 1022.7366 × 102
Rank485926731
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−119.7052 × 10−011.2023 × 10−088.9934 × 10−113.0199 × 10−11-
F17Min1.8441 × 1034.6659 × 1032.1103 × 1033.3244 × 1031.8040 × 1032.0717 × 1032.2412 × 1031.7956 × 1031.7925 × 103
Max3.1530 × 1033.4404 × 1052.6988 × 1033.2925 × 1042.7230 × 1033.3136 × 1033.2823 × 1032.6236 × 1032.5946 × 103
Mean2.9495 × 1034.7341 × 1042.4235 × 1031.0638 × 1042.2450 × 1032.5941 × 1032.7821 × 1032.1502 × 1032.1664 × 103
Std1.6006 × 1022.6600 × 1031.4637 × 1027.7982 × 1032.1920 × 1022.7539 × 1022.7887 × 1022.0232 × 1021.8561 × 102
Rank593846721
p-value4.5043 × 10−113.0199 × 10−111.1077 × 10−063.0199 × 10−112.4157 × 10−27.6588 × 10−51.5581 × 10−82.3897 × 10−8-
F18Min1.3677 × 1054.1987 × 1074.7817 × 1031.4347 × 1071.2430 × 1059.9131 × 1043.1313 × 1054.1933 × 1044.6072 × 104
Max3.8236 × 1071.5215 × 1094.6879 × 1045.1200 × 1084.2940 × 1063.3343 × 1066.0586 × 1071.3249 × 1061.8493 × 106
Mean3.0928 × 1051.6000 × 1031.8993 × 1041.2777 × 1081.4650 × 1066.1749 × 1058.8647 × 1062.7455 × 1052.8187 × 105
Std9.6714 × 1045.7300 × 1021.0976 × 1041.2244 × 1081.2390 × 1066.5543 × 1051.3895 × 1072.6898 × 1053.7817 × 105
Rank451976823
p-value3.0199 × 10−113.0199 × 10−114.5043 × 10−113.0199 × 10−111.0105 × 10−81.5014 × 10−21.6132 × 10−108.1014 × 10−10-
F19Min3.3711 × 1032.4416 × 1091.9460 × 1031.3628 × 1097.1370 × 1031.4973 × 1054.2547 × 1041.9200 × 1031.9943 × 103
Max4.6006 × 1052.3046 × 10101.9999 × 1036.0346 × 1095.6570 × 1042.1529 × 1063.1903 × 1075.6153 × 1044.9774 × 104
Mean8.5326 × 1033.3200 × 1021.9642 × 1032.9205 × 1093.8150 × 1048.7076 × 1051.1132 × 1071.1733 × 1041.0513 × 104
Std5.0755 × 1031.2200 × 1031.1177 × 1011.1896 × 1091.9450 × 1045.4963 × 1057.9663 × 1061.4443 × 1041.1281 × 104
Rank451967832
p-value1.6132 × 10−103.0199 × 10−115.5727 × 10−103.0199 × 10−118.6844 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F20Min2.1506 × 1033.4140 × 1032.6418 × 1032.9675 × 1032.2980 × 1032.3455 × 1032.5271 × 1032.1960 × 1032.1806 × 103
Max3.3109 × 1034.3081 × 1033.0783 × 1033.6499 × 1032.7500 × 1033.1023 × 1033.3016 × 1032.8994 × 1032.9051 × 103
Mean2.2816 × 1033.2200 × 1032.8286 × 1033.3611 × 1032.5160 × 1032.7642 × 1032.9118 × 1032.4544 × 1032.5069 × 103
Std4.5941 × 1014.2300 × 1021.1178 × 1021.5474 × 1021.4400 × 1022.0481 × 1022.3447 × 1021.8973 × 1021.9487 × 102
Rank195826734
p-value4.9752 × 10−113.0199 × 10−117.3803 × 10−103.0199 × 10−111.3272 × 10−22.6784 × 10−61.3289 × 10−101.2023 × 10−8-
F21Min2.4998 × 1032.7335 × 1032.4938 × 1032.6432 × 1032.3610 × 1032.4422 × 1032.5117 × 1032.3667 × 1032.3609 × 103
Max2.5791 × 1033.0507 × 1032.5555 × 1032.8797 × 1032.4870 × 1032.6160 × 1032.7173 × 1032.5234 × 1032.5046 × 103
Mean2.3037 × 1032.9379 × 1032.5278 × 1032.7886 × 1032.4090 × 1032.5320 × 1032.6246 × 1032.4281 × 1032.4234 × 103
Std7.5583 × 1017.9959 × 1011.4103 × 1015.9467 × 1012.4530 × 1014.4806 × 1016.3342 × 1014.2821 × 1012.9822 × 101
Rank594816732
p-value4.5043 × 10−113.0199 × 10−112.3715 × 10−103.0199 × 10−116.7350 × 10−12.0338 × 10−94.0772 × 10−113.0199 × 10−11-
F22Min2.3000 × 1031.0306 × 1042.3168 × 1037.9256 × 1032.3010 × 1032.3236 × 1032.8013 × 1032.3000 × 1032.3000 × 103
Max1.0900 × 1041.3120 × 1042.3262 × 1031.2211 × 1047.7140 × 1038.5579 × 1031.0547 × 1047.7688 × 1036.4637 × 103
Mean2.3128 × 1034.3300 × 1022.3211 × 1031.0590 × 1045.7980 × 1035.9502 × 1038.1343 × 1033.1031 × 1032.4397 × 103
Std3.5097 × 1002.3300 × 1032.1808 × 1008.8398 × 1021.1790 × 1032.1662 × 1031.6086 × 1031.8419 × 1037.6001 × 102
Rank381946752
p-value3.3384 × 10−113.0199 × 10−118.4848 × 10−93.0199 × 10−115.4617 × 10−96.7220 × 10−109.9186 × 10−111.9568 × 10−10-
F23Min2.8749 × 1033.3073 × 1032.8510 × 1033.2778 × 1032.7238 × 1033.0471 × 1032.9423 × 1032.6967 × 1032.7000 × 103
Max2.9480 × 1034.2982 × 1032.9063 × 1033.7566 × 1032.8054 × 1033.6307 × 1033.3612 × 1032.9593 × 1032.8401 × 103
Mean2.9172 × 1033.8783 × 1032.8843 × 1033.5453 × 1032.7566 × 1033.3266 × 1033.1063 × 1032.7818 × 1032.7615 × 103
Std1.8843 × 1012.3000 × 1031.4124 × 1011.3473 × 1021.9185 × 1011.5349 × 1021.0442 × 1024.5888 × 1013.6622 × 101
Rank593817642
p-value4.9752 × 10−113.0199 × 10−113.8202 × 10−103.0199 × 10−114.2039 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F24Min3.0675 × 1033.8413 × 1033.0087 × 1033.4658 × 1032.8850 × 1033.1984 × 1033.0610 × 1032.8646 × 1032.8767 × 103
Max3.1290 × 1034.8371 × 1033.0811 × 1034.4138 × 1033.0170 × 1033.6435 × 1033.4669 × 1033.0880 × 1032.9916 × 103
Mean3.0956 × 1034.3577 × 1033.0513 × 1033.7671 × 1032.9420 × 1033.3670 × 1033.2159 × 1032.9248 × 1032.9276 × 103
Std1.7187 × 1026.3300 × 1022.6623 × 1022.3032 × 1023.4050 × 1011.1382 × 1021.0195 × 1024.3333 × 1012.6834 × 101
Rank694837521
p-value3.0199 × 10−113.0199 × 10−116.6955 × 10−113.0199 × 10−113.9167 × 10−23.0199 × 10−113.3384 × 10−113.0199 × 10−11-
F25Min2.8837 × 1031.1399 × 1042.8914 × 1036.2271 × 1032.8840 × 1032.8864 × 1033.0208 × 1032.8836 × 1032.8836 × 103
Max3.0289 × 1032.5458 × 1042.9291 × 1031.5988 × 1042.9270 × 1032.9518 × 1033.2495 × 1032.9429 × 1032.9409 × 103
Mean2.9808 × 1031.8598 × 1042.9018 × 1031.1112 × 1042.8957 × 1032.9090 × 1033.1302 × 1032.8939 × 1032.8984 × 103
Std2.0681 × 1014.2200 × 1018.3757 × 1002.4224 × 1031.0550 × 1012.0669 × 1015.8141 × 1011.5232 × 1011.9458 × 101
Rank691845723
p-value3.0199 × 10−113.0199 × 10−113.8307 × 10−53.0199 × 10−115.6922 × 10−12.0023 × 10−63.0199 × 10−113.0199 × 10−11-
F26Min2.8361 × 1031.1704 × 1045.3538 × 1039.6453 × 1034.4010 × 1032.8905 × 1034.1644 × 1032.8000 × 1032.8000 × 103
Max6.1479 × 1032.2693 × 1046.0782 × 1031.5103 × 1045.2560 × 1031.0225 × 1041.0138 × 1047.8492 × 1037.7356 × 103
Mean2.9114 × 1033.4400 × 1015.8138 × 1031.2221 × 1044.7580 × 1037.3677 × 1038.1429 × 1035.1373 × 1035.1514 × 103
Std2.8268 × 1012.5500 × 1021.4751 × 1021.2602 × 1032.1090 × 1021.9198 × 1031.1711 × 1031.4116 × 1031.4729 × 103
Rank163928745
p-value4.6390 × 10−53.0199 × 10−119.7917 × 10−53.0199 × 10−116.7350 × 10−12.1959 × 10−76.0658 × 10−113.0199 × 10−11-
F27Min3.2035 × 1034.3757 × 1033.2797 × 1033.9060 × 1033.1960 × 1033.3824 × 1033.3121 × 1033.2117 × 1033.2042 × 103
Max3.2000 × 1036.4912 × 1033.3598 × 1035.1682 × 1033.2650 × 1034.4337 × 1033.8718 × 1033.3703 × 1033.3554 × 103
Mean3.2068 × 1036.3300 × 1023.3131 × 1034.4317 × 1033.2250 × 1033.7969 × 1033.4806 × 1033.2394 × 1033.2369 × 103
Std4.7499 × 1008.2200 × 1012.3424 × 1013.0325 × 1021.7090 × 1012.7048 × 1021.3175 × 1023.0071 × 1012.8526 × 101
Rank164928753
p-value3.0199 × 10−113.0199 × 10−113.6897 × 10−113.0199 × 10−116.6273 × 10−13.0199 × 10−113.6897 × 10−113.0199 × 10−11-
F28Min3.1485 × 1039.7515 × 1033.2360 × 1037.3217 × 1033.2010 × 1033.2096 × 1033.4433 × 1033.1774 × 1033.1475 × 103
Max3.3000 × 1031.7571 × 1043.3029 × 1031.2710 × 1043.3490 × 1033.2792 × 1034.0095 × 1033.2612 × 1033.2628 × 103
Mean3.2013 × 1038.3300 × 1023.2658 × 1039.5271 × 1033.2520 × 1033.2426 × 1033.6372 × 1033.2101 × 1033.2066 × 103
Std1.0859 × 1013.2200 × 1031.9187 × 1011.3320 × 1033.5840 × 1012.3085 × 1011.2677 × 1021.9640 × 1012.2023 × 101
Rank175964832
p-value3.0199 × 10−113.0199 × 10−119.2603 × 10−93.0199 × 10−111.7479 × 10−57.1988 × 10−53.0199 × 10−113.0199 × 10−11-
F29Min4.4928 × 1036.6630 × 1034.1331 × 1036.5491 × 1033.5400 × 1033.9504 × 1034.4103 × 1033.3856 × 1033.5042 × 103
Max5.3740 × 1031.2556 × 1054.8043 × 1032.5381 × 1044.2920 × 1035.2354 × 1036.4875 × 1034.1276 × 1034.1586 × 103
Mean4.9700 × 1037.3300 × 1034.4994 × 1031.2062 × 1043.9020 × 1034.5567 × 1035.3922 × 1033.8356 × 1033.8396 × 103
Std2.4081 × 1023.4400 × 1021.6904 × 1024.8332 × 1031.7880 × 1023.1462 × 1025.5518 × 1022.0514 × 1021.7926 × 102
Rank684935712
p-value3.0199 × 10−113.0199 × 10−114.0772 × 10−113.0199 × 10−113.2651 × 10−22.8716 × 10−103.0199 × 10−113.0199 × 10−11-
F30Min1.2719 × 1049.3579 × 1083.5700 × 1047.2064 × 1088.8130 × 1035.0064 × 1052.9098 × 1065.3023 × 1035.6202 × 103
Max1.3080 × 1066.4592 × 1093.0691 × 1055.4165 × 1096.0320 × 1041.0031 × 1072.0458 × 1081.9861 × 1041.6952 × 104
Mean2.1358 × 1043.3295 × 1091.0250 × 1052.4729 × 1092.4640 × 1044.3834 × 1065.3564 × 1071.0142 × 1049.4990 × 103
Std5.9215 × 1031.4214 × 1096.2618 × 1041.1582 × 1091.0280 × 1042.3051 × 1065.4071 × 1073.9579 × 1033.0359 × 103
Rank 4 95836721
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.1589 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−11-
+/=/−29/0/130/0/028/0/230/0/021/0/927/0/330/0/029/0/1-
Table 6. Comparison of results obtained—CEC2017 benchmark functions (50D).
Table 6. Comparison of results obtained—CEC2017 benchmark functions (50D).
FunctionABC [43]ACODEGASMA [50]PSO [50]WOAMRFO [50]AMRFOCS
F1Min2.1737 × 10102.2302 × 10113.7780 × 1081.7644 × 10112.8025 × 1064.4042 × 1071.2604 × 10107.2939 × 1043.6432 × 104
Max5.3757 × 10103.1622 × 10112.2735 × 1092.5294 × 10111.2339 × 1072.1058 × 1092.8191 × 10107.0300 × 1063.1240 × 106
Mean3.6270 × 10102.6670 × 10118.8973 × 1082.1598 × 10116.2106 × 1065.6369 × 1082.1789 × 10104.8755 × 1053.9104 × 105
Std8.0415 × 1092.0681 × 10105.0840 × 1082.4075 × 10102.2142 × 1066.5264 × 1084.5794 × 1091.2467 × 1066.9240 × 105
Rank795834621
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.6897 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F2Min1.5809 × 10758.2101 × 10824.0980 × 10431.1236 × 10801.5879 × 10252.8225 × 10201.5711 × 10641.2697 × 10643.1012 × 1025
Max3.4176 × 10835.5082 × 10961.1547 × 10568.4006 × 10922.2968 × 10382.6945 × 10522.3354 × 10841.0921 × 10834.2615 × 1040
Mean2.5029 × 10821.8541 × 10954.7927 × 10545.3503 × 10918.8177 × 10368.9816 × 10507.7881 × 10823.6479 × 10811.4390 × 1039
Std7.2547 × 10821.0053 × 10962.1507 × 10552.0042 × 10924.2031 × 10374.9194 × 10514.2638 × 10831.9937 × 10827.7774 × 1039
Rank794813652
p-value3.0199 × 10−113.0199 × 10−114.0772 × 10−113.0199 × 10−118.1875 × 10−18.3520 × 10−83.0199 × 10−113.0199 × 10−11-
F3Min1.8730 × 1055.1261 × 1051.7665 × 1053.0514 × 1057.7718 × 1049.2693 × 1041.9486 × 1051.0899 × 1059.0521 × 104
Max1.8842 × 1063.9258 × 10123.2630 × 1057.5046 × 1083.5256 × 1052.2562 × 1055.7027 × 1052.6159 × 1052.2619 × 105
Mean2.2788 × 1053.6318 × 10112.6879 × 1053.4493 × 1073.0052 × 1021.1823 × 1043.3277 × 1053.0061 × 1021.6057 × 105
Std1.8593 × 1049.4573 × 10113.8977 × 1041.3871 × 1083.3306 × 10−13.6550 × 1031.0007 × 1051.4242 × 1003.1640 × 104
Rank695812734
p-value3.0199 × 10−113.0199 × 10−113.6897 × 10−113.0199 × 10−113.0317 × 10−28.0727 × 10−18.1527 × 10−112.8314 × 10−8-
F4Min4.2924 × 1026.7079 × 1046.7833 × 1025.4906 × 1045.2565 × 1024.8158 × 1022.8058 × 1034.4762 × 1024.3289 × 102
Max3.1194 × 1041.4920 × 1059.2950 × 1021.1222 × 1057.5166 × 1027.4709 × 1027.8817 × 1038.1191 × 1027.2753 × 102
Mean4.5806 × 1021.1460 × 1057.8814 × 1028.2777 × 1045.4940 × 1026.9121 × 1024.8658 × 1034.6152 × 1025.7350 × 102
Std1.5587 × 1012.1693 × 1046.4800 × 1011.8160 × 1045.3517 × 1017.7460 × 1011.2178 × 1034.5205 × 1015.3578 × 101
Rank196845723
p-value3.0199 × 10−113.0199 × 10−113.6897 × 10−113.0199 × 10−114.2067 × 10−022.8913 × 10−033.0199 × 10−113.0199 × 10−11-
F5Min6.7622 × 1021.4434 × 1039.1209 × 1021.3227 × 1036.6596 × 1027.8626 × 1021.0008 × 1037.1991 × 1027.4477 × 102
Max1.2094 × 1031.8792 × 1031.0089 × 1031.7771 × 1038.8866 × 1029.5048 × 1021.3249 × 1039.3479 × 1029.1489 × 102
Mean7.1659 × 1021.6872 × 1039.4975 × 1021.5792 × 1037.0992 × 1026.3764 × 1021.1352 × 1038.2425 × 1028.3384 × 102
Std3.0539 × 1011.1129 × 1022.4416 × 1011.0960 × 1024.3070 × 1012.9924 × 1018.3373 × 1013.9911 × 1013.6296 × 101
Rank396812745
p-value3.0199 × 10−113.0199 × 10−113.3384 × 10−113.0199 × 10−118.3146 × 10−34.1191 × 10−13.0199 × 10−113.0199 × 10−11-
F6Min6.0000 × 1027.3948 × 1026.0963 × 1027.1424 × 1026.1911 × 1026.5547 × 1026.8136 × 1026.2359 × 1026.2709 × 102
Max7.0165 × 1027.7541 × 1026.2515 × 1027.6016 × 1026.6413 × 1026.8208 × 1027.3238 × 1026.7067 × 1026.6725 × 102
Mean6.0000 × 1027.5660 × 1026.1498 × 1027.4094 × 1026.0575 × 1026.4765 × 1027.0095 × 1026.0121 × 1026.4814 × 102
Std3.8755 ×10−138.8646 × 1003.8880 × 1001.0274 × 1012.2689 × 1001.1227 × 1011.2176 × 1017.6182 ×10−11.0358 × 101
Rank192736845
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.1060 × 10−019.9186 × 10−113.0199 × 10−113.0199 × 10−11-
F7Min9.2657 × 1024.3362 × 1031.1683 × 1034.7100 × 1031.0340 × 1031.6035 × 1031.7225 × 1031.2525 × 1031.1067 × 103
Max2.0399 × 1037.0315 × 1031.2890 × 1035.9726 × 1031.3204 × 1031.9375 × 1032.0341 × 1031.8252 × 1031.7588 × 103
Mean9.3679 × 1026.0513 × 1031.2322 × 1035.4172 × 1039.8578 × 1029.4995 × 1021.8734 × 1031.4977 × 1031.4712 × 103
Std1.3669 × 1015.0609 × 1023.0198 × 1013.6143 × 1024.6819 × 1014.9071 × 1017.8377 × 1011.3581 × 1021.5023 × 102
Rank193824765
p-value1.8731 × 10−73.0199 × 10−111.3111 × 10−83.0199 × 10−115.5727 × 10−101.6351 × 10−54.6159 × 10−105.4941 × 10−11-
F8Min9.5307 × 1021.8134 × 1031.1621 × 1031.7187 × 1031.0106 × 1031.1057 × 1031.2746 × 1031.0109 × 1031.0667 × 103
Max1.5179 × 1032.1794 × 1031.2895 × 1032.0365 × 1031.2399 × 1031.2817 × 1031.6484 × 1031.2428 × 1031.2248 × 103
Mean1.0207 × 1032.0123 × 1031.2439 × 1031.8588 × 1039.8827 × 1029.4820 × 1021.3998 × 1031.1382 × 1031.1408 × 103
Std2.2909 × 1018.7077 × 1012.5499 × 1018.7226 × 1014.5826 × 1012.3206 × 1017.1058 × 1014.4933 × 1014.0742 × 101
Rank196823754
p-value3.0199 × 10−113.0199 × 10−111.7769 × 10−103.0199 × 10−117.6171 × 10−33.6439 × 10−23.0199 × 10−113.0199 × 10−11-
F9Min4.8233 × 1047.2918 × 1045.8535 × 1035.7641 × 1049.4579 × 1032.4979 × 1042.6835 × 1042.9374 × 1041.2546 × 104
Max9.0949 × 1041.2119 × 1052.1322 × 1041.0598 × 1052.9632 × 1044.2548 × 1047.4146 × 1044.5420 × 1043.5896 × 104
Mean7.3802 × 1049.9799 × 1041.3925 × 1048.2871 × 1041.8497 × 1043.4493 × 1043.9735 × 1043.6275 × 1042.3481 × 104
Std9.4844 × 1031.2560 × 1043.8673 × 1031.0137 × 1044.4405 × 1034.1921 × 1039.8762 × 1033.9604 × 1035.8765 × 103
Rank791824653
p-value3.6897 × 10−113.0199 × 10−114.1178 × 10−63.0199 × 10−116.5204 × 10−66.0459 × 10−74.1997 × 10−101.4643 × 10−10-
F10Min1.4934 × 1041.7224 × 1041.4494 × 1041.5148 × 1046.2925 × 1037.0489 × 1031.1265 × 1046.1837 × 1035.5321 × 103
Max1.6715 × 1041.9414 × 1041.6160 × 1041.8002 × 1049.8385 × 1031.0939 × 1041.5006 × 1049.6680 × 1031.1909 × 104
Mean1.6150 × 1041.8362 × 1041.5510 × 1041.6538 × 1047.3335 × 1036.9984 × 1031.3376 × 1047.4781 × 1037.9009 × 103
Std5.6697 × 1025.1518 × 1024.2387 × 1025.5881 × 1028.1754 × 1021.3399 × 1039.6279 × 1028.6425 × 1021.2515 × 103
Rank794853621
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.1830 × 10−17.2208 × 10−61.9568 × 10−108.9934 × 10−11-
F11Min2.0214 × 1036.3864 × 1041.4631 × 1034.1450 × 1041.2675 × 1031.3884 × 1034.7453 × 1031.2529 × 1031.2173 × 103
Max1.1219 × 1051.2177 × 1082.1360 × 1033.4811 × 1051.6147 × 1031.6474 × 1031.2710 × 1041.4930 × 1031.5044 × 103
Mean4.5105 × 1037.8482 × 1061.6211 × 1031.1678 × 1051.3906 × 1031.3255 × 1038.4656 × 1031.3531 × 1031.3283 × 103
Std1.4754 × 1032.4554 × 1071.6887 × 1027.3811 × 1047.2417 × 1016.8586 × 1012.0427 × 1036.0964 × 1017.0062 × 101
Rank695843721
p-value3.0199 × 10−113.0199 × 10−111.0105 × 10−83.0199 × 10−111.6351 × 10−52.3897 × 10−83.0199 × 10−113.0199 × 10−11-
F12Min3.5279 × 1068.7017 × 10107.2668 × 1066.2728 × 10101.1258 × 1074.5434 × 1071.5888 × 1092.4553 × 10106.5751 × 105
Max2.2512 × 10102.0672 × 10116.4227 × 1071.4081 × 10111.1308 × 1081.0011 × 1091.4224 × 10109.2162 × 10108.1294 × 106
Mean6.7942 × 1061.5357 × 10112.7073 × 1071.0607 × 10115.6105 × 1062.7271 × 1065.1376 × 1095.3826 × 10104.2792 × 106
Std1.4874 × 1062.9783 × 10101.3604 × 1072.1816 × 10103.3639 × 1062.5234 × 1062.6765 × 1091.5493 × 10101.7662 × 106
Rank295843671
p-value3.0199 × 10−113.0199 × 10−114.0772 × 10−113.0199 × 10−112.1544 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F13Min7.2149 × 1034.9894 × 10105.9113 × 1032.5897 × 10104.6446 × 1042.7099 × 1061.1170 × 1082.0782 × 1032.1310 × 103
Max6.0868 × 1081.4655 × 10113.8426 × 1051.0462 × 10114.0505 × 1051.4181 × 1071.1703 × 1093.8934 × 1043.0815 × 104
Mean2.4268 × 1049.4367 × 10106.9790 × 1045.6101 × 10103.5581 × 1046.7661 × 1065.0369 × 1081.2327 × 1041.0811 × 104
Std1.3717 × 1042.3674 × 10108.6118 × 1042.3213 × 10109.0619 × 1032.4739 × 1062.6966 × 1081.0564 × 1048.2004 × 103
Rank594836721
p-value3.0199 × 10−113.0199 × 10−113.8202 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F14Min4.1906 × 1059.5570 × 1072.0714 × 1033.3316 × 1071.3498 × 1051.7340 × 1048.9321 × 1051.4359 × 1041.4389 × 104
Max1.7106 × 1071.4629 × 1097.7314 × 1044.1784 × 1083.1740 × 1061.9287 × 1062.5760 × 1075.2479 × 1053.2952 × 105
Mean1.0222 × 1064.6257 × 1081.7420 × 1041.9959 × 1081.2329 × 1058.7627 × 1047.0398 × 1066.2703 × 1031.2819 × 105
Std2.9243 × 1053.3366 × 1081.7944 × 1041.1014 × 1088.1386 × 1048.2944 × 1045.3175 × 1065.0191 × 1038.5647 × 104
Rank691853724
p-value3.0199 × 10−113.0199 × 10−112.8716 × 10−103.0199 × 10−111.5581 × 10−81.0035 × 10−33.0199 × 10−113.0199 × 10−11-
F15Min1.3091 × 1041.0950 × 10103.1864 × 1037.8860 × 1099.5371 × 1031.0031 × 1062.2147 × 1062.1377 × 1031.7094 × 103
Max6.7823 × 1076.4681 × 10101.8522 × 1043.5336 × 10101.0513 × 1052.6072 × 1067.3772 × 1082.0301 × 1042.0306 × 104
Mean2.0082 × 1043.7251 × 10108.8352 × 1032.0862 × 10102.6560 × 1048.1477 × 1031.2709 × 1081.0394 × 1041.0118 × 104
Std1.3254 × 1071.0897 × 10103.9229 × 1037.2317 × 1097.0281 × 1037.2640 × 1031.5770 × 1086.3665 × 1036.3766 × 103
Rank691854732
p-value3.0199 × 10−113.0199 × 10−113.4783 × 10−013.0199 × 10−111.0937 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F16Min2.6894 × 1031.0329 × 1044.7435 × 1036.9585 × 1032.9053 × 1033.1301 × 1034.9183 × 1032.6587 × 1032.6772 × 103
Max7.6050 × 1032.9300 × 1046.0319 × 1031.8262 × 1044.9114 × 1035.0726 × 1038.1525 × 1034.2215 × 1034.3269 × 103
Mean7.0721 × 1031.6145 × 1045.4797 × 1031.2009 × 1043.6782 × 1034.1060 × 1036.3953 × 1033.5095 × 1033.3572 × 103
Std1.8079 × 1024.0451 × 1033.2502 × 1022.8612 × 1033.0762 × 1023.5018 × 1028.3211 × 1024.3163 × 1024.5277 × 102
Rank496835712
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−119.5207 × 10−42.6015 × 10−83.0199 × 10−113.0199 × 10−11-
F17Min2.4423 × 1039.8528 × 1043.6865 × 1033.3592 × 1042.6928 × 1032.9257 × 1033.3481 × 1032.4857 × 1032.2453 × 103
Max6.2546 × 1039.5595 × 1064.4438 × 1032.9279 × 1064.2062 × 1034.1047 × 1036.2500 × 1034.1235 × 1033.6754 × 103
Mean2.7730 × 1031.9614 × 1064.1175 × 1038.1293 × 1053.1007 × 1032.7561 × 1034.5374 × 1033.2171 × 1033.1866 × 103
Std1.1315 × 1022.1509 × 1062.1428 × 1028.0943 × 1053.8834 × 1023.4257 × 1026.6839 × 1023.5632 × 1022.9674 × 102
Rank296853741
p-value3.0199 × 10−113.0199 × 10−111.3289 × 10−103.0199 × 10−113.1830 × 10−37.6588 × 10−59.9186 × 10−113.0199 × 10−11-
F18Min1.1442 × 1062.6311 × 1081.4109 × 1051.3777 × 1089.0091 × 1051.9368 × 1055.6824 × 1063.1599 × 1051.4013 × 105
Max1.9841 × 1084.2097 × 1096.9597 × 1061.8157 × 1091.6783 × 1076.1907 × 1061.9516 × 1083.0602 × 1063.6657 × 106
Mean2.2748 × 1061.6174 × 1091.0200 × 1065.1869 × 1086.5200 × 1051.4151 × 1067.8002 × 1076.2117 × 1041.2824 × 106
Std9.3414 × 1059.0538 × 1081.2802 × 1063.8238 × 1083.7436 × 1051.5271 × 1065.7298 × 1073.1235 × 1049.1925 × 105
Rank693845712
p-value3.0199 × 10−113.0199 × 10−117.2446 × 10−23.0199 × 10−114.4440 × 10−76.5671 × 10−23.0199 × 10−113.0199 × 10−11-
F19Min2.2536 × 1047.2629 × 1092.7325 × 1031.7391 × 1094.9036 × 1034.3727 × 1051.5371 × 1062.7933 × 1032.2570 × 103
Max1.0624 × 1072.5147 × 10103.3273 × 1041.3703 × 10105.3008 × 1048.5652 × 1062.0519 × 1084.3588 × 1044.3440 × 104
Mean3.5934 × 1041.5889 × 10101.2450 × 1048.2284 × 1091.1180 × 1041.1636 × 1042.2289 × 1071.6594 × 1041.9110 × 104
Std5.8193 × 1034.4925 × 1098.1019 × 1032.6890 × 1091.4291 × 1041.3499 × 1043.8275 × 1078.6516 × 1031.1465 × 104
Rank591846732
p-value3.0199 × 10−113.0199 × 10−116.9724 × 10−033.0199 × 10−116.5671 × 10−23.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F20Min2.6998 × 1034.3422 × 1033.6976 × 1034.2261 × 1032.5538 × 1032.9170 × 1032.9470 × 1032.7100 × 1032.5200 × 103
Max5.1469 × 1006.3104 × 1034.5766 × 1035.5410 × 1033.9869 × 1034.2865 × 1034.8530 × 1034.0657 × 1033.7274 × 103
Mean2.8057 × 1035.5757 × 1034.2660 × 1035.0164 × 1032.9847 × 1032.7640 × 1033.9645 × 1033.2555 × 1033.1375 × 103
Std1.1503 × 1023.9107 × 1021.8976 × 1022.8959 × 1022.6650 × 1023.5288 × 1024.5085 × 1022.8232 × 1022.8467 × 102
Rank396852741
p-value3.0199 × 10−113.0199 × 10−113.3384 × 10−113.0199 × 10−111.2235 ×10−12.4327 × 10−54.1997 × 10−101.6132 × 10−10-
F21Min2.3136 × 1033.4265 × 1032.7012 × 1033.1961 × 1032.4949 × 1032.6926 × 1032.8774 × 1032.4874 × 1032.4818 × 103
Max3.0055 × 1033.8239 × 1032.7877 × 1033.7133 × 1032.7156 × 1032.9352 × 1033.3561 × 1032.7711 × 1032.6774 × 103
Mean2.5208 × 1033.5781 × 1032.7456 × 1033.4235 × 1032.5004 × 1032.4284 × 1033.0989 × 1032.5924 × 1032.5879 × 103
Std4.1582 × 1011.0084 × 1022.2641 × 1011.1081 × 1024.8130 × 1012.6054 × 1011.0630 × 1025.9981 × 1014.5289 × 101
Rank295834761
p-value3.0199 × 10−113.0199 × 10−112.6099 × 10−103.0199 × 10−115.1060 × 10−16.0658 × 10−113.0199 × 10−113.0199 × 10−11-
F22Min2.3290 × 1031.7731 × 1041.5921 × 1041.6734 × 1047.9563 × 1038.7394 × 1031.3148 × 1042.3027 × 1032.3083 × 103
Max1.8295 × 1042.1117 × 1041.7677 × 1041.9531 × 1041.1998 × 1041.3645 × 1041.6183 × 1041.6584 × 1041.4202 × 104
Mean7.2668 × 1031.9976 × 1041.6949 × 1041.8199 × 1048.5906 × 1038.6909 × 1031.5011 × 1049.7202 × 1031.0244 × 104
Std1.7029 × 1037.5148 × 1024.1891 × 1026.5818 × 1028.8234 × 1021.5935 × 1037.7079 × 1021.6942 × 1031.4818 × 103
Rank597813642
p-value3.0199 × 10−113.0199 × 10−113.3384 × 10−113.0199 × 10−118.7663 × 10−12.6806 × 10−41.6947 × 10−91.3289 × 10−10-
F23Min2.9430 × 1034.3426 × 1033.1540 × 1034.3702 × 1032.9032 × 1033.7582 × 1033.2908 × 1032.8899 × 1032.8969 × 103
Max3.5530 × 1036.1944 × 1033.2442 × 1035.3720 × 1033.1720 × 1035.1547 × 1034.3469 × 1033.2646 × 1033.2729 × 103
Mean2.9640 × 1035.4133 × 1033.2063 × 1034.7249 × 1032.9374 × 1032.8589 × 1033.8112 × 1033.1530 × 1033.0477 × 103
Std1.6073 × 1014.4709 × 1022.3231 × 1012.6141 × 1023.7229 × 1012.3081 × 1011.9865 × 1021.2025 × 1028.2490 × 101
Rank295816734
p-value3.0199 × 10−113.0199 × 10−114.6159 × 10−103.0199 × 10−111.9073 × 10−013.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F24Min3.3535 × 1035.2235 × 1033.3085 × 1034.6051 × 1033.0156 × 1033.4696 × 1033.6496 × 1033.0843 × 1033.0889 × 103
Max3.8130 × 1036.6783 × 1033.4137 × 1036.1114 × 1033.3977 × 1034.3417 × 1034.5317 × 1033.4981 × 1033.4223 × 103
Mean3.3993 × 1036.0244 × 1033.3676 × 1035.1850 × 1033.0837 × 1033.1199 × 1033.9231 × 1033.3588 × 1033.2258 × 103
Std4.3891 × 1013.7345 × 1023.3211 × 1013.7552 × 1023.3313 × 1011.2851 × 1021.8043 × 1021.2714 × 1028.7882 × 101
Rank592816743
p-value3.0199 × 10−113.0199 × 10−115.9673 × 10−93.0199 × 10−114.3764 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F25Min2.9755 × 1034.7272 × 1043.1495 × 1032.8090 × 1043.0408 × 1032.9953 × 1034.0182 × 1033.0579 × 1033.0554 × 103
Max1.4647 × 1049.0089 × 1043.3198 × 1036.2084 × 1043.1692 × 1033.1970 × 1036.4537 × 1033.1648 × 1033.1685 × 103
Mean3.0165 × 1036.4324 × 1043.2248 × 1034.5618 × 1043.0272 × 1033.1182 × 1035.0816 × 1033.0624 × 1033.1108 × 103
Std1.3439 × 1019.8094 × 1034.8319 × 1018.5251 × 1033.9176 × 1014.6437 × 1016.1735 × 1024.0919 × 1012.3322 × 101
Rank196825743
p-value3.0199 × 10−113.0199 × 10−118.1527 × 10−113.0199 × 10−111.7613 × 10−11.3272 × 10−23.0199 × 10−113.0199 × 10−11-
F26Min2.9444 × 1032.4665 × 1047.8425 × 1031.6339 × 1042.9634 × 1033.1709 × 1031.1662 × 1043.0121 × 1032.9194 × 103
Max1.2607 × 1044.0057 × 1049.2694 × 1033.1395 × 1041.0315 × 1041.3575 × 1041.8656 × 1041.1977 × 1041.2784 × 104
Mean4.7204 × 1033.2947 × 1048.4516 × 1032.6237 × 1045.6094 × 1035.2261 × 1031.4650 × 1047.1147 × 1038.8009 × 103
Std1.5343 × 1034.6618 × 1033.2312 × 1023.5910 × 1038.4608 × 1023.5855 × 1021.5239 × 1033.9328 × 1033.0914 × 103
Rank293814765
p-value2.6243 × 10−33.0199 × 10−111.3345 × 10−13.0199 × 10−119.5207 × 10−47.2951 × 10−43.0199 × 10−113.0199 × 10−11-
F27Min3.3438 × 1037.1551 × 1033.6472 × 1036.2376 × 1033.3222 × 1034.0781 × 1034.0833 × 1033.3419 × 1033.3592 × 103
Max3.2000 × 1031.1558 × 1044.1135 × 1039.2642 × 1033.6406 × 1036.8633 × 1036.2070 × 1033.9052 × 1034.0475 × 103
Mean3.3665 × 1039.4605 × 1033.8592 × 1037.2641 × 1033.3638 × 1033.4086 × 1034.9736 × 1033.7284 × 1033.5766 × 103
Std1.1946 × 1011.0557 × 1031.5081 × 1027.5261 × 1026.6761 × 1016.8591 × 1015.7337 × 1022.0288 × 1021.6445 × 102
Rank296815734
p-value3.0199 × 10−113.0199 × 10−114.8011 × 10−73.0199 × 10−119.0000 × 10−14.0772 × 10−114.5043 × 10−113.0199 × 10−11-
F28Min3.2686 × 1031.8715 × 1043.4037 × 1031.5041 × 1043.3066 × 1033.3134 × 1035.1531 × 1033.3186 × 1033.2791 × 103
Max3.3000 × 1033.9762 × 1044.0746 × 1032.6058 × 1043.5665 × 1034.6174 × 1037.5274 × 1033.4944 × 1033.4946 × 103
Mean3.2929 × 1032.5912 × 1043.6658 × 1032.0357 × 1043.3093 × 1033.3430 × 1035.9790 × 1033.2984 × 1033.3820 × 103
Std1.2643 × 1014.5988 × 1031.3597 × 1023.0568 × 1032.2196 × 1014.2886 × 1015.3741 × 1023.4640 × 1014.3503 × 101
Rank196825734
p-value5.5727 × 10−103.0199 × 10−113.3384 × 10−113.0199 × 10−114.2896 × 10−16.9522 × 10−13.0199 × 10−113.0199 × 10−11-
F29Min3.8197 × 1031.2914 × 1055.1182 × 1032.7327 × 1044.4704 × 1035.0757 × 1036.9052 × 1033.4215 × 1033.6832 × 103
Max1.4178 × 1049.3402 × 1066.3314 × 1037.8777 × 1065.9182 × 1038.1004 × 1031.4442 × 1045.4800 × 1035.3900 × 103
Mean4.0094 × 1032.5219 × 1065.7297 × 1031.3381 × 1064.3452 × 1033.8221 × 1039.3579 × 1034.6241 × 1034.5194 × 103
Std1.3811 × 1022.3693 × 1062.6551 × 1021.8461 × 1062.3220 × 1022.4027 × 1021.6141 × 1033.1504 × 1023.1315 × 102
Rank496853721
p-value3.0199 × 10−113.0199 × 10−115.0723 × 10−103.0199 × 10−119.6263 × 10−23.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F30Min7.4175 × 1051.5664 × 10106.5073 × 1065.7609 × 1094.7658 × 1065.8641 × 1071.2543 × 1089.0351 × 1087.7096 × 105
Max8.3117 × 1083.5848 × 10101.7274 × 1072.6506 × 10102.2023 × 1071.1202 × 1087.8791 × 1088.6897 × 1092.4072 × 106
Mean8.4809 × 1052.3769 × 10101.1678 × 1071.2540 × 10101.6586 × 1062.4672 × 1063.4948 × 1083.5788 × 1091.2371 × 106
Std5.8574 × 1045.7961 × 1092.6507 × 1065.2766 × 1093.0622 × 1056.2579 × 1051.6293 × 1081.8702 × 1093.9959 × 105
Rank194835672
p-value3.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
+/=/−30/0/030/0/027/0/330/0/018/0/1226/0/430/0/030/0/0-

4.1.2. Convergence Behavior Analysis

The second part is the convergence rate of the proposed AMRFOCS. Therefore, when dealing with 30-dimensional and 50-dimensional CEC2017 benchmark functions, the average convergence curve of AMRFOCS is compared with other classical algorithms, as shown in Figure 3 and Figure 4. By examining the curve, it can be recognized that many algorithms fall into the local solution of most functions. In the case of multimodal, mixed and composite functions such as F1, F3, F11, F12, F16, F17, F21, F24, F29 and F30, AMRFOCS shows a high degree of balance between the exploration and exploitation phases.

4.2. Valuation AMRFOCS by Utilizing CEC2020 Benchmark Functions

In this section, AMRFOCS passes 10 functional tests of CEC2020. According to the CEC2020 available dimension of the competition report, they are 5, 10, 15 and 20 [49]. Based on the experimental settings of the references, the dimensions used in this experiment are 10, 15 and 20 dimensions. The population sizes are 30, 100 and 30, respectively. The number of evaluation functions used is 3000, 500 and 5000, respectively. AMRFOCS is compared with ABC, ACO, SMA, GA, PSO, WOA and MRFO. Each algorithm implements 30 independent runs.

4.2.1. Statistical Results Analysis

In this benchmark test of CEC2020, AMRFOCS is compared with seven algorithms, including ACO [42], ABC [43], GA, SMA [51], PSO [52], WOA [52] and MRFO [18].These comparative algorithms are from different references and show their respective advantages and good performance in the literature. The comparison results between AMRFOCS and the other algorithms are shown in Table 7, Table 8 and Table 9.
Table 7, Table 8 and Table 9 show four indicators, namely the mean value (mean), standard deviation (std), minimum value (min) and maximum value (max), as well as the sort value of the algorithm. In addition, at the 5% significance level, the Wilcoxon rank-sum test [47] is used to affirm whether AMRFOCS has a significant contribution to other algorithms. “-” represents ‘‘not applicable’’, which means that the best algorithm cannot be statistically compared with itself in the rank-sum test. In Table 7, Table 8 and Table 9, we give the algorithm’s ranking in different test functions and the p-value of the rank-sum test. The table’s bold data are the eight algorithms’ optimal minimum values (maximum values, mean values or standard deviation). Additionally, the last row of Table 7, Table 8 and Table 9 lists three symbols (+/−/=) to show the number of functions whereby AMRFOCS has a superior (+) performance, the number of functions whereby AMRFOCS has the same behavior as the other algorithms (=) and the number of functions whereby AMRFOCS is at a disadvantage.
Table 7, Table 8 and Table 9 show the average fitness values obtained for each method in the overall number of runs. Based on the results of these records, Table 7 shows that for both F1 and F2, AMRFOCS only achieved the best fitness value. In F3, AMRFOCS performed poorly, and PSO achieved the best mean and standard deviation. However, from F4 to F10, AMRFOCS showed a dominant position and basically achieved the best value of all indicators. Table 8 shows that of the 10 test functions in CEC2020, for 8 of them (F1, F4–F10), AMRFOCS performed better than all the other algorithms and showed the best average. As shown in Table 9, AMRFOCS still performed well in the reorganization experiment, especially with the mixed function and the combinatorial function. AMRFOCS always achieves the best fitness value and average value and ranks first.
The experimental results also show the standard deviation for AMRFOCS and the other comparison algorithms. Based on these results, AMRFOCS is the most stable metaheuristic algorithm because it enables more than half of the 10 functions to reach the minimum, such as F1, F4, F5, F7, F8, F9 and F10. In addition, the Wilcoxon signed-rank test is also shown in the table to check whether there is a statistical difference between AMRFOCS and the other algorithms when the p value is less than 0.05. The results show that most of the obtained values are less than 0.05, which means that there is a statistical difference between AMRFOCS and the other algorithms.
Table 7. Comparison of results obtained—CEC2020 benchmark functions (10D).
Table 7. Comparison of results obtained—CEC2020 benchmark functions (10D).
FunctionABCACOSMAGAPSOWOAMRFOAMRFOCS
F1Min1.1392 × 1021.2380 × 10104.1585 × 1024.1787 × 1091.0248 × 1025.2553 × 1041.0102 × 1021.0001 × 102
Max3.7030 × 1034.0313 × 10101.2741 × 1042.7128 × 10105.5466 × 1032.2853 × 1066.8346 × 1038.8983 × 103
Mean8.2827 × 1022.2807 × 10107.1025 × 1031.3071 × 10101.6719 × 1032.8538 × 1051.8831 × 1032.0195 × 103
Std8.9945 × 1026.7663 × 1094.5802 × 1035.7495 × 1092.0858 × 1034.9750 × 1051.8434 × 1032.4139 × 103
Rank18572634
p-value7.6183 × 10−13.0199 × 10−111.5292 × 10−53.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F2Min2.1494 × 1032.7892 × 1031.2259 × 1032.6188 × 1031.2431 × 1031.4208 × 1031.2420 × 1031.1069 × 103
Max2.7872 × 1034.6651 × 1032.0202 × 1033.5672 × 1032.3308 × 1032.5457 × 1032.5707 × 1032.1619 × 103
Mean2.5096 × 1033.8503 × 1031.5427 × 1033.1849 × 1031.8046 × 1032.0166 × 1031.7194 × 1031.6420 × 103
Std1.5423 × 1023.6014 × 1022.0360 × 1022.8795 × 1022.8154 × 1023.1524 × 1023.0358 × 1022.7249 × 102
Rank58174362
p-value4.0772 × 10−113.0199 × 10−114.8413 × 10−23.0199 × 10−119.3341 × 10−25.1857 × 10−72.0283 × 10−7-
F3Min7.2727 × 1021.0276 × 1037.1436 × 1028.9206 × 1027.1620 × 1027.4046 × 1027.1873 × 1027.1666 × 102
Max7.4843 × 1021.4397 × 1037.4611 × 1021.1748 × 1037.2973 × 1028.1452 × 1027.8961 × 1027.7151 × 102
Mean7.3954 × 1021.2033 × 1037.2509 × 1021.0282 × 1037.2131 × 1027.7289 × 1027.4756 × 1027.4002 × 102
Std4.8970 × 1009.1232 × 1015.9102 × 1008.3489 × 1014.2931 × 1001.8023 × 1011.7360 × 1011.3309 × 101
Rank38271564
p-value4.9178 × 10−13.0199 × 10−111.7479 × 10−53.0199 × 10−111.1536 × 10−14.1825 × 10−91.1023 × 10−8-
F4Min1.9009 × 1033.9594 × 1051.9006 × 1031.4313 × 1041.9005 × 1001.9015 × 1031.9005 × 1031.9001 × 103
Max1.9024 × 1032.1254 × 1071.9020 × 1033.9910 × 1061.9017 × 1031.9133 × 1031.9021 × 1031.9017 × 103
Mean1.9018 × 1035.8465 × 1061.9010 × 1031.1194 × 1061.9010 × 1031.9052 × 1031.9011 × 1031.9010 × 103
Std3.8056 × 10−15.3127 × 1063.6866 × 10−11.1438 × 1063.8581 × 10−13.0433 × 1004.0247 × 10−13.4371 × 10 -1
Rank48273561
p-value2.6099 × 10−103.0199 × 10−112.6433 × 10−13.0199 × 10−112.0283 × 10−73.3384 × 10−113.0199 × 10−11-
F5Min3.0234 × 1047.8639 × 1051.7319 × 1031.2076 × 1052.1097 × 1034.0071 × 1031.7394 × 1031.7216 × 103
Max3.0470 × 1052.0144 × 1081.7902 × 1047.0618 × 1079.3423 × 1032.2519 × 1062.6867 × 1032.3247 × 103
Mean9.7741 × 1043.5939 × 1077.4005 × 1031.0550 × 1074.5410 × 1033.2595 × 1052.1621 × 1032.0043 × 103
Std7.7378 × 1044.2267 × 1075.9110 × 1031.7068 × 1072.6321 × 1035.8379 × 1052.6215 × 1021.7213 × 102
Rank58372641
p-value3.0199 × 10−113.0199 × 10−112.7829 × 10−073.0199 × 10−116.5183 × 10−093.0199 × 10−111.0702 × 10−9-
F6Min1.6004 × 1031.6107 × 1031.6002 × 1031.6035 × 1031.6007 × 1031.6126 × 1031.6000 × 1031.6000 × 103
Max1.6010 × 1032.1694 × 1031.6010 × 1031.8803 × 1031.9365 × 1031.9815 × 1031.6012 × 1031.6006 × 103
Mean1.6007 × 1031.7757 × 1031.6005 × 1031.7042 × 1031.7815 × 1031.8004 × 1031.6003 × 1031.6002 × 103
Std1.6805 × 10−11.3259 × 1022.5080 × 10−17.1502 × 1018.9709 × 1011.0238 × 1022.9741 × 10−11.6704 × 10 -1
Rank38274561
p-value1.5465 × 10−93.0199 × 10−118.5641 × 10−43.0199 × 10−118.1014 × 10−102.6015 × 10−82.1544 × 10−10-
F7Min7.2813 × 1031.0613 × 1042.1235 × 1032.5605 × 1042.1008 × 1033.1679 × 1032.1006 × 1032.1001 × 103
Max4.8656 × 1045.5590 × 1071.3274 × 1042.8168 × 1072.7098 × 1037.9900 × 1042.5875 × 1032.3049 × 103
Mean2.1022 × 1041.3985 × 1074.2549 × 1033.9699 × 1062.3453 × 1032.1814 × 1042.2227 × 1032.1724 × 103
Std1.0771 × 1041.4600 × 1073.2623 × 1036.1860 × 1061.7779 × 1021.8219 × 1041.2202 × 1026.8456 × 101
Rank58273641
p-value3.0199 × 10−113.0199 × 10−119.0632 × 10−83.0199 × 10−113.0199 × 10−113.0199 × 10−114.9752 × 10−11-
F8Min2.3042 × 1033.5079 × 1032.2226 × 1032.7068 × 1032.3006 × 1032.2835 × 1032.3003 × 1032.2181 × 103
Max2.3090 × 1035.5522 × 1033.2109 × 1034.2787 × 1032.3042 × 1033.6330 × 1032.3062 × 1032.3032 × 103
Mean2.3068 × 1034.5947 × 1032.4092 × 1033.4760 × 1032.3018 × 1032.4247 × 1032.3020 × 1032.2970 × 103
Std1.3501 × 1005.6370 × 1022.5965 × 1024.6147 × 1028.2941 × 10−13.4389 × 1021.3591 × 1007.6795 × 10 -1
Rank28375641
p-value3.0180 × 10−113.0180 × 10−112.9203 × 10−23.0180 × 10−113.0180 × 10−115.0695 × 10−103.0180 × 10−11-
F9Min2.7173 × 1032.8592 × 1032.7433 × 1032.7979 × 1032.4000 × 1032.7527 × 1032.5000 × 1032.4000 × 103
Max2.7698 × 1033.3082 × 1032.7753 × 1033.1470 × 1032.7677 × 1032.8258 × 1032.7668 × 1032.7597 × 103
Mean2.7557 × 1033.0335 × 1032.7571 × 1032.9184 × 1032.6812 × 1032.7776 × 1032.6820 × 1032.6723 × 103
Std1.2156 × 1011.0545 × 1029.2128 × 1007.6362 × 1011.2122 × 1022.0095 × 1011.1194 × 1028.3901 × 101
Rank38267451
p-value1.2018 × 10−83.0180 × 10−116.7634 × 10−52.3701 × 10−102.1322 × 10−52.9201 × 10−96.9113 × 10−4-
F10Min2.8979 × 1033.1575 × 1032.8982 × 1033.0391 × 1032.8979 × 1032.6443 × 1032.8979 × 1032.6000 × 103
Max2.9460 × 1037.1006 × 1033.0242 × 1035.1923 × 1032.9500 × 1032.9723 × 1032.9489 × 1032.9495 × 103
Mean2.9392 × 1034.8641 × 1032.9384 × 1033.8670 × 1032.9220 × 1032.9354 × 1032.9349 × 1032.9015 × 103
Std9.7289 × 1008.7925 × 1022.8954 × 1015.8024 × 1022.3653 × 1017.1523 × 1011.9938 × 1012.2267 × 101
Rank28473561
p-value5.7929 × 10−13.0199 × 10−111.3272 × 10−23.0199 × 10−119.3519 × 10−12.0152 × 10−84.5726 × 10−9-
+/=/−7/0/310/0/09/0/19/0/17/0/310/0/010/0/0-
Table 8. Comparison of results obtained—CEC2020 benchmark functions (15D).
Table 8. Comparison of results obtained—CEC2020 benchmark functions (15D).
FunctionABCACOSMAGAPSO [53]WOAMRFOAMRFOCS
F1Min8.9182 × 1031.8080 × 10103.0812 × 1021.1723 × 10101.5726 × 1065.5228 × 1071.0003 × 1021.0919 × 102
Max3.0062 × 1066.3113 × 10102.5958 × 1044.3013 × 10104.3153 × 1061.1845 × 1092.5394 × 1041.9760 × 104
Mean2.0499 × 1053.9588 × 10101.1066 × 1042.4697 × 10102.8600 × 1083.5501 × 1088.3197 × 1036.2404 × 103
Std5.7480 × 1051.0666 × 10109.1622 × 1037.0715 × 1096.5900 × 1082.6468 × 1088.0391 × 1035.8357 × 103
Rank38274561
p-value1.6132 × 10−103.0199 × 10−111.3272 × 10−23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F2Min3.3808 × 1034.1367 × 1031.3889 × 1033.9989 × 1031.9509 × 1032.4380 × 1031.7015 × 1031.2364 × 103
Max4.3815 × 1036.0406 × 1033.3464 × 1035.5303 × 1033.5246 × 1034.1739 × 1033.0513 × 1032.7292 × 103
Mean4.0746 × 1035.4222 × 1032.0896 × 1034.7553 × 1033.9700 × 1023.3124 × 1032.2987 × 1031.9570 × 103
Std2.6396 × 1024.1989 × 1024.0949 × 1024.0296 × 1021.9500 × 1024.7882 × 1023.4635 × 1023.6533 × 102
Rank48362571
p-value3.0199 × 10−113.0199 × 10−111.3345 × 10−13.0199 × 10−112.0023 × 10−64.1997 × 10−109.9186 × 10−11-
F3Min7.7125 × 1021.3751 × 1037.3112 × 1021.2423 × 1037.8084 × 1027.9357 × 1027.5401 × 1027.3690 × 102
Max8.1444 × 1022.0440 × 1037.5919 × 1021.6998 × 1039.2097 × 1029.6361 × 1029.0212 × 1028.0621 × 102
Mean7.9919 × 1021.7320 × 1037.4427 × 1021.4555 × 1032.2800 × 1018.7867 × 1028.0701 × 1027.6385 × 102
Std9.3785 × 1001.7168 × 1028.4538 × 1001.2329 × 1023.3400 × 1004.3156 × 1013.6815 × 1011.8231 × 101
Rank28174563
p-value8.5641 × 10−43.0199 × 10−111.4294 × 10−83.0199 × 10−114.9426 × 10−53.6897 × 10−114.5043 × 10−11-
F4Min1.9062 × 1035.0856 × 1051.9012 × 1035.5274 × 1041.9048 × 1031.9173 × 1031.9015 × 1031.9009 × 103
Max1.9101 × 1031.4279 × 1071.9053 × 1031.0775 × 1071.9093 × 1032.3598 × 1031.9102 × 1031.9044 × 103
Mean1.9083 × 1035.7404 × 1061.9025 × 1032.6295 × 1067.5000 × 1012.0594 × 1031.9038 × 1031.9022 × 103
Std8.4822 × 10−14.0652 × 1069.5245 × 10−12.3108 × 1064.0000 × 1021.1233 × 1021.8716 × 1009.6539 × 10−1
Rank38472561
p-value5.4941 × 10−113.0199 × 10−111.4128 × 10−13.0199 × 10−114.5043 × 10−113.0199 × 10−113.0199 × 10−11-
F5Min9.8935 × 1048.4389 × 1063.3567 × 1036.2312 × 1061.7109 × 1049.1560 × 1032.7053 × 1031.8091 × 103
Max1.4449 × 1063.6071 × 1081.0135 × 1062.9321 × 1083.9436 × 1053.0431 × 1071.7649 × 1054.9794 × 103
Mean6.2043 × 1051.4181 × 1083.4353 × 1055.0984 × 1072.6300 × 1044.5353 × 1061.9206 × 1043.2198 × 103
Std3.5873 × 1051.0360 × 1083.7205 × 1056.1107 × 1071.0100 × 1056.1643 × 1063.1836 × 1047.2998 × 102
Rank48372651
p-value3.0199 × 10−113.0199 × 10−112.5721 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F6Min1.7276 × 1031.7276 × 1031.7276 × 1031.7276 × 1031.7276 × 1031.7276 × 1031.7276 × 1031.6025 × 103
Max1.7276 × 1031.7934 × 1031.7276 × 1031.7350 × 1031.7276 × 1031.7276 × 1031.7276 × 1031.6025 × 103
Mean1.7276 × 1031.7359 × 1031.7276 × 1031.7285 × 1031.2800 × 1021.7276 × 1031.7276 × 1031.6025 × 103
Std5.5011 × 10−61.4801 × 1011.0386 × 10−81.6969 × 1008.9900 × 1013.2909 × 10−113.2043 × 10−78.5918 × 10−8
Rank47286153
p-value7.6171 × 10−33.8461 × 10−32.5296 × 10−43.3384 × 10−112.0762 × 10−67.1086 × 10−126.2828 × 10−6-
F7Min1.3476 × 1054.2064 × 1063.0138 × 1032.8154 × 1068.4201 × 1031.6493 × 1052.5435 × 1032.3344 × 103
Max1.1855 × 1063.7604 × 10084.0915 × 1056.3958 × 1075.6134 × 1053.2858 × 1078.9311 × 1033.8247 × 103
Mean5.9020 × 1055.8754 × 1071.4061 × 1052.4985 × 1074.9000 × 1028.3051 × 1064.3069 × 1032.7756 × 103
Std3.2196 × 1056.6206 × 1071.3538 × 1051.7097 × 1074.1000 × 1028.8725 × 1061.5006 × 1033.7423 × 102
Rank58372641
h-value1111111-
p-value3.0199 × 10−113.0199 × 10−113.1589 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F8Min2.5928 × 1034.9297 × 1032.3002 × 1032.7897 × 1032.3105 × 1032.3194 × 1032.2744 × 10032.2628 × 103
Max5.5346 × 1037.4795 × 1033.7248 × 1036.6078 × 1034.5823 × 1035.1608 × 1032.3017 × 1032.3020 × 103
Mean3.4110 × 1036.4724 × 1032.6974 × 1035.2093 × 1031.2300 × 1023.3445 × 1032.2998 × 1032.2983 × 103
Std7.7193 × 1026.6794 × 1025.4439 × 1029.0966 × 1023.4200 × 1011.1929 × 1034.8385 × 1001.1649 × 100
Rank48273651
p-value2.9710 × 10−112.9710 × 10−111.0531 × 10−32.9710 × 10−115.4938 × 10−102.9710 × 10−112.9710 × 10−11-
F9Min2.8564 × 1033.2944 × 1032.7970 × 1033.0641 × 1032.5057 × 1032.8417 × 1032.5000 × 1032.7944 × 103
Max2.8918 × 1034.4273 × 1032.8337 × 1033.8402 × 1033.2787 × 1033.0317 × 1032.8648 × 1032.8275 × 103
Mean2.8760 × 1033.7546 × 1032.8108 × 1033.3587 × 1034.0600 × 1022.9344 × 1032.8016 × 1032.8082 × 103
Std7.7323 × 1002.5499 × 1029.3661 × 1002.2100 × 1028.7800 × 1015.3179 × 1015.8581 × 1017.3602 × 100
Rank38176452
p-value3.0199 × 10−113.0199 × 10−119.7052 × 10−013.0199 × 10−116.5277 × 10−84.6159 × 10−104.6159 × 10−10-
F10Min2.9382 × 1035.7203 × 1032.9002 × 1034.3186 × 1032.9065 × 1033.1705 × 1032.9000 × 1032.9000 × 103
Max3.1275 × 1031.9135 × 1043.1655 × 1031.2221 × 1043.1546 × 1033.5295 × 1033.1396 × 1033.1525 × 103
Mean3.0845 × 1039.9196 × 1032.9642 × 1036.7857 × 1032.2100 × 1043.2974 × 1032.9296 × 1032.9175 × 103
Std3.6737 × 1012.3530 × 1039.8522 × 1011.7801 × 1036.9600 × 1019.7382 × 1017.7440 × 1016.6683 × 101
Rank38471562
p-value5.0650 × 10−99.4001 × 10−121.7736 × 10−89.4001 × 10−122.5168 × 10−82.4067 × 10−111.0445 × 10−11-
+/=/−10/0/010/0/07/0/310/0/010/0/010/0/010/0/0-
Table 9. Comparison of results obtained—CEC2020 benchmark functions (20D).
Table 9. Comparison of results obtained—CEC2020 benchmark functions (20D).
FunctionABCACOSMA [50]GAPSO [49,54]WOAMRFO [50,54]AMRFOCS
F1Min6.6991 × 1024.0563 × 10101.6574 × 1022.5636 × 10101.0001 × 1026.3265 × 1078.3778 × 1091.0000 × 102
Max1.2555 × 1078.4887 × 10101.2154 × 1046.7598 × 10103.3223 × 1026.1524 × 1083.7434 × 10105.8159 × 103
Mean5.5245 × 1056.6290 × 10107.0214 × 1034.3889 × 10101.6732 × 1021.7326 × 1082.1385 × 10101.8646 × 103
Std2.2918 × 1061.0292 × 10103.4661 × 1039.5270 × 1097.3804 × 1011.3456 × 1086.9336 × 1091.9147 × 103
Rank48372561
p-value9.9410 × 10−013.0199 × 10−111.7290 × 10−063.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11-
F2Min5.1957 × 1035.8815 × 1031.1262 × 1035.0471 × 1031.1203 × 1033.1463 × 1031.7867 × 1031.7736 × 103
Max5.9571 × 1037.7571 × 1032.0288 × 1036.8063 × 1032.0631 × 1035.0027 × 1033.6937 × 1033.3548 × 103
Mean5.5760 × 1037.0582 × 1031.5103 × 1036.2467 × 1031.4822 × 1033.9622 × 1032.6240 × 1032.5471 × 103
Std1.9190 × 1024.4158 × 1022.3456 × 1024.2793 × 1022.2322 × 10024.6842 × 1025.0980 × 1024.1138 × 102
Rank68174352
p-value3.0199 × 10−113.0199 × 10−113.8249 × 10−93.0199 × 10−114.4205 × 10−65.4620 × 10−63.0199 × 10−11-
F3Min8.2806 × 1021.8443 × 1037.2316 × 1021.4839 × 1037.0266 × 1028.4704 × 1027.5771 × 1027.6226 × 102
Max8.7007 × 1022.6296 × 1037.3664 × 1022.4308 × 1037.3323 × 1021.0022 × 1039.2576 × 1029.3443 × 102
Mean8.4879 × 1022.2196 × 1037.2929 × 1021.9061 × 1037.2179 × 1029.3951 × 1028.4981 × 1028.4617 × 102
Std9.4200 × 1001.8780 × 1023.6765 × 1002.2344 × 1021.0121 × 1013.6276 × 1013.8601 × 1014.0698 × 101
Rank38271564
p-value5.2014 × 10−13.0199 × 10−113.3384 × 10−113.0199 × 10−114.9426 × 10−052.0152 × 10−084.0772 × 10−11-
F4Min1.9111 × 1031.2382 × 1061.9007 × 1034.3264 × 1051.9005 × 1031.9198 × 1031.9017 × 1031.9016 × 103
Max1.9170 × 1032.2397 × 1071.9016 × 1031.2404 × 1071.9025 × 1032.6053 × 1031.9072 × 1031.9091 × 103
Mean1.9136 × 1031.0108 × 1071.9012 × 1034.4157 × 1061.9015 × 1032.0567 × 1031.9043 × 1031.9046 × 103
Std1.5087 × 1006.3959 × 1062.3298 × 1003.1502 × 1064.0505 ×10−11.8873 × 1021.2803 × 1002.0092 × 100
Rank48271563
p-value2.9215 × 10−93.0199 × 10−111.1077 × 10−063.0199 × 10−112.7829 × 10−074.0772 × 10−113.0199 × 10−11-
F5Min8.0766 × 1051.7852 × 1073.7210 × 1034.4310 × 1062.6626 × 1032.0301 × 1051.8919 × 1032.8351 × 103
Max5.1985 × 1062.6166 × 1081.6802 × 1042.4465 × 1081.4404 × 1055.2724 × 1063.0040 × 1031.8735 × 104
Mean2.4414 × 1061.3021 × 1081.3273 × 1046.2227 × 1071.2921 × 1042.2840 × 1062.4118 × 1036.1639 × 103
Std9.3740 × 1056.5744 × 1074.0755 × 1034.8280 × 1072.5004 × 1041.5022 × 1062.9496 × 1024.1052 × 103
Rank58372461
p-value3.0199 × 10−113.0199 × 10−113.3384 × 10−113.0199 × 10−119.9186 × 10−113.0199 × 10−113.0199 × 10−11-
F6Min2.0209 × 1032.0209 × 1031.6025 × 1032.0209 × 1031.6025 × 1032.0209 × 1031.6025 × 1031.6622 × 103
Max2.0209 × 1032.0209 × 1032.3267 × 1032.0209 × 1032.3267 × 1032.0209 × 1032.3267 × 1031.6622 × 103
Mean2.0209 × 1032.0209 × 1031.8192 × 1032.0209 × 1031.8192 × 1032.0209 × 1031.8192 × 1031.6622 × 103
Std2.3126 × 10−132.3126 × 10−132.1374 × 1022.3126 × 10−132.1374 × 1022.3126 × 10−132.1374 × 1022.3126 × 10-13
Rank56273841
p-valueNaNNaNNaNNaNNaNNaNNaN-
F7Min2.2983 × 1057.5943 × 1062.3186 × 1031.9998 × 1062.1388 × 1034.2518 × 1042.1809 × 1032.3988 × 103
Max1.5042 × 1066.5444 × 1086.4946 × 1038.0646 × 1073.8441 × 1032.8797 × 1063.2587 × 1035.8574 × 103
Mean7.9336 × 1051.2540 × 1083.8725 × 1032.7422 × 1072.5657 × 1038.9956 × 1052.6459 × 1033.7674 × 103
Std3.4751 × 1051.2646 × 1081.3768 × 1032.3393 × 1073.5521 × 1028.6057 × 1052.4382 × 1021.0698 × 103
Rank68371452
p-value3.0199 × 10−113.0199 × 10−113.3384 × 10−113.0199 × 10−112.1544 × 10−103.0199 × 10−113.0199 × 10−11-
F8Min4.1639 × 1036.3323 × 1032.3000 × 1035.1673 × 1032.3000 × 10032.3252 × 1032.3000 × 1032.3000 × 103
Max7.4706 × 1039.6924 × 1034.4908 × 1038.6986 × 1033.8809 × 10037.0329 × 1032.3028 × 1032.3025 × 103
Mean6.6378 × 1038.6618 × 1033.9746 × 1037.4038 × 1032.9396 × 10034.4362 × 1032.3011 × 1032.3007 × 103
Std9.3263 × 1027.3792 × 1024.3257 × 1027.4140 × 1024.8483 × 10021.8870 × 1036.9236 × 10−17.8838 × 10 -1
Rank68273451
p-value2.6203 × 10−112.6203 × 10−113.8409 × 10−062.6203 × 10−112.6203 × 10−112.6203 × 10−112.6203 × 10−11-
F9Min2.9048 × 1033.3682 × 1032.8289 × 1033.2094 × 1032.8125 × 1032.8789 × 1032.4379 × 1032.5000 × 103
Max2.9581 × 1034.2698 × 1032.8727 × 1033.8063 × 1032.8470 × 1033.1286 × 1033.0148 × 1032.9151 × 103
Mean2.9416 × 1033.8519 × 1032.8507 × 1033.4810 × 1032.8207 × 1033.0257 × 1032.9098 × 1032.8505 × 103
Std1.0805 × 1012.3544 × 1021.2047 × 1011.6779 × 1029.6248 × 1005.2418 × 1011.1079 × 1022.1817 × 101
Rank38175462
p-value3.6897 × 10−113.0199 × 10−111.8577 × 10−13.0199 × 10−113.0199 × 10−116.0658 × 10−113.0199 × 10−11-
F10Min2.9067 × 1036.2467 × 1032.9100 × 1035.2774 × 1032.8992 × 1032.9798 × 1032.9114 × 1032.8997 × 103
Max3.0033 × 1032.4861 × 1042.9139 × 1031.6018 × 1042.9605 × 1033.2326 × 1033.0078 × 1033.0024 × 103
Mean2.9211 × 1031.4171 × 1042.9132 × 1038.7877 × 1032.9193 × 1033.0608 × 1032.9654 × 1032.9570 × 103
Std2.6124 × 1014.2631 × 1031.4034 × 1002.9286 × 1031.3624 × 1014.9901 × 1013.2780 × 1013.1937 × 101
Rank18273564
p-value5.5727 × 10−103.0199 × 10−111.1567 × 10−073.0199 × 10−112.7086 × 10−024.1127 × 10−073.0199 × 10−11-
+/=/−7/0/39/0/18/0/29/0/19/0/19/0/19/0/1-

4.2.2. Convergence Behavior Analysis

In order to further analyze the recommended AMRFOCS, the representations of the convergence curves of AMRFOCS and the other kinds of algorithms are plotted in Figure 5, Figure 6 and Figure 7 to assess the performance of AMRFOCS with the CEC2020 function. These results show that AMRFOCS is capable of faster convergence than all the compared algorithms, especially those in F5, F7, F8, F9 and F10. In different dimensions, the comprehensive performance of AMRFOCS ranks first. In more than 50% of the test functions, it can always reach the optimal value in less time and fewer iteration times.

5. AMRFOCS for Wireless Sensor Network (WSN)

In terms of deploying wireless sensor networks on 3D surfaces [55], compared with other deployment strategies, swarm intelligence optimization algorithms have the advantages of simplicity, ease of use and no need for special modeling [56]. In this paper, a new hybrid algorithm based on MRFO is proposed and applied to the deployment of a 3D-surface WSN. In the background of a complex environment, fixed simple and complex surfaces are set in the experiment [57].

5.1. WSN Coverage Model

In WSNs, the sensing radius R and communication radius Rc of sensor nodes are fixed as Rc = 2R. When deploying N homogeneous sensors in this area, the node set can be expressed as Z = {z1, z2, z3, …, zn}, which has the same sensing radius R and communication radius Rc. In this paper, the Boolean model is used as the node perception model and grid segmentation method. As long as the target is within the node perception range, it can be successfully perceived. Assuming that the coordinates of a monitored node zi are (xi, yi, zi) and the position coordinates of the target point dj are (xi, yi, zi), the distance between the node and the target point is
d ( z i , d j ) = ( x i y j ) 2 + ( y i y j ) 2 + ( z i z j ) 2
where P(zi, dj) represents the perceived quality of the node to the target node, as shown in (12). When the sensing probability is less than one, in order to improve the sensing quality of the target, multiple sensors are required to detect the target cooperatively, as shown in (13):
P ( z i , d j ) = { 1             d ( z i , d j ) R   0             o t h e r w i s e
P ( z i , d j ) = 1 - i = 1 N [ 1 P ( z i , d j ) ]
The coverage of the monitoring area is the ratio of the number of target points covered by all sensor nodes to the total number of target points in the area, which is defined as
S cov = x = 1 L y = 1 W P ( z i , d j ) × S A ( x 1 ) W + y S A a
Taking Equation (14) as the objective function to obtain the maximum value is optimal.

5.2. WSN Deployment on 3D Surface

Compared with the simple s in WSNs, the sensing radius R and communication radius Rc of the sensor nodes are kept as Rc = 2R. When deploying N homogeneous sensors in this area, the node set can be expressed as Z = {z1, z2, z3, …, zn}, which has the same sensing radius and communication radius Rc. In this paper, the Boolean model is used as the node perception model and grid segmentation method. As long as the target is within the node perception range, it can be successfully perceived. Assuming that the coordinates of the monitored node zi are (xi, yi, zi) and the position coordinates of the target point dj are (xi, yi, zi), the distance between the node and the target point can be determined.
Compared with the calculation of the surface area on the two-dimensional plane, the three-dimensional (3D) surface deployment is more complex and worthy of discussion. First, the three-dimensional undulating surface is not easy to divide equally. In order to solve this problem, a grid method is proposed (as shown in Figure 8): the 3D surface is vertically mapped to the 2D plane and the area is equally divided into a small grid, and the surface area is calculated by the approximate mapping between the two.
Equation (15) represents the surface equation, and the total area is obtained by dividing the curved area according to Equation (16):
z = f ( x , y )
S A = D x y 1 + ( d z d x ) 2 + ( d z d y ) 2 d x d y
This experiment assumes that the energy consumption of nodes is not considered when deploying nodes, which only needs to optimize the coverage area of the network. The more area the network covers, the more properly the nodes are developed. Therefore, the goal of this experiment is to find the maximum coverage.
The Boolean perception model cannot intuitively describe the whole process of deploying sensor networks on 3D surfaces. As shown in Figure 9, the solid curve represents the surface, and the dotted circle determines the sensing boundary. The monitoring points shown in the figure are all within the sensing range of node Z. The signal transmitted in a straight line will be blocked by the nearby hillside, resulting in the interruption of the sensing signal, which is generally called the perception blind spot. Mathematically, the position relationship is checked according to the number of intersection points between the linear equation and the surface equation. For example, the intersection points between the spatial line segment and the surface between the monitoring point B and the sensor node Z are only two, B and Z, indicating that B can be completely covered by Z. Then, the equations can be established to obtain the number of solutions. The simultaneous equations are as follows: Equation (17).
{ x x 1 x 2 x 1 = y y 1 y 2 y 1 = z z 1 z 2 z 1 z = f ( x , y )
In the instance of Z and C in the graph, the condition of coverage also needs to add a constraint. The midpoint of the line segment is in the inferior part of curve, which means that the monitoring points cannot be covered. The equation is shown in Equation (18):
P ( S , D ) = { 1                         i f ( x 3 , y 3 ) z 3 0                       otherwise
When deploying wireless sensors, network connectivity is also one of the basic requirements. In this experiment, in order to facilitate the calculation, the communication radius is set to be twice the sensing radius. As shown in the figure, the Euclidean distance between Z and A is less than the communication radius, and there is a slope blocking the signal between Z and A, so Z and A cannot communicate with each other. This phenomenon is similar to the perceptual blind spot.

5.3. Results and Discussion

In order to verify the applicability and reliability of the AMRFOCS algorithm when deploying 3D wireless sensor networks, two 3D surfaces with different complexities are deployed. At the same time, they are compared with four 3D deployment methods optimized by metaheuristic algorithms, namely MRFO in [18], GWO in [58], WOA in [16] and PSO in [59]. Considering the fairness of the comparison, the parameter setting refers to the literature in the same field: the population size is 50 and the maximum number of iterations is 300.
First, a simple saddle-shaped surface is shown in Equation (19). The curved surface is segmented according to the grid method in Section 5.2, and the number of nodes is set to 50. Secondly, the complex surface is shown in Equation (20). The sensing radius of the node is 1 m, and the communication radius is 2 m. Due to the increase in the surface complexity, the sensor node of the experiment is boosted to 100:
z = 1 x 2 y 2
z = sin ( x ) sin ( y )
Figure 10, Figure 11, Figure 12, Figure 13 and Figure 14 show the effect of the network coverage optimization of 50 sensor nodes under a simple surface. Figure 10 and Figure 11 show the effect of the initial random deployment of nodes and the optimized node deployment effect. The red dot is the position of the sensor. Initially, the uneven distribution of nodes can be seen from the figure. The optimized node deployment is more uniform, and the coverage area is larger. Figure 12 and Figure 13 are two-dimensional displays of the node distribution and coverage area. In the two-dimensional grid, the black hollow circle means the coverage area of the entire network deployment. The comparison between the initialization of Figure 12 and the optimized coverage area of Figure 13 shows that the effect of the optimized node distribution effect is significant, and the indicators are significantly enhanced. Figure 14 is the minimum spanning tree generated by the Kruskal algorithm mentioned in the network connectivity. Figure 15 is the line chart comparing the coverage of the WSN under network connectivity between the AMRFOCS algorithm and the four comparison algorithms. From the chart, it can be seen that the average coverage of the AMRFOCS optimization is 86.34%; the average coverage of MRFO is 72.63%; and the accuracy is improved by 14%, which is nearly 30% higher than the worst PSO. AMRFOCS has the optimal solution and the highest coverage. The convergence speed of AMRFOCS is also higher than that of the four comparison algorithms.
In order to compare the performance of the algorithm in terms of the network connectivity, Figure 14 and experimental data are combined. With 20 experimental tests and the same number of nodes, AMRFOCS has a higher connectivity and average coverage rate under network connectivity than the other deployment algorithms. AMRFOCS maintains the network connectivity of the WSN under different surfaces and nodes all along the network.
Figure 16, Figure 17, Figure 18, Figure 19 and Figure 20 describe the effect of the network coverage optimization of 100 sensor nodes under complex surfaces. Figure 16 and Figure 17 show the effect of the initial random deployment of the nodes and the deployment effect of the nodes optimized by AMRFOCS, respectively. Figure 18 and Figure 19 are two-dimensional displays of the node distribution and coverage area. In the two-dimensional grid, the black circle covers the size of the network deployment. The obvious comparison shows that the initial node distribution is uneven, the optimized node deployment is more uniform and the coverage area is wider. Figure 20 shows the connectivity of the entire network. Figure 21 is the line chart comparing the coverage of the WSN under network connectivity between the AMRFOCS algorithm and the four comparison algorithms including the original MRFO algorithm. The average coverage rate of the AMRFOCS optimization is 85.20%, while MRFO is 81.59%, the accuracy is improved by 4% and it is 17% higher than the worst-performing PSO. AMRFOCS maintains the optimal value and the maximum accuracy.
The similar images in Figure 15 and Figure 21 show the coverage comparison under network connectivity, while the difference is that the overall performance of connectivity and coverage in the deployment algorithm experiment decreased. The main reason is that the complex surface leads to the decrease in the optimization performance of the algorithm and quickly falls into the local optimal state. Comprehensive experiments show that AMRFOCS has good adaptability and it maintains high-quality deployment effects under simple or complex terrain conditions all along the network.

6. Conclusions and Future Work

In this paper, an improved Manta Ray Foraging Optimization algorithm (AMRFOCS) hybridized with a Cuckoo Search algorithm is proposed and applied to deploy sensor networks on 3D surfaces. The spiral foraging operator is optimized by combining the random walk of the cuckoo. On this basis, the ability of AMRFOCS to avoid a local optimum and achieve global optimization is effectively improved. In addition, a dynamic disturbance factor is introduced, which can change with the operating state. This strategy helps to coordinate the global search and balance the mining and exploration capabilities of the algorithm. The proposed algorithm is tested on CEC2017 and CEC2020 benchmark datasets. It is compared and tested by using different dimensions and other celebrated and newly developed algorithms. The results manifest that the enhanced algorithm has a superior convergence rate and solution precision. At the same time, through a nonparametric statistical analysis and Wilcoxon signed-rank test, AMRFOCS was found to have good stability and superiority in dealing with a series of experiments.
Simultaneously, AMRFOCS is applied to the network deployment of three-dimensional surfaces. Firstly, the surface area is determined by integration and mesh segmentation, and then the judgment method of the perceptual blind area is improved, so as to achieve the expected experimental results. The experimental results show that AMRFOCS improves the coverage of wireless sensor networks and ensures network connectivity during deployment.
In the next work, the practicality of AMRFOCS deployment on more complex surfaces needs to be further improved, and it can be extended to different application fields, such as image segmentation, feature selection, machine learning, electrical applications and other engineering fields.

Author Contributions

Conceptualization and methodology, Y.W. and Y.Z.; software, M.W.; writing—original draft preparation, M.W.; writing—review and editing, Y.Z. and Q.L.; funding acquisition, Y.Z. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the National Natural Science Foundation of China, grant No. U21A20464, 62066005.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Conflicts of Interest

The authors declare no conflict of interest.

References

  1. Kuila, P.; Jana, P.K. A novel differential evolution based clustering algorithm for wireless sensor networks. Appl. Soft Comput. 2014, 25, 414–425. [Google Scholar] [CrossRef]
  2. Almalki, K.J.; Jabbari, A.; Ayinala, K.; Sung, S.; Choi, B.-Y.; Song, S. ELSA: Energy-Efficient Linear Sensor Architecture for Smart City Applications. IEEE Sens. J. 2022, 22, 7074–7083. [Google Scholar] [CrossRef]
  3. Pu, Y.; Song, J.; Wu, M.; Xu, X.; Wu, W. Node location using cuckoo search algorithm with grouping and drift strategy for WSN. Phys. Commun. 2023, 59, 102088. [Google Scholar] [CrossRef]
  4. Amodu, O.A.; Bukar, U.A.; Mahmood, R.A.R.; Jarray, C.; Othman, M. Age of Information minimization in UAV-aided data collection for WSN and IoT applications: A systematic review. J. Netw. Comput. Appl. 2023, 216, 103652. [Google Scholar] [CrossRef]
  5. Zulfiqar, R.; Javid, T.; Ali, Z.A.; Uddin, V. Novel metaheuristic routing algorithm with optimized energy and enhanced coverage for WSNs. Ad Hoc Netw. 2023, 144, 103133. [Google Scholar] [CrossRef]
  6. Alam, S.M.N.; Haas, Z.J. Coverage and connectivity in three-dimensional networks with random node deployment. Ad Hoc Netw. 2015, 34, 157–169. [Google Scholar] [CrossRef]
  7. Nazarzehi, V.; Savkin, A.V. Decentralized control of mobile three-dimensional sensor networks for complete coverage self-deployment and forming specific shapes. In Proceedings of the 2015 IEEE Conference on Control Applications (CCA), Sydney, NSW, Australia, 21–23 September 2015; pp. 127–132. [Google Scholar] [CrossRef]
  8. Pacini, E.; Mateos, C.; Garino, C.G. Distributed job scheduling based on Swarm Intelligence: A survey. Comput. Electr. Eng. 2014, 40, 252–269. [Google Scholar] [CrossRef]
  9. Krause, J.; Cordeiro, J.; Parpinelli, R.S.; Lopes, H.S. A Survey of Swarm Algorithms Applied to Discrete Optimization Problems. Swarm Intell. Bio-Inspired Comput. 2013, 4, 169–191. [Google Scholar] [CrossRef]
  10. Kennedy’, J.; Eberhart, R. Particle Swarm Optimization. In Proceedings of the ICNN’95—International Conference on Neural Networks, Perth, WA, Australia, 27 November–1 December 1995; Volume 4, pp. 1942–1948. [Google Scholar]
  11. Dorigo, M.; Maniezzo, V.; Colorni, A. Ant system: Optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B Cybern. 1996, 26, 29–41. [Google Scholar] [CrossRef]
  12. Gandomi, A.H.; Yang, X.-S.; Alavi, A.H. Cuckoo search algorithm: A metaheuristic approach to solve structural optimization problems. Eng. Comput. 2013, 29, 17–35. [Google Scholar] [CrossRef]
  13. Karaboga, D. An Idea Based on Honey Bee Swarm for Numerical Optimization; Technical report-tr06; Erciyes University: Kayseri, Turkey, 2005. [Google Scholar]
  14. Mirjalili, S.; Mirjalili, S.M.; Lewis, A. Grey wolf optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef]
  15. Qi, X.; Zhu, Y.; Zhang, H. A new meta-heuristic butterfly-inspired algorithm. J. Comput. Sci. 2017, 23, 226–239. [Google Scholar] [CrossRef]
  16. Mirjalili, S.; Lewis, A. The whale optimization algorithm. Adv. Eng. Softw. 2016, 95, 51–67. [Google Scholar] [CrossRef]
  17. Heidari, A.A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  18. Zhao, W.; Zhang, Z.; Wang, L. Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications. Eng. Appl. Artif. Intell. 2020, 87, 103300. [Google Scholar] [CrossRef]
  19. Chou, J.S.; Truong, D.N. A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean. Appl. Math. Comput. 2021, 389, 125535. [Google Scholar] [CrossRef]
  20. Hashim, F.A.; Houssein, E.H.; Hussain, K.; Mabrouk, M.S.; Al-Atabany, W. Honey Badger Algorithm: New metaheuristic algorithm for solving optimization problems. Math. Comput. Simul. 2022, 192, 84–110. [Google Scholar] [CrossRef]
  21. Seyyedabbasi, A.; Kiani, F. Sand Cat swarm optimization: A nature-inspired algorithm to solve global optimization problems. Eng. Comput. 2022, 39, 2627–2651. [Google Scholar] [CrossRef]
  22. Zhao, S.; Zhang, T.; Ma, S.; Chen, M. Dandelion Optimizer: A nature-inspired metaheuristic algorithm for engineering applications. Eng. Appl. Artif. Intell. 2022, 114, 105075. [Google Scholar] [CrossRef]
  23. Dehghani, M.; Montazeri, Z.; Trojovská, E.; Trojovský, P. Coati Optimization Algorithm: A new bio-inspired metaheuristic algorithm for solving optimization problems. Knowl.-Based Syst. 2023, 259, 110011. [Google Scholar] [CrossRef]
  24. Azizi, M.; Talatahari, S.; Gandomi, A.H. Fire Hawk Optimizer: A novel metaheuristic algorithm. Artif. Intell. Rev. 2023, 56, 287–363. [Google Scholar] [CrossRef]
  25. Zhao, S.; Zhang, T.; Ma, S.; Wang, M. Sea-horse optimizer: A novel nature-inspired meta-heuristic for global optimization problems. Appl. Intell. 2023, 53, 11833–11860. [Google Scholar] [CrossRef]
  26. Hassan, M.H.; Houssein, E.H.; Mahdy, M.A.; Kamel, S. An improved Manta ray foraging optimizer for cost-effective emission dispatch problems. Eng. Appl. Artif. Intell. 2021, 100, 104155. [Google Scholar] [CrossRef]
  27. Asteris, P.G.; Mamou, A.; Ferentinou, M.; Tran, T.-T.; Zhou, J. Predicting clay compressibility using a novel Manta ray foraging optimization-based extreme learning machine model. Transp. Geotech. 2022, 37, 100861. [Google Scholar] [CrossRef]
  28. Elaziz, M.A.; Yousri, D.; Al-Qaness, M.A.; AbdelAty, A.M.; Radwan, A.G.; Ewees, A.A. A Grunwald–Letnikov based Manta ray foraging optimizer for global optimization and image segmentation. Eng. Appl. Artif. Intell. 2021, 98, 104105. [Google Scholar] [CrossRef]
  29. Houssein, E.H.; Zaki, G.N.; Diab, A.A.Z.; Younis, E.M. An efficient Manta Ray Foraging Optimization algorithm for parameter extraction of three-diode photovoltaic model. Comput. Electr. Eng. 2021, 94, 107304. [Google Scholar] [CrossRef]
  30. Kurni, M.; Mujeeb, S.M.; Yannam, B.B.; Singh, A. MRPO-Deep maxout: Manta ray political optimization based Deep maxout network for big data intrusion detection using spark architecture. Adv. Eng. Softw. 2022, 174, 103324. [Google Scholar] [CrossRef]
  31. Zouache, D.; Abdelaziz, F.B. Guided Manta Ray foraging optimization using epsilon dominance for multi-objective optimization in engineering design. Expert Syst. Appl. 2022, 189, 116126. [Google Scholar] [CrossRef]
  32. Ma, B.J.; Pereira, J.L.J.; Oliva, D.; Liu, S.; Kuo, Y.-H. Manta ray foraging optimizer-based image segmentation with a two-strategy enhancement. Knowl.-Based Syst. 2023, 262, 110247. [Google Scholar] [CrossRef]
  33. Zhang, X.-Y.; Hao, W.-K.; Wang, J.-S.; Zhu, J.-H.; Zhao, X.-R.; Zheng, Y. Manta ray foraging optimization algorithm with mathematical spiral foraging strategies for solving economic load dispatching problems in power systems. Alex. Eng. J. 2023, 70, 613–640. [Google Scholar] [CrossRef]
  34. Deepa, R.; Venkataraman, R. Enhancing Whale Optimization Algorithm with Levy Flight for coverage optimization in wireless sensor networks. Comput. Electr. Eng. 2021, 94, 107359. [Google Scholar] [CrossRef]
  35. Miao, Z.; Yuan, X.; Zhou, F.; Qiu, X.; Song, Y.; Chen, K. Grey wolf optimizer with an enhanced hierarchy and its application to the wireless sensor network coverage optimization problem. Appl. Soft Comput. 2020, 96, 106602. [Google Scholar] [CrossRef]
  36. Kokilavani, S.; Kumar, N.S. Modified squirrel search algorithm based data aggregation framework for improved network lifetime in wireless sensor network. Optik 2023, 281, 170468. [Google Scholar] [CrossRef]
  37. Barshandeh, S.; Koulaeizadeh, S.; Masdari, M.; AbdollahZadeh, B.; Ghasembaglou, M. A learning-based metaheuristic administered positioning model for 3D IoT networks. Appl. Soft Comput. 2023, 136, 110113. [Google Scholar] [CrossRef]
  38. Santhosh, G.; Prasad, K. Energy optimization routing for hierarchical cluster based WSN using artificial bee colony. Meas. Sens. 2023, 29, 100848. [Google Scholar] [CrossRef]
  39. Asha, A.; Arunachalam, R.; Poonguzhali, I.; Urooj, S.; Alelyani, S. Optimized RNN-based performance prediction of IoT and WSN-oriented smart city application using improved honey badger algorithm. Measurement 2023, 210, 112505. [Google Scholar] [CrossRef]
  40. Amutha, J.; Sharma, S.; Sharma, S.K. An energy efficient cluster based hybrid optimization algorithm with static sink and mobile sink node for Wireless Sensor Networks. Expert Syst. Appl. 2022, 203, 117334. [Google Scholar] [CrossRef]
  41. Yin, J.; Deng, N.; Zhang, J. Wireless Sensor Network coverage optimization based on Yin–Yang pigeon-inspired optimization algorithm for Internet of Things. Internet Things 2022, 19, 100546. [Google Scholar] [CrossRef]
  42. Eluri, R.K.; Devarakonda, N. Binary Golden Eagle Optimizer with Time-Varying Flight Length for feature selection. Knowl.-Based Syst. 2022, 247, 108771. [Google Scholar] [CrossRef]
  43. Sun, P.; Liu, H.; Zhang, Y.; Meng, Q.; Tu, L.; Zhao, J. An improved atom search optimization with dynamic opposite learning and heterogeneous comprehensive learning. Appl. Soft Comput. 2021, 103, 107140. [Google Scholar] [CrossRef]
  44. Hu, G.; Yang, R.; Qin, X.; Wei, G. MCSA: Multi-strategy boosted chameleon-inspired optimization algorithm for engineering applications. Comput. Methods Appl. Mech. Eng. 2023, 403, 115676. [Google Scholar] [CrossRef]
  45. Aydilek, I.B. A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Appl. Soft Comput. J. 2018, 66, 232–249. [Google Scholar] [CrossRef]
  46. Elaziz, M.A.; Lu, S.; He, S. A multi-leader whale optimization algorithm for global optimization and image segmentation. Expert Syst. Appl. 2021, 175, 114841. [Google Scholar] [CrossRef]
  47. 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]
  48. Awad, N.H.; Ali, M.Z.; Liang, J.J.; Qu, B.Y.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Bound Constrained Real-Parameter Numerical Optimization; Technical Report; Nanyang Technological University: Singapore, 2016. [Google Scholar]
  49. Yue, C.T.; Price, K.V.; Suganthan, P.N.; Liang, J.J.; Ali, M.Z.; Qu, B.Y.; Awad, N.H.; Partha, P. Biswas Problem Definitions and Evaluation Criteria for the CEC 2020 Special Session and Competition on Single Objective Bound Constrained Numerical Optimization; Technical Report, Computational Intelligence Laboratory, Zhengzhou University, Zhengzhou China and Technical Report; Nanyang Technological University: Singapore; Glasgow, UK, 2020. [Google Scholar]
  50. Yousri, D.; Elaziz, M.A.; Oliva, D.; Abraham, A.; Alotaibi, M.A.; Hossain, A. Fractional-order comprehensive learning marine predators algorithm for global optimization and feature selection. Knowl.-Based Syst. 2022, 235, 107603. [Google Scholar] [CrossRef]
  51. Li, S.; Chen, H.; Wang, M.; Heidari, A.A.; Mirjalili, S. Slime mould algorithm: A new method for stochastic optimization. Future Gener. Comput. Syst. 2020, 111, 300–323. [Google Scholar] [CrossRef]
  52. Mostafa, R.R.; Ewees, A.A.; Ghoniem, R.M.; Abualigah, L.; Hashim, F.A. Hashim Boosting chameleon swarm algorithm with consumption AEO operator for global optimization and feature selection. Knowl.-Based Syst. 2022, 246, 108743. [Google Scholar] [CrossRef]
  53. Cao, Z.; Li, J.; Fu, Y.; Wang, Z.; Jia, H.; Tian, F. An adaptive biogeography-based optimization with cumulative covariance matrix for rule-based network intrusion detection. Swarm Evol. Comput. 2022, 75, 101199. [Google Scholar] [CrossRef]
  54. Yousri, D.; AbdelAty, A.M.; Al-Qaness, M.A.; Ewees, A.A.; Radwan, A.G.; Elaziz, M.A. Discrete fractional-order Caputo method to overcome trapping in local optima: Manta Ray Foraging Optimizer as a case study. Expert Syst. Appl. 2022, 192, 116355. [Google Scholar] [CrossRef]
  55. Gao, M.; Pan, J.-S.; Li, J.-P.; Zhang, Z.-P.; Chai, Q.-W. 3-D Terrains Deployment of Wireless Sensors Network by Utilizing Parallel Gases Brownian Motion Optimization. J. Internet Technol. 2021, 22, 13–29. [Google Scholar]
  56. Ru, J.; Jia, Z.; Yang, Y.; Yu, X.; Wu, C.; Xu, M. A 3D Coverage Algorithm Based on Complex Surfaces for UAVs in Wireless Multimedia Sensor Networks. Sensors 2019, 19, 1902. [Google Scholar] [CrossRef] [PubMed]
  57. Wang, Z.; Xie, H.; He, D.; Chan, S. Wireless Sensor Network Deployment Optimization Based on Two Flower Pollination Algorithms. IEEE Access 2019, 7, 180590–180608. [Google Scholar] [CrossRef]
  58. Wang, Z.; Xie, H. Wireless Sensor Network Deployment of 3D Surface Based on Enhanced Grey Wolf Optimizer. IEEE Access 2020, 8, 57229–57251. [Google Scholar] [CrossRef]
  59. Hang, Z.Y.; Xunbo, L.; Zhenlin, W.; Wenjie, Y.; Bo, H. A Novel Sensor Deployment Method Based on Image Processing and Wavelet Transform to Optimize the Surface Coverage in WSNs. Chin. J. Electron. 2016, 25, 8. [Google Scholar]
Figure 1. Variation in M value with different values of parameter ω .
Figure 1. Variation in M value with different values of parameter ω .
Biomimetics 08 00411 g001
Figure 2. Flowchart of proposed AMRFOCS method.
Figure 2. Flowchart of proposed AMRFOCS method.
Biomimetics 08 00411 g002
Figure 3. Mean convergence curves for AMRFOCS against other counterparts—CEC2017 benchmarks D = 30. (a) Convergence curve of F1. (b) Convergence curve of F3. (c) Convergence curve of F4. (d) Convergence curve of F11. (e) Convergence curve of F12. (f) Convergence curve of F16. (g) Convergence curve of F7. (h) Convergence curve of F20. (i) Convergence curve of F24. (j) Convergence curve of F25. (k) Convergence curve of F29. (l) Convergence curve of F30.
Figure 3. Mean convergence curves for AMRFOCS against other counterparts—CEC2017 benchmarks D = 30. (a) Convergence curve of F1. (b) Convergence curve of F3. (c) Convergence curve of F4. (d) Convergence curve of F11. (e) Convergence curve of F12. (f) Convergence curve of F16. (g) Convergence curve of F7. (h) Convergence curve of F20. (i) Convergence curve of F24. (j) Convergence curve of F25. (k) Convergence curve of F29. (l) Convergence curve of F30.
Biomimetics 08 00411 g003aBiomimetics 08 00411 g003b
Figure 4. Mean convergence curves for AMRFOCS against other counterparts—CEC2017 benchmarks D = 50. (a) Convergence curve of F1. (b) Convergence curve of F10. (c) Convergence curve of F13. (d) Convergence curve of F17. (e) Convergence curve of F20. (f) Convergence curve of F29.
Figure 4. Mean convergence curves for AMRFOCS against other counterparts—CEC2017 benchmarks D = 50. (a) Convergence curve of F1. (b) Convergence curve of F10. (c) Convergence curve of F13. (d) Convergence curve of F17. (e) Convergence curve of F20. (f) Convergence curve of F29.
Biomimetics 08 00411 g004
Figure 5. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 10. (a) Convergence curve of F4. (b) Convergence curve of F5. (c) Convergence curve of F6. (d) Convergence curve of F7. (e) Convergence curve of F8. (f) Convergence curve of F9.
Figure 5. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 10. (a) Convergence curve of F4. (b) Convergence curve of F5. (c) Convergence curve of F6. (d) Convergence curve of F7. (e) Convergence curve of F8. (f) Convergence curve of F9.
Biomimetics 08 00411 g005aBiomimetics 08 00411 g005b
Figure 6. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 15. (a) Convergence curve of F1. (b) Convergence curve of F4. (c) Convergence curve of F5. (d) Convergence curve of F6. (e) Convergence curve of F7. (f) Convergence curve of F8. (g) Convergence curve of F9. (h) Convergence curve of F10.
Figure 6. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 15. (a) Convergence curve of F1. (b) Convergence curve of F4. (c) Convergence curve of F5. (d) Convergence curve of F6. (e) Convergence curve of F7. (f) Convergence curve of F8. (g) Convergence curve of F9. (h) Convergence curve of F10.
Biomimetics 08 00411 g006aBiomimetics 08 00411 g006bBiomimetics 08 00411 g006c
Figure 7. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 20. (a) Convergence curve of F1. (b) Convergence curve of F4. (c) Convergence curve of F5. (d) Convergence curve of F7. (e) Convergence curve of F8. (f) Convergence curve of F9.
Figure 7. Mean convergence curves for AMRFOCS against other counterparts—CEC2020 benchmarks D = 20. (a) Convergence curve of F1. (b) Convergence curve of F4. (c) Convergence curve of F5. (d) Convergence curve of F7. (e) Convergence curve of F8. (f) Convergence curve of F9.
Biomimetics 08 00411 g007
Figure 8. The schematic diagram of grid method (3D surface is vertically mapped to 2D plane).
Figure 8. The schematic diagram of grid method (3D surface is vertically mapped to 2D plane).
Biomimetics 08 00411 g008
Figure 9. The schematic diagram of sensing blind area in the process of deploying nodes.
Figure 9. The schematic diagram of sensing blind area in the process of deploying nodes.
Biomimetics 08 00411 g009
Figure 10. Initial nodes deployment diagram for a simple saddle-shaped surface.
Figure 10. Initial nodes deployment diagram for a simple saddle-shaped surface.
Biomimetics 08 00411 g010
Figure 11. Optimized nodes deployment diagram for a simple saddle-shaped surface.
Figure 11. Optimized nodes deployment diagram for a simple saddle-shaped surface.
Biomimetics 08 00411 g011
Figure 12. 2D viewgraph of initial deployment for a simple saddle-shaped surface.
Figure 12. 2D viewgraph of initial deployment for a simple saddle-shaped surface.
Biomimetics 08 00411 g012
Figure 13. 2D viewgraph of optimized deployment for a simple saddle-shaped surface.
Figure 13. 2D viewgraph of optimized deployment for a simple saddle-shaped surface.
Biomimetics 08 00411 g013
Figure 14. Network connectivity diagram for a simple saddle-shaped surface.
Figure 14. Network connectivity diagram for a simple saddle-shaped surface.
Biomimetics 08 00411 g014
Figure 15. Coverage optimization iterative curve for a simple saddle-shaped surface.
Figure 15. Coverage optimization iterative curve for a simple saddle-shaped surface.
Biomimetics 08 00411 g015
Figure 16. Initial nodes deployment diagram for a complex surface.
Figure 16. Initial nodes deployment diagram for a complex surface.
Biomimetics 08 00411 g016
Figure 17. Optimized nodes deployment diagram for a complex surface.
Figure 17. Optimized nodes deployment diagram for a complex surface.
Biomimetics 08 00411 g017
Figure 18. 2D viewgraph of initial deployment for a complex surface.
Figure 18. 2D viewgraph of initial deployment for a complex surface.
Biomimetics 08 00411 g018
Figure 19. 2D viewgraph of optimized deployment for a complex surface.
Figure 19. 2D viewgraph of optimized deployment for a complex surface.
Biomimetics 08 00411 g019
Figure 20. Network connectivity diagram for a complex surface.
Figure 20. Network connectivity diagram for a complex surface.
Biomimetics 08 00411 g020
Figure 21. Coverage optimization iterative curve for a complex surface.
Figure 21. Coverage optimization iterative curve for a complex surface.
Biomimetics 08 00411 g021
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Wang, M.; Luo, Q.; Wei, Y.; Zhou, Y. Hybrid Manta Ray Foraging Algorithm with Cuckoo Search for Global Optimization and Three-Dimensional Wireless Sensor Network Deployment Problem. Biomimetics 2023, 8, 411. https://doi.org/10.3390/biomimetics8050411

AMA Style

Wang M, Luo Q, Wei Y, Zhou Y. Hybrid Manta Ray Foraging Algorithm with Cuckoo Search for Global Optimization and Three-Dimensional Wireless Sensor Network Deployment Problem. Biomimetics. 2023; 8(5):411. https://doi.org/10.3390/biomimetics8050411

Chicago/Turabian Style

Wang, Meiyan, Qifang Luo, Yuanfei Wei, and Yongquan Zhou. 2023. "Hybrid Manta Ray Foraging Algorithm with Cuckoo Search for Global Optimization and Three-Dimensional Wireless Sensor Network Deployment Problem" Biomimetics 8, no. 5: 411. https://doi.org/10.3390/biomimetics8050411

APA Style

Wang, M., Luo, Q., Wei, Y., & Zhou, Y. (2023). Hybrid Manta Ray Foraging Algorithm with Cuckoo Search for Global Optimization and Three-Dimensional Wireless Sensor Network Deployment Problem. Biomimetics, 8(5), 411. https://doi.org/10.3390/biomimetics8050411

Article Metrics

Back to TopTop