Skip to main content
Entropy logoLink to Entropy
. 2021 Jul 29;23(8):977. doi: 10.3390/e23080977

Exploration and Exploitation Zones in a Minimalist Swarm Optimiser

Mohammad Majid al-Rifaie 1
Editors: Giulia De Masi1, Eliseo Ferrante1
PMCID: PMC8392784  PMID: 34441117

Abstract

The trade off between exploration and exploitation is one of the key challenges in evolutionary and swarm optimisers which are led by guided and stochastic search. This work investigates the exploration and exploitation balance in a minimalist swarm optimiser in order to offer insights into the population’s behaviour. The minimalist and vector-stripped nature of the algorithm—dispersive flies optimisation or DFO—reduces the challenges of understanding particles’ oscillation around constantly changing centres, their influence on one another, and their trajectory. The aim is to examine the population’s dimensional behaviour in each iteration and each defined exploration-exploitation zone, and to subsequently offer improvements to the working of the optimiser. The derived variants, titled unified DFO or uDFO, are successfully applied to an extensive set of test functions, as well as high-dimensional tomographic reconstruction, which is an important inverse problem in medical and industrial imaging.

Keywords: exploration, exploitation, diversity, zone analysis, dispersive flies optimisation, DFO

1. Introduction

Information exchange and communication between particles in swarm intelligence manifest themselves in a variety of forms, including the use of different update equations and strategies; deploying extra vectors in addition to the particles’ current positions; and dealing with tunable parameters. Ultimately, the goal of the optimisers is to achieve a balance between global exploration of the search space and local exploitation of potentially suitable areas in order to guide the optimisation process [1,2].

The motivation for studying dispersive flies optimisation, or DFO [3], is the algorithm’s minimalist update equation and its sole reliance on particles’ positions at time t to generate the positions at time t+1, therefore not using additional vectors. This characteristic [4] is in contrast to several other population-based algorithms and their variants which, besides using position vectors, use a subset of the following: velocities and memories (personal best and global best) in particle swarm optimisation (PSO) [5], mutant and trial vectors in differential evolution (DE) [6], pheromone and heuristic vectors in Ant Colony Optimisation (ACO) [7], and so forth. Besides only using position vectors in any given iteration (similar to some evolution strategies, such as CMA-ES [8]), the only tunable parameter in DFO, other than population size, is the restart threshold, Δ, which controls the component-wise restart in each dimension. This is again contrary to many well-known swarm and evolutionary algorithms dealing with several (theoretically- or empirically-driven) tunable parameters, such as: learning factors, inertia weight in PSO, crossover or mutation rates, tournament and elite sizes, constricting factor in DE and/or Genetic Algorithms (GA) [9], heuristic strength, greediness, pheromone decay rate in ACO, impact of distance on attractiveness, scaling factor and speed of convergence in Firefly algorithm (FF) [10], and so on. It is worthwhile to note that DFO is not the only minimalist algorithm, and there have been several attempts to present ‘simpler’, more compact algorithms to better understand the dynamic of population’s behaviour, as well as the significance of various communication strategies, but often still with more vectors and parameters, and often at the expense of performance. Perhaps one of the most notable minimalist swarm algorithm is barebones particle swarms [11]. Another barebones algorithm is barebones differential evolution [12], which is a hybrid of the barebones particle swarm optimiser and differential evolution, aiming to reduce the number of parameters, albeit with more than only the position vector. It is well understood that swarm intelligence techniques are dependant on the tuning of their parameters. This ultimately results in the need to adjust a growing number of parameters which becomes increasingly complex.

This paper aims at identifying and investigating knowledge-based exploration and exploitation zones in a minimalist, vector-stripped algorithm; therefore, using the analysis to propose ways to measure exploration and exploitation probabilities, with the ultimate goal of controlling the behaviour of the population by suggesting dimensionally-dependent exploration-exploitation balance without degrading the algorithm performance. Furthermore, the paper highlights the limitations and challenges of the proposed methods, which are also applied to tomographic reconstruction, where images are reconstructed using tomography.

In this work, the swarm optimiser is first presented in Section 2, followed by the analysis in Section 3, which subsequently leads to proposing adaptable exploration-exploitation mechanisms. Finally, in Section 4, the experiment results on a comprehensive set of benchmarks are presented.

2. Background

Dispersive flies optimisation (DFO) belongs to the broad family of population-based, swarm intelligence optimisers, which has been applied to various areas, including medical imaging [13], solving diophantine equations [14], PID speed control of DC motor [15], optimising machine learning algorithms [16], training deep neural networks [17], computer vision and quantifying symmetrical complexities [18,19], beer organoleptic optimisation [20], and analysis of autopoiesis in computational creativity [21].

In this algorithm, components of the position vectors are independently updated in each iteration, taking into account: the current particle’s position; the current particle’s best neighbouring individual (consider ring topology, where particles have left and right neighbours); and the best particle in the swarm. The update equation is

xidt+1=xindt+u(xsdtxidt), (1)

where

  • xidt: position of ith particle in dth dimension at time step t;

  • xindt: position of xit’s best neighbouring individual (in ring topology) in dth dimension at time step t;

  • xsdt: position of the swarm’s best individual in the dth dimension at time step t;

  • uU0,1: generated afresh for each individual and each dimension update.

As a diversity-promotion mechanism, individual components of the population’s position vectors are reset if a random number generated from a uniform distribution on the unit interval U0,1 is less than the disturbance or restart threshold, Δ. This ensures a restart to the otherwise permanent stagnation over a likely local minima. In this method, which is summarised in Algorithm 1, each member of the population is assumed to have two neighbours (i.e., ring topology) and particles are not clamped to bounds, therefore, when out-of-bounds, are left unevaluated. The source code for standard DFO is available on http://github.com/mohmaj/DFO, accessed on 26 July 2021.

Algorithm 1 Dispersive flies optimisation (DFO)
graphic file with name entropy-23-00977-i001.jpg

As a population-based continuous optimiser, DFO bears several similarities with other swarm and evolutionary algorithms. Stemming from its barebones and vector-stripped nature, DFO allows for further analysis while demonstrating competitive performance, despite being bare of “accessories”. As stated, DFO’s update mechanism relies solely on the position vectors at time t to produce the position vectors for time t+1, without storing extra vectors, and, in terms of tunable parameters, other than population size, DFO uses one extra parameter for adjusting the global diversity of the population. To provide more context and before the analysis, a number of well-known algorithms, along with their tunable (and/or theoretically-driven) parameters, are provided.

For instance, PSO, in many of the proposed variants, commonly uses the following parameters: population size; c1, controlling the impact of cognitive component; c2, controlling the impact of social component; χ or w, depending on the update equation. In addition to the position of particle i, xi, each particle has an associated velocity, vi, and memory, pi, vectors. Other variants of PSO, including barebone PSOs were also introduced to simplify the algorithm, with the ultimate goal of offering insight into the algorithm’s underlying behaviour. In one such case, one of the inventor of PSO, Kennedy, describes the process as “strip[ping] away some traditional features” with the hope of revealing the mysteries of the algorithm [11]. In this particular model, the velocity vectors are removed, while the algorithm still benefits from having memories, a work that was carried out to shed light on the behaviour of the algorithm. Other contributions have tried to further explore the simplified version and enhance its performance, demonstrating the capability of the simplified version in contrast with the original models [22,23,24,25].

Other than PSO, parameters and adjustable configurations of other well-known algorithms include those of GAs [9]: population size, pc: crossover rate, pm: mutation rate, tournament size, elite size; DE [6,26]: population size, pc: crossover rate, equations used to calculate the mutation vector (e.g., the most notable ones are: DE/rand/1, DE/rand-to-best/1, DE/best/1, DE/best/2, DE/rand/2), F: constricting factor; ACO [7]: m: number of ants (population size), β: heuristic strength, α: greediness, ρ: pheromone decay rate; Firefly algorithm or FA [10]: population size, m: impact of distance on attractiveness, α which could be replaced with αSk in cases where scales vary significantly in different dimensions, d. Thus, given d dimensions (k=1,,d), adding d extra parameters, γ determining the speed of convergence, in theory, γ[0,), with γ=0 maintaining a constant attractiveness of β=β0.

Looking at the update equations of DFO, PSO and DE’s mutant vector (DE1: DE/rand-to-best/1 and DE2: DE/best/1), certain similarities can be identified:

PSO:vidt+1=wvidt+c1r1pidxidt+c2r2gdxidt (2)
:xidt+1=vidt+1+xidt (3)
:xidt+1=fPSO(vidt+1,pid,gd,xidt), (4)
DE1:vidt+1=xidt+Fxbest,dtxidt+Fxr1dtxr2dt: (5)
:xidt+1=fDE1(vidt+1,uidt+1,xdt), (6)
DE2:vidt+1=xbest,dt+Fxr1dtxr2dt: (7)
:xidt+1=fDE2(vidt+1,uidt+1,xdt), (8)
DFO:xidt+1=xindt+u(xsdtxidt) (9)
:xidt+1=fDFO(xdt), (10)

where, for PSO, w is the inertia weight whose optimal value is problem dependent [27]; vidt is the velocity of particle i in dimension d at time step t; c1,2 are the learning factors (also referred to as acceleration constants) for personal best and neighbourhood best, respectively; r1,2 are random numbers adding stochasticity to the algorithm, and they are drawn from a uniform distribution on the unit interval U0,1; pid is the personal best position of particle xi in dimension d; gd is swarm best at dimension d; and fPSO takes as input the variables needed at time t in order to return the particle’s component’s position at time t+1. For DE’s mutant vector (DE1: DE/rand-to-best/1 and DE2: DE/best/1), vid is dth gene of the ith chromosomes’s mutant vector (v in PSO and DE are different, albeit they carry the same name in the literature); uid is dth gene of the ith chromosomes’s trial vector; r1 and r2 are different from i and are distinct random integers drawn from the range 1,N; and xbest,dt is the dth gene of the best chromosome at generation t; F is a positive control parameter for constricting the difference vectors.

In these update equations, similarities between PSO’s Equations (2)–(4) and DE1’s Equations (5) and (6) can be observed, including current and best positions, and the use of extra components to steer the update process (e.g., in PSO: velocity, v, and memories, p; and in DE1: mutant vector, v, and trial vector, u), as shown in Equations (4) and (6).

On the other hand, there are similarities between DE2 (DE/best/1) and DFO, as shown in Equations (7)–(10). In their update equations, the focus (xbest,d and xind) is either the best chromosome in the population or the best neighbouring particle, and the spread is determined by taking into account two members of the population: in DE2’s instance, it uses the distances between two random chromosomes, and, in DFO’s case, the distance between the best particle and the current particle’s positions is calculated; both of these distances are then “controlled” (i.e., by F in DE2, and by u=U(0,1) in DFO). Furthermore, DFO’s use of evolutionary phases (i.e., mutation, crossover, and selection) can be demonstrated in the restart mechanism, update equation, and the elitism strategy, respectively, where particles’ current positions determine their next positions, i.e., Xt+1=fDFO(Xt), with X being a 2D matrix of particles positions.

Therefore, following on the above and to quote Kennedy [11]: “The particle swarm algorithm has just enough moving parts to make it hard to understand”, and this work builds on of its key motivation to analyse a minimalistic algorithm to:

  • reduce the challenges of understanding particles oscillating around the constantly changing centres (in each iteration, independently),

  • understand particles’ influence on one another (and their contribution to the swarm’s next iteration), and

  • strip the parameters in the analysis to understand the trajectory of particles (moving between different regions in the feasible search space).

To address these challenges, the minimalist, vector-stripped features of the optimiser are used to provide an analysis of the population’s exploration-exploitation behaviour.

3. Exploration-Exploitation Zones Analysis

As shown in the update equation, Equation (1), for each particle, the search focus is μ=xin, and the spread, σ=xsxi, is the distance between the best particle in the swarm and the current particle. Therefore, the equation could be rewritten for each particle’s dimension as

x=μ+uσ. (11)

The spatial location of particles and their proximity to the global optimum of a given function, informs the role played by μ and σ. Considering one dimension of a problem and for ease of read in the remaining of this section, x refers to xit; x refers to xit+1; g refers to xst; and n refers to xint. Furthermore, exploitation refer to the approaching of x to g (i.e., |gx|<|gx|). By the same token, exploration refers to the increasing distance between x and g (i.e., |gx|>|gx|). This section presents the unified exploration-exploitation analysis where a number of zones are identified, and their roles in terms of exploration and exploitation are investigated and ultimately measured.

Consider x is to be uniform in [L,R], while g and n are fixed. Given this, the areas highlighting exploitation can be plotted using A and B below:

g=0,n=1,A:u=11|x|,B:u=1x1.

To proceed, and as shown in Figure 1, the exploitation probabilities in the following four cases are presented individually:

  1. R,L1,

  2. R=L=1,

  3. L[0,1],R12,1,

  4. L[0,1],R0,12.

R,L1:P(exploit)=L+R1log2LL+RputL=R=xP(exploit)=2x1log2x2xlimxP(exploit)=limx112xlog2x2x=1R=L=1:P(exploit)=1log22L[0,1],R12,1:P(exploit)=2R1log2RL+RL[0,1],R0,12:P(exploit)=0.

Figure 1.

Figure 1

Unified exploitation probability, P(exploit) or p. The shaded areas in the graph represent exploitation, where particles in these areas at time t will be exploiting at time t+1.

The exploitation probability for instances when R=L=1 is derived from the first case (i.e., R,L1); the probability confirms the findings in the scenario-based analysis presented in Appendix A.1 for scenario 1 (see S1 in Figure 1 or Figure A2), where x is between g and n (x[0,1]). This illustrates the link between the unified and the scenario-based analyses. The scenario-based analysis can be found in Appendix A, where the three scenarios, S1, S2, S3 are examined. Furthermore, the scenario-based analysis assumes a start from the initial state and is based on the position of x in relation to n and g. While the scenario-based analysis is independent of the feasible bounds to the search space, this aspect is taken into account in the unified exploitation analysis.

Based on the analysis, for {xR:LxR} and given the tendency of L,R1 in the scaled space (influenced by the proximity of g and n over time), the unified exploitation probability, P(exploit) or p, is summarised as:

p=P(exploit)=P(|xg|<|xg|)=L+R1log2LL+R. (12)

3.1. Self-Adaptive Variants

Based on the analysis, an immediate line of research is to measure the iteration-based, dimensional probabilities of exploitation (p) to facilitate diversity adjustment. The dimensional diversity mechanism can be facilitated through an adaptable restart threshold, Δdynamic (as opposed to a pre-determined parameter value, Δ).

3.1.1. Unified DFO (uDFO)

In one such approach, the unified exploitation probability, p, is measured for each dimension and in each iteration. Using p, the component-wise restart is triggered when r<Δdynamic, where r=U(0,1), and Δdynamic controls the restart mechanism dynamically. In order to take into account the previously reported empirical restart threshold of Δ=0.001 [3], in one set of experiments, Δdynamic is set to 1/1000p, where Δdynamic=Δ when p=1, or higher when p<1. This approach has similarities with standard DFO at the high end of p. Alternatively, in the second approach, Δdynamic=1/1500p, where the previously derived empirical restart threshold is reached when p=0.6¯, and higher when p<0.6¯ (see Figure 2).

Figure 2.

Figure 2

Component-wise restart threshold, based on p, with Δdynamic={1/1000p,1/1500p}. The restart threshold of the original DFO (Δ=0.001) is illustrated in black.

The adapted versions of the algorithm, which benefit from the unified exploitation probability, are termed unified DFO or uDFO. Using the proposed methods enabled the adaptive, dimension-dependant diversity to be present throughout the optimisation process, and it was reduced when the population is more inclined towards exploitation, be it local or global.

To demonstrate the evident effect of individual’s restart on p over the iterations, a sample run of DFO with Δ=0 is illustrated in Figure 3; here, the behaviour of p is visualised during the optimisation process of Rastrigin function where the restart mechanism is triggered when the dimensional average of p>{0.90,0.95}. As shown in the bottom graphs, the black circles, which represent p’s average over the dimensions, increase until reaching 0.90 (on the left graph) or 0.95 (on the right graph), when the restart mechanism is triggered. As the graph on the right shows, the average p is allowed to increase higher before the restart mechanism is activated. The impact of p on diversity can be observed in the top graphs.

Figure 3.

Figure 3

Relation between exploitation probability, p, and diversity. This figure illustrates the commencing of the restart mechanism when the dimensional average of p>{0.90,0.95}. In the bottom graphs, μ and σ represent p’s average and standard deviation in each iteration. As shown, increased diversity, which is the average distance around the population centre (see top graphs), decreases the p values (see bottom graphs), and vice versa.

3.1.2. Unified DFO with Zone-Relocation (uDFOz5)

Figure 1 highlights the exploration and exploitation-related, scaled zone borderlines at x{L,1,0,0.5,1,R}, and, based on that, the search space is categorised into 5 zones (z15). Using the zones provides a fitting way to investigate the behaviour of the individuals in the context of the unified exploitation probabilities, as well as particle trajectories. In these zones, z2,3 are explore-only, z5 is exploit-only, and z1,4 influence both exploration and exploitation. In other words, zones impacting exploration are z14, and zones impacting exploitation are z1,4,5. Figure 4 illustrates the visit-frequency of particle components in each zone over the iterations, highlighting the most visited zone, z5, and the least visited one, z3.

Figure 4.

Figure 4

Particle component’s visit-frequency in each zone. These figures illustrate the number of particle components in each zone over the iterations in two representative sample runs, optimising (a) Sphere function, which is a unimodal problem, and (b) Rastrigin function, as a multimodal problem. This illustrates that, irrespective of the modality and the landscapes of the functions, z5 is the most frequently visited zone, and z3 is the least visited one.

Additionally, having these properties, investigating the state transitions from one zone at time t (xt) to the next at time t+1 (xt+1) provides each particle’s dimensional trajectory, which is illustrated in Figure 5 and summarised below:

  • xtz1xt+1z5

  • xtz2xt+1[1,2]z5,

  • xtz3xt+1z4,

  • xtz4xt+1{z3,z4},

  • xtz5xt+1{z1,z2,z3,z4}.

Figure 5.

Figure 5

State transition between zones. This figure shows the state transition of components between zones. Transitions from z5 are highlighted in red, as dashed lines.

Following on the state transition, in order to show the trajectory density for each of these transitions, 1,000,000 component updates are initiated from each of the zones with L,R=4. The density plots from different zones are shown in Figure 6; for instance, the top of Figure 6 illustrates the transition of components from z1 to z5 with higher density of components near n. In addition to presenting the density plot for each individual zone, the bottom of Figure 6 shows the trajectory density of the independent updates across all zones, illustrating the densest area, which is in line with the search focus being n.

Figure 6.

Figure 6

Density plots for transition trajectory of 1 million independent components from each of the zones at time t (shaded) to t+1 in one-step updates. The dashed lines represent zones boundaries. The x-axes represent the scaled positions in range [L,R] with L,R=4, g=0, n=1, and the y-axes illustrate the trajectory density. For instance, the top graph shows the trajectory density of xt values in z1 which are originated from range [4,1] at time t, and trajected to [1,4] at time t+1. The bottom graph presents the density plot across all zones, highlighting the focus as μ=n. Note that the number of components initialised in each zone is equal.

State transition analysis allows for devising a strategy to control diversity through particle position’s zone-relocation. Observing the density plot for z5 in Figure 6 or the state transition from z5 in Figure 5, it is evident that particles in z5 at time t will be relocated to z14 at time t+1, a unique disseminating possibility only available to components in z5.

To better understand each zone’s coverage, the behaviour of the optimiser is investigated in a single dimension of a particle when optimising a unimodal function (Sphere) and a multimodal function (Rastrigin). The plots in Figure 7 illustrate the area covered by each zone. It is shown that z1,5 cover the widest range (irrespectively of the problem’s modality), and, as evidenced in Figure 1, z2’s coverage area is equal in size to the area covered by z3,4. The intuition that the distance between g and n reduces over time is clearly illustrated in Figure 7b, as manifested by shrinking of areas covered by z2,3,4; and, as shown in Figure 7a, the more occasional higher increase of distance between g and n indicates the identification of a new local optimum (caused by a larger jump which momentarily reduces the coverage of z1,5 and increases the coverage of z2,3,4).

Figure 7.

Figure 7

Zones coverage in Sphere (top), and Rastrigin (bottom) functions. The plots in this figure show the coverage of each zone in each iteration. (a) highlights larger updates in the location of g or n throughout the optimisation process, this is because the coverage ranges of z2,3,4 indicate updates in the position of g or n, while (b), which uses the logarithmic scale for the y-axis, is used to illustrate the continuous smaller updates in the position of g or n. The error values at the end of iteration 500 are 2.12×1015 and 1.73×106 respectively.

Given the state transition analysis and the zone coverage for z5, another experiment is proposed so that, when the restart mechanism is triggered with r<Δdynamic, components are relocated to z5. The Δdynamic will be chosen between the better performing algorithm from Δdynamic={1/1000p,1/1500p}. Using this strategy, components are effectively restarted to the exploit-only zone. As a result, while expecting lower diversity, the purpose of zone-relocation experiment is to examine the impact of ‘targeted’ restarts, with potential follow-up exploitation and visits to other zones. The adapted algorithm using the proposed zone-relocation strategy is termed uDFOz5.

4. Experiments and Results

This experiments reported in this section examine the results of the exploitation study over a comprehensive benchmark [28], which consists of the functions presented in various sources [29,30,31]. The combined benchmark, CEC05 + CEC13 + ENG13, provides 84 unique problems whose details are presented in Reference [28] and are summarised in Table A1. The benchmark includes functions with the following properties: U: unimodal, M: multimodal, S: separable, NS: non-separable, N: noisy, B: x* on bounds (where x* is the optimum), NV: x* in narrow valley, UB: x* outside initialisation volume, F: neutrality (has flat areas), HC: high conditioning, SD: sensitivity (f has one or more sensitive directions), A: asymmetric, D: deceptive (x* is far from next local optimum), and C: composition.

In this section, uDFO with Δdynamic={1/1000p,1/1500p} and uDFOz5 are compared against the standard DFO (with Δ=0.001) and DFOΔ=0 (i.e., without the restart mechanism), where the population size is NDFO=150. Furthermore, given PSO’s structural similarity to DFO (as outlined in Section 2 and belonging to swarm intelligence family), standard PSO algorithm in two neighbourhood structures, global PSO (GPSO) and local PSO (LPSO), are also used where the population size, NPSO=30, ω=0.729844, c=1.49618, and the initial v=0 [31]. Furthermore, DE (DE/best/1) is also used in the experiments, where the population size, NDE=30 with F, CR =0.5 [32]. Each algorithm is run 50 times on each test function, and the termination criterion is set to reaching 150,000 function evaluations. The problems’ dimensionality is constant in all trials and is set to D=30.

The metrics used to evaluate the results are error: best function value and proximity to known optimal values; and population’s terminal diversity: mean distance between individuals and centroid (in PSO, the memory or personal best vectors are used, as opposed to DFOs and DE, where particles positions are used). This measure illustrates the variants’ impact on the population’s diversity to investigate its presence among the population in order to facilitate exploration without hindering the population’s ability to exploit potential optimal solutions. In other words, diversity, alongside the error metric, provides an insight into the inner dynamics of the algorithms.

In total, 33,600 trials (8 algorithms × 84 test functions × 50 runs) are analysed by grouping them in terms of functions and function properties. To analyse the performance of the algorithms over the test functions, Wilcoxon [33] non-parametric tests of significance (p<0.05) is used.

Additionally, the algorithms are applied to tomographic reconstruction, which is an important inverse problem in medical and industrial imaging [34]. One of the purposes of applying the proposed variants to this particular problem is to investigate the performance of the algorithms over problems with increasing dimensionality. The termination criterion is again set to reaching 150,000 function evaluations. In this problem, downsampled standard test images, the Shepp-Logan image phantoms [35], are reconstructed by using two projections. The images have the following dimensions: 25D (5×5), 100D (10×10), 255D (15×15), 400D (20×20), and 625D (25×25).

Results

Table 1a summarises the performance of the algorithms on 84 test functions, where ‘win’ and ‘loss’ of uDFOΔdynamic=1/1000p against other algorithms are considered when there is a recorded statistically significant outperformance in terms of the error values. The results demonstrate uDFOΔdynamic=1/1000p’s outperformance in 62%, 75%, 66%, 55%, and 64% of the cases with statistically significant difference, when compared against DFO, DFOΔ=0 and GPSO, LPSO, and DE, respectively. The details of the algorithms’ performance over each of one of the benchmark are presented in the appendix in Table A2, Table A3, Table A4, Table A5, Table A6, Table A7, Table A8 and Table A9. The tables provide the numerical values for the minimum, maximum, median, mean, and standard deviation associated with each algorithm over each benchmark function. In terms of diversity, and as shown in Table 1b, the statistically significant similarity between the algorithm and standard DFO is evident by observing the number of ties (i.e., 78 out of 84 cases, or 93%). This is expected as per the original intention to take into account the previously reported restart threshold (see Figure 2).

Table 1.

Summary of the results for uDFO with Δdynamic=1/1000p. The scores indicate uDFO’s wins and losses when compared against other algorithms. uDFOΔdynamic=1/1000p exhibits outperformance for the error metric in the majority of significant cases (see bold type).

(a) Error
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOΔdynamic=1/1000p (vs. DFO) 8 5 71 10% 62%
uDFOΔdynamic=1/1000p (vs. DFOΔ=0) 43 14 27 51% 75%
uDFOΔdynamic=1/1000p (vs. GPSO) 43 22 19 51% 66%
uDFOΔdynamic=1/1000p (vs. LPSO) 42 34 8 50% 55%
uDFOΔdynamic=1/1000p (vs. DE) 46 26 12 55% 64%
(b) Diversity
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOΔdynamic=1/1000p (vs. DFO) 4 2 78 5% 67%
uDFOΔdynamic=1/1000p (vs. DFOΔ=0) 84 0 0 100% 100%
uDFOΔdynamic=1/1000p (vs. GPSO) 62 19 3 74% 77%
uDFOΔdynamic=1/1000p (vs. LPSO) 25 57 2 30% 30%
uDFOΔdynamic=1/1000p (vs. DE) 67 15 2 80% 82%

The results of uDFOΔdynamic=1/1500p against other algorithms are reported in Table 2a. The algorithm’s outperformance in 68%, 78%, 73%, 61%, and 68% of the cases with statistically significant difference are reported. While uDFOΔdynamic=1/1500p presents higher termination diversity against DFOΔ=0, GPSO and DE, as shown in Table 2b, the contrary can be observed with DFO and LPSO. The rationale is the consistent value of the restart threshold in standard DFO throughout the optimisation (given Δ=0.001) and the well understood higher diversity of local neighbourhood population in LPSO [36]. In other words, as shown in Figure 2, the reduced rate of the restart mechanism at the tail end of p manifests itself in the reduced terminal diversity, as illustrated in the first row of Table 2b.

Table 2.

Summary of the results for uDFO with Δdynamic=1/1500p. The scores indicate uDFO’s wins and losses when compared against other algorithms. uDFOΔdynamic=1/1500p exhibits outperformance for the error metric in the majority of significant cases (see bold type).

(a) Error
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOΔdynamic=1/1500p (vs. DFO) 21 10 53 25% 68%
uDFOΔdynamic=1/1500p (vs. DFOΔ=0) 40 11 33 48% 78%
uDFOΔdynamic=1/1500p (vs. GPSO) 47 17 20 56% 73%
uDFOΔdynamic=1/1500p (vs. LPSO) 45 29 10 54% 61%
uDFOΔdynamic=1/1500p (vs. DE) 47 22 15 56% 68%
(b) Diversity
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOΔdynamic=1/1500p (vs. DFO) 0 84 0 0% 0%
uDFOΔdynamic=1/1500p (vs. DFOΔ=0) 84 0 0 100% 100%
uDFOΔdynamic=1/1500p (vs. GPSO) 60 21 3 71% 74%
uDFOΔdynamic=1/1500p (vs. LPSO) 22 59 3 26% 27%
uDFOΔdynamic=1/1500p (vs. DE) 67 16 1 80% 81%

Table 3 presents the performance comparison of uDFOz5 with other algorithms, including uDFOΔdynamic=1/1500p, which exhibits better performance in terms of error than uDFOΔdynamic=1/1000p. As expected, in terms of error, the winning rates of uDFOz5 and uDFOΔdynamic=1/1500p are similar when compared against other algorithms, although the latter offers better overall performance. The last rows in Table 3a,b compare uDFOz5 and uDFOΔdynamic=1/1500p, demonstrating the largest number of ties (see the underlined values) as indicators of similarities, which are likely to be influenced by the coverage similarity of holistic and zone-based restarts. However, as expected and explained earlier, uDFOΔdynamic=1/1500p exhibits higher diversity than uDFOz5.

Table 3.

Summary of the results for uDFOz5. The scores indicate algorithm’s wins and losses when compared against other methods. uDFOz5 exhibits outperformance for the error metric in the majority of significant cases (see bold type), except for uDFOΔdynamic=1/1500p, albeit with the majority of cases in tie states, as underlined.

(a) Error
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOz5 (vs. DFO) 25 14 45 30% 64%
uDFOz5 (vs. DFOΔ=0) 39 11 34 46% 78%
uDFOz5 (vs. GPSO) 43 17 24 51% 72%
uDFOz5 (vs. LPSO) 45 29 10 54% 61%
uDFOz5 (vs. DE) 47 25 12 56% 65%
uDFOz5 (vs. uDFOΔdynamic=1/1500p) 4 13 67 5% 24%
(b) Diversity
Algorithms Win Loss Tie Win Rate Win Rate (Significant Cases)
uDFOz5 (vs. DFO) 0 84 0 0% 0%
uDFOz5 (vs. DFOΔ=0) 84 0 0 100% 100%
uDFOz5 (vs. GPSO) 57 21 6 68% 73%
uDFOz5 (vs. LPSO) 22 60 2 26% 27%
uDFOz5 (vs. DE) 67 16 1 80% 81%
uDFOz5 (vs. uDFOΔdynamic=1/1500p) 0 45 39 0% 0%

In order to analyse the error-related strengths and weaknesses of uDFOΔdynamic=1/1500p and uDFOz5, each of the algorithm pairs are broken down in Table 4 based on fourteen function properties. The total number of function properties (shared by the test functions) is 233. The results demonstrate an overall outperformance of uDFOΔdynamic=1/1500p and uDFOz5, where the most visible contribution of the unified exploitation approaches can be seen for functions with the following properties {U, S, NS, SD}, while being competitive in {M, NV, A}, and less effective for {N, C}. Among the suitable function properties is non-separable, or NS, where variables interact, making it challenging to decompose the problem into sub-problems; this property is amongst the more demanding in the benchmark and in real-world fitness functions. Further analysis is required to better understand the function properties in the context of the algorithms performance.

Table 4.

Performance comparison by function properties. Bold type indicates significantly lower error by the algorithm for greater number of function instances with a given property.

(a) uDFOΔdynamic=1/1500p
f Property Total uDFO DFO uDFO DFO Δ=0 uDFO GPSO uDFO LPSO uDFO DE
U: Unimodal 22 14 0 8 8 14 6 17 3 12 6
M: Multimodal 62 7 10 32 3 33 11 28 26 35 16
S: Separable 18 8 1 13 5 10 5 11 3 8 6
NS: Non-separable 66 13 9 27 6 37 12 34 26 39 16
N: Noisy 3 0 0 3 0 0 1 1 2 2 0
B: x* on bounds 4 2 0 1 1 3 0 2 2 1 1
NV: x* in narrow val 3 0 1 0 0 2 0 2 1 2 1
UB: x* out init vol 2 0 1 2 0 1 1 1 1 1 1
F: Neutrality 8 0 2 6 0 2 1 1 7 1 4
HC: High condition 2 0 1 0 0 1 1 1 1 1 1
SD: Sensitivity 2 2 0 2 0 2 0 2 0 1 0
A: Asymmetric 20 4 1 7 0 9 4 7 7 11 9
D: Deceptive 2 0 1 1 0 1 0 1 0 2 0
C: Composition 19 2 3 9 0 5 4 2 13 5 9
233 52 30 111 23 120 46 110 92 121 70
% 63% 37% 83% 17% 72% 28% 54% 46% 63% 37%
(b) uDFO z5
f Property Total uDFO z5 DFO uDFO z5 DFO Δ=0 uDFO z5 GPSO uDFO z5 LPSO uDFO z5 DE
U: Unimodal 22 16 1 7 8 13 6 18 3 12 6
M: Multimodal 62 9 13 32 3 30 11 27 26 35 19
S: Separable 18 9 5 12 5 9 5 12 4 7 6
NS: Non-separable 66 16 9 27 6 34 12 33 25 40 19
N: Noisy 3 0 1 2 0 0 1 1 2 1 0
B: x* on bounds 4 2 0 1 2 2 1 2 2 1 2
NV: x* in narrow val 3 1 0 1 0 2 0 2 1 2 1
UB: x* out init vol 2 1 1 1 0 1 1 1 1 1 1
F: Neutrality 8 0 1 6 0 1 1 1 7 1 5
HC: High condition 2 0 0 0 0 1 1 1 1 1 1
SD: Sensitivity 2 2 0 2 0 2 0 2 0 1 0
A: Asymmetric 20 3 4 7 0 7 3 7 7 11 9
D: Deceptive 2 0 1 1 0 1 0 1 0 2 0
C: Composition 19 2 2 9 1 3 4 2 13 5 11
233 61 38 108 25 106 46 110 92 120 80
% 62% 38% 81% 19% 70% 30% 54% 46% 60% 40%

Finally, the proposed approaches are trialled on tomographic construction, taking into account problems with larger dimensionality (Table 5 and Table 6). Each algorithm is run 50 times for each problem; therefore, a total of 1500 trials are conducted (6 algorithms × 5 problems × 50 runs). Barring the lowest dimensional problem (25D), the results illustrate the overall competitiveness of uDFO in 94% (15 out of 16), and uDFOz5 in 100% (12 out 12), of the algorithm-problem pairs in high-dimensional problems (see Table 5a,b, respectively).

Table 5.

Tomographic Reconstruction: Performance comparison.

(a) uDFO with Δdynamic=1/1500p
Algorithms D = 25 D = 100 D = 225 D = 400 D = 625
uDFO vs. DFO -- uDFO uDFO DFO uDFO
uDFO vs. GPSO -- uDFO uDFO uDFO uDFO
uDFO vs. LPSO uDFO uDFO uDFO * uDFO * uDFO *
uDFO vs. DE uDFO uDFO uDFO uDFO uDFO
(b) uDFO z5
Algorithms D = 25 D = 100 D = 225 D = 400 D = 625
uDFOz5 vs. DFO -- uDFOz5 uDFOz5 uDFOz5 uDFOz5
uDFOz5 vs. GPSO -- uDFOz5 uDFOz5 uDFOz5 uDFOz5
uDFOz5 vs. LPSO uDFOz5 uDFOz5 uDFOz5 * uDFOz5 * uDFOz5 *
uDFOz5 vs. DE uDFOz5 uDFOz5 uDFOz5 uDFOz5 uDFOz5
uDFOz5 vs. uDFO -- uDFOz5 uDFOz5 uDFOz5 uDFOz5

*: LPSO does not compute solutions for D = {255,400,625}. This is due to a large number of particles components’ off-shooting out of bounds.

Table 6.

Tomographic Reconstruction: Error values. Bold type indicates outperforming algorithm(s) for each dimension.

Algorithm Min Max Median Mean StdDev
D = 25 uDFO 0.00 0.00 0.00 0.00 0.00
uDFOz5 0.00 0.00 0.00 0.00 0.00
DFO 0.00 0.00 0.00 0.00 0.00
GPSO 0.00 0.00 0.00 0.00 0.00
LPSO 0.00 5.24×1032 3.08×1033 7.36×1033 1.14×1032
DE 4.24×1023 5.94×108 6.08×1014 1.42×109 8.40×109
D = 100 uDFO 1.6806×1014 1.6884×1014 1.6810×1014 1.6818×1014 1.6127×1017
uDFOz5 1.6806×1014 1.6808×1014 1.6806×1014 1.6806×1014 4.2304×1019
DFO 1.98×1014 1.55×1011 5.65×1014 4.53×1013 2.18×1012
GPSO 9.00×101 2.48×102 2.05×102 1.94×102 3.99×101
LPSO 1.17×102 2.23×102 1.67×102 1.67×102 2.53×101
DE 1.79×1014 2.21×103 9.79×109 7.11×105 3.34×104
D = 225 uDFO 6.02×1010 1.98×108 4.49×109 5.77×109 4.34×109
uDFOz5 2.09×1011 1.38×109 1.94×1010 2.53×1010 2.40×1010
DFO 1.45×107 1.49×106 4.15×107 4.75×107 2.48×107
GPSO 5.54×102 7.08×102 6.39×102 6.42×102 3.41×101
LPSO NA NA NA NA NA
DE 8.64×102 6.42×10 1.74×10 2.14×10 1.40×10
D = 400 uDFO 1.71×105 4.93×105 2.77×105 2.92×105 7.14×106
uDFOz5 1.60×107 2.47×106 6.14×107 7.21×107 4.41×107
DFO 1.32×105 5.18×105 2.59×105 2.64×105 7.72×106
GPSO 1.60×103 1.86×103 1.77×103 1.76×103 6.46×101
LPSO NA NA NA NA NA
DE 4.24×101 1.33×102 7.94×101 7.91×101 1.89×101
D = 625 uDFO 1.89×103 4.03×103 2.75×103 2.73×103 4.65×104
uDFOz5 1.33×105 6.11×105 2.97×105 3.13×105 1.03×105
DFO 1.01×102 2.33×102 1.73×102 1.72×102 2.67×103
GPSO 3.89×103 4.41×103 4.15×103 4.15×103 1.09×102
LPSO NA NA NA NA NA
DE 5.74×102 8.02×102 6.73×102 6.77×102 5.17×101

In summary, while the performance of uDFOΔdynamic=1/1500p and uDFOz5 are similar on the lower dimensional problem, uDFOz5 demonstrates better performance in all higher-dimensional problems (i.e., 100D, 255D, 400D, 625D), with wider performance gaps as the dimensionality grows (see Table 6). Further experiments are needed to verify the extendibility of performance in other high-dimensional problems.

Among the challenges of the approach is the need for a-priori knowledge of the bounds to feasible solutions. Whilst setting indicative bounds in many real-world problems is practically possible, further investigation is needed in this area. Additionally, although the main computational expense is associated with function evaluation, the impact of calculating exploitation probability, p, on the computational cost is a topic for an ongoing research. Furthermore, having tested the approaches on a comprehensive set of test functions, as well as identifying a number of suitable function properties, one of the next steps is applying the methods to other complex real-world problems with known function properties.

5. Conclusions

This work presents a framework for analysing the exploitation probabilities in a vector-stripped swarm technique, which is a minimalist numerical optimiser over continuous search spaces. The algorithm’s vector-stripped nature stems from its update equation’s sole reliance on particles’ position vectors, as well as having (other than population size) one tunable parameter, Δ, controlling the component-wise restart of the particles. This work provides an iteration-based zone analysis of particle’s movements in order to establish their exploration and exploitation behaviour. In addition to better understanding the particles’ behaviour, the work focuses on providing a strategy to control the population’s interaction in the search space. This is attempted through a unified exploitation probability, p, through (1) uDFO (with Δdynamic=1/1000pand1/1500p) using a holistic restart, and (2) uDFOz5, which is trialled for the purpose of examining zone-relocation restart mechanism. Both methods allow adaptable dimensional control of the particles.

The proposed approaches are then examined over 84 test functions with a combined 233 function properties, where uDFOΔdynamic=1/1000p performs better in 62%, 75%, 66%, 55%, and 64% of cases with statistically significant difference when compared against DFO, DFOΔ=0, GPSO, LPSO, and DE, respectively; and uDFOΔdynamic=1/1500p in 68%, 78%, 73%, 61%, and 68%; and uDFOz5 in 64%, 78%, 72%, 61%, and 65% of the significant cases.

The performance is then investigated on the high-dimensional tomographic reconstruction problems, where uDFOΔdynamic=1/1500p and uDFOz5 exhibited better performance in 94% and 100% of the high-dimensional D = {100,255,400,635} algorithm-problem pairs, respectively.

Using minimalist algorithms facilitates analysis in order to better understand the complex underlying behaviour of the particles, such as: particles oscillation around the constantly changing centres, particles’ influence on one another, and understanding the trajectory of particles [11,22,37]. The paper aimed at investigating the exploitation- and exploration-derived zones to inform the behaviour of the population.

Future work includes investigating the exploitation and zone analyses to other swarm optimisers, as well as exploring approaches, to deal with unbounded problems. Furthermore, studying the performance of the presented approaches on dynamically changing environments and studying the combinations of function properties, which benefit from the analysis, are topics for ongoing research.

Short Biography of the Author

graphic file with name entropy-23-00977-i002.gif Mohammad Majid al-Rifaie is a Senior Lecturer in Artificial Intelligence at the University of Greenwich, School of Computing and Mathematical Sciences. He holds a PhD in Artificial Intelligence and Computational Swarm Intelligence (CSI) from Goldsmiths, University of London, and since the start of his PhD, he has published extensively in the field, covering various applications of CSI, Evolutionary Computation (EC), Machine Learning (ML) and Deep Neural Networks (DNNs). He has taught in the higher education for more than a decade, several of which relevant to CSI, AI, their real-world applications as well as philosophical issues on artificial intelligence and arts. His work in the area has featured multiple times in the media including the British Broadcasting Corporation (BBC). Over the past 10 years, he has developed a unique interdisciplinary research profile with more than 70 peer-reviewed publications including, book chapters, journal and conference papers on CSI, EC, ML and DNNs as well as their applications in medical imaging, data science, philosophy and arts. He has supervised (and is supervising) several PhD students who are researching the aforementioned areas.

Appendix A. Iteration-Based Exploration and Exploitation Analysis

For, the iteration-based exploration and exploitation analysis, when xg, where g is the same for all x in the population for each iteration, the following three scenarios can be analysed:

  • S1: nxg S1.1: σd1; S1.2: d1<σ,

  • S2: xng S2.1: d2d1; S2.2: d1<d2,

  • S3: xgn S3.1: σd2; S3.2: d2<σ.

The analysis are first presented from an initial state, where the particles are initialised in the search space. Using the small-view exploitation and exploration concepts, the analysis in this section focuses on each scenario (and their corresponding sub-scenarios) and, by extension, the overall impact on each iteration.

Appendix A.1. Scenario 1: n ≤ x ≤ g

In this scenario, the difference between |nx| and |gx|, as well as the value of u in the update equation, determine whether x approaches g. Given d1=|nx| and d2=|gn|, in the first scenario, d2=d1+σ (see Figure A1, top).

Figure A1.

Figure A1

Three scenarios for xg, with d1=|nx|, d2=|gn|. The analysis also holds for the mirrored scenarios where gx.

Depending on the proximity of x to either its best neighbour or the best particle in the swarm, two distinct cases need to be explored. Considering σd1 (S1.1 in Figure A1), the exploitation probability, pexploit=0, and the exploration probability is pexplore=1, where x moves away from g. On the other hand, in S1.2, in Figure A1, when d1<σ, pexploit and pexplore depend on the proximity of the x to n, as well as the randomly generated value of u.

Based on this and to analyse the probability of exploitation in this scenario, the space is scaled with n at the origin and g at 1 and x is uniformly distributed in [0,1]. Therefore,

n=0g=1x=0+u(1x)P(exploit)=P(|gx|<|gx|)=P(1u(1x)<1x)=Pu>x1x=0.500.5x1xdx=0.5([xlog(1x)]00.5)0.307.

This analysis holds for the mirrored case of scenario 1 (i.e., gxn). The plots in Figure A2 illustrate the exploitation probabilities as shaded areas in S1, and mirrored S1.

Figure A2.

Figure A2

Exploitation probability in scenario 1. (Left) nxg; (Right) gxn.

Appendix A.2. Scenario 2: x ≤ n ≤ g

Scaling the space, we have x=0 and g=1. Therefore, there are two possible outcome cases for x:

  1. xngx,

  2. xnxg.

Therefore, givenn[0,1],uU(0,1):

x=n+u,P(exploit)=P(|xg|<|xg|)=P(|x1|<1)=P(|n+u1|<1)=1Alwaysholds,P(exploit)=P(n+u1<1)forcase(1)=P(n+u<2)=1,P(exploit)=P(1(n+u)<1)forcase(2)=P((n+u)<0)=1.

The mirrored of this scenario (i.e., gnx) also holds with exploitation probability equal to 1 (see Figure A3).

Figure A3.

Figure A3

Exploitation probability in scenario 2 (for both xng and gnx).

Appendix A.3. Scenario 3: x ≤ g ≤ n

Scaling the space, we have x=0 and n=1. Therefore,

x=0n=1P(exploit)=P(ug+(1g)<g)=P(u<2g1g)=P(u<21g)=0.51(21g)dg=(2glog(g))|0.510.307.

The analysis for the mirrored cases in scenario 3 holds (i.e., ngx). The plots in Figure A4 illustrate the exploitation probabilities in S3, and mirrored S3.

Figure A4.

Figure A4

Exploitation probability in scenario 3. (Left) xgn; (Right) ngx.

Appendix B. Benchmark Functions and Algorithms Error Values

This section presents the Benchmark functions in Table A1, which are the combined benchmark of CEC05/13 and ENG13 functions. Based on these functions, the numbering is denoted as f2,f4, Function properties, as claimed in the original publications, are: U: unimodal, M: multimodal, S: separable, NS: non-separable, N: noisy, B: x* on bounds, NV: x* in narrow valley, UB: x* outside initialisation volume, F: neutrality (has flat areas), HC: high conditioning, SD: sensitivity (f has one or more sensitive directions), A: asymmetric, D: deceptive (x* is far from next local optimum), C: composition.

Furthermore, the error values for algorithms over all the benchmarks are reported in Table A2, Table A3, Table A4, Table A5, Table A6, Table A7, Table A8 and Table A9.

Table A1.

Benchmark functions.

F No. Label/Number Name Properties F No. Label/Number Name Properties
2 CEC05 F02 Shifted Schwefel 1.2 U, NS 52 CEC13 F22 Composition Function 2 (n = 3, Unrotated) M, S, A, C
4 CEC05 F04 Shifted Schwefel 1.2 with noise U, NS, N 53 CEC13 F23 Composition Function 3 (n = 3, Rotated) M, NS, A, C
5 CEC05 F05 Schwefel 2.6, x* on bounds U, NS, B 54 CEC13 F24 Composition Function 4 (n = 3, Rotated) M, NS, A, C
6 CEC05 F06 Shifted Rosenbrock M, NS, NV 55 CEC13 F25 Composition Function 5 (n = 3, Rotated) M, NS, A, C
7 CEC05 F07 Shifted Rotated Griewank without bounds M, NS, UB 56 CEC13 F26 Composition Function 6 (n = 5, Rotated) M, NS, A, C
8 CEC05 F08 Shifted Rotated Ackley, x* on bounds M, NS, B 57 CEC13 F27 Composition Function 7 (n = 5, Rotated) M, NS, A, C
11 CEC05 F11 Shifted Rotated Weierstrass M, NS 58 CEC13 F28 Composition Function 8 (n = 5, Rotated) M, NS, A, C
12 CEC05 F12 Schwefel 2.13 M, NS 61 ENG13 F01 Absolute value U, S
13 CEC05 F13 Expanded Extended Griewank + Rosenbrock M, NS 62 ENG13 F02 Ackley M, NS
14 CEC05 F14 Shifted Rotated Expanded Scaffer F6 M, NS 63 ENG13 F02 Sh Shifted Ackley M, NS
15 CEC05 F15 Hybrid Composition M, NS, F, C 64 ENG13 F02 R Rotated Ackley M, NS
16 CEC05 F16 Rotated Hybrid Composition M, NS, F, C 65 ENG13 F03 Alpine M, S
17 CEC05 F17 Rotated Hybrid Composition with noise M, NS, N, F, C 66 ENG13 F04 Egg holder M, NS
18 CEC05 F18 Rotated Hybrid Composition M, NS, F, C 67 ENG13 F05 Elliptic U, S
19 CEC05 F19 Rotated Hybrid Composition, x* in narrow basin M, NS, NV, F, C 68 ENG13 F05 Sh Shifted Elliptic U, S
20 CEC05 F20 Rotated Hybrid Composition, x* on bounds M, NS, B, F, C 69 ENG13 F06 Griewank M, NS
21 CEC05 F21 Rotated Hybrid Composition M, NS, C 70 ENG13 F06 Sh Shifted Griewank M, NS
22 CEC05 F22 Rotated Hybrid Composition, highly conditioned M, NS, HC, C 71 ENG13 F06 R Rotated Griewank M, NS
23 CEC05 F23 Non-Continuous Rotated Hybrid Composition M, NS, B, C 72 ENG13 F07 Hyperellipsoid U, S
24 CEC05 F24 Rotated Hybrid Composition M, NS, F, C 73 (ENG13 F07 ShR) Shifted Rotated Hyperellipsoid U, NS
25 CEC05 F25 Rotated Hybrid Composition without Bounds M, NS, UB, F, C 74 ENG13 F08 Michalewicz M, S
31 CEC13 F01 Sphere U, S 75 ENG13 F09 Norwegian M, NS
32 CEC13 F02 Rotated High Conditioned Elliptic U, NS, HC 76 ENG13 F10 Quadric U, NS
33 CEC13 F03 Rotated Bent Cigar U, NS 77 ENG13 F11 Quartic U, S
34 CEC13 F04 Rotated Discus U, NS, SD, A 78 ENG13 F11 N Quartic/Jong’s F4 U, S, N
35 CEC13 F05 Different Powers U, S, SD 79 ENG13 F12 Rastrigin M, S
36 CEC13 F06 Rotated Rosenbrock M, NS, NV 80 ENG13 F12 R Rotated Rastrigin M, NS
37 CEC13 F07 Rotated Schaffer’s F7 M, NS, A 81 ENG13 F13 R Rosenbrock M, NS
38 CEC13 F08 Rotated Ackley M, NS, A 82 ENG13 F13 R Rotated Rosenbrock M, NS
39 CEC13 F09 Rotated Weierstrass M, NS, A 83 ENG13 F14 Saloman M, NS
40 CEC13 F10 Rotated Griewank M, NS 84 ENG13 F15 Schaffer 6 M, NS
41 CEC13 F11 Rastrigin M, S, A 85 ENG13 F16 Schwefel 1.2 U, NS
42 CEC13 F12 Rotated Rastrigin M, NS, A 86 ENG13 F16 R Rotated Schwefel 1.2 U, NS
43 CEC13 F13 Non-Continuous Rotated Rastrigin M, NS, A 87 ENG13 F17 Schwefel 2.6 U, NS
44 CEC13 F14 Schwefel M, NS, A, D 88 ENG13 F18 Schwefel 2.13 M, NS
45 CEC13 F15 Rotated Schwefel M, NS, A, D 89 ENG13 F19 Schwefel 2.21 U, S
46 CEC13 F16 Rotated Katsuura M, NS, A 90 ENG13 F20 Schwefel 2.22 U, S
47 CEC13 F17 Lunacek Bi Rastrigin M, NS 91 (ENG13 F20 ShR) Shifted Rotated Schwefel 2.22 U, NS
48 CEC13 F18 Rotated Lunacek Bi Rastrigin M, NS, A 92 ENG13 F21 Shubert M, NS
49 CEC13 F19 Expanded Griewank + Rosenbrock M, NS 93 ENG13 F23 Step M, S
50 CEC13 F20 Expanded Scaffer’s F6 M, NS, A 94 ENG13 F24 Vincent M, S
51 CEC13 F21 Composition Function 1 (n = 5, Rotated) M, NS, A, C 95 ENG13 F25 Weierstrass M, S

Table A2.

Error values for DFO.

F No. Min Max Median Mean StdDev
2 5.68×1014 1.93×1012 2.27×1013 3.56×1013 3.41×1013
4 1.31×102 8.27×103 1.35×103 2.24×103 2.10×103
5 2.61×103 6.84×103 4.40×103 4.55×103 1.00×103
6 2.35×106 7.91 2.58×103 1.92×101 1.12
7 4.70×103 4.70×103 4.70×103 4.70×103 9.09×1013
8 2.00×101 2.00×101 2.00×101 2.00×101 1.11×102
11 1.56×101 3.89×101 2.80×101 2.87×101 5.00
12 4.51 1.85×104 1.39×103 2.64×103 3.55×103
13 8.27×101 2.32 1.59 1.59 3.68×101
14 1.24×101 1.40×101 1.35×101 1.35×101 3.99×101
15 0.00 5.03×102 3.00×102 3.02×102 1.41×102
16 1.57×102 5.15×102 3.99×102 3.54×102 9.93×101
17 1.71×102 9.05×102 3.71×102 3.75×102 1.22×102
18 9.24×102 1.15×103 9.77×102 9.93×102 5.29×101
19 9.28×102 1.18×103 9.70×102 9.87×102 5.47×101
20 8.00×102 1.12×103 9.76×102 9.88×102 5.86×101
21 5.00×102 1.23×103 1.03×103 8.71×102 3.31×102
22 9.65×102 1.30×103 1.13×103 1.13×103 8.12×101
23 5.00×102 1.24×103 8.07×102 8.36×102 3.32×102
24 2.00×102 1.33×103 2.00×102 6.24×102 5.25×102
25 1.67×103 1.79×103 1.72×103 1.72×103 2.62×101
31 0.00 2.27×1013 0.00 2.73×1014 7.46×1014
32 4.53×104 3.04×105 1.49×105 1.58×105 6.54×104
33 8.66×105 1.52×109 6.55×107 1.78×108 2.96×108
34 7.51 1.07×103 8.74×101 1.52×102 1.85×102
35 0.00 1.14×1013 1.14×1013 1.11×1013 1.61×1014
36 3.75×102 7.11×101 1.04×101 2.09×101 2.30×101
37 5.41×101 2.16×102 1.45×102 1.42×102 4.17×101
38 2.08×101 2.10×101 2.10×101 2.10×101 5.72×102
39 2.28×101 4.32×101 3.05×101 3.09×101 4.06
40 7.40×103 2.02×101 6.04×102 6.67×102 4.02×102
41 0.00 6.82×1013 0.00 3.41×1014 9.81×1014
42 9.65×101 4.15×102 2.51×102 2.58×102 7.41×101
43 2.01×102 5.86×102 3.50×102 3.50×102 6.53×101
44 1.87×101 1.36×102 9.75 1.52×101 2.50×101
45 2.67×103 6.05×103 4.38×103 4.40×103 5.78×102
46 4.02×101 2.75 1.13 1.21 5.23×101
47 3.04×101 3.15×101 3.07×101 3.07×101 2.17×101
48 3.00×101 3.00×101 3.00×101 3.00×101 3.94×1010
49 9.11×101 2.89 1.63 1.67 4.22×101
50 1.05×101 1.34×101 1.26×101 1.25×101 5.72×101
51 1.00×102 4.00×102 3.00×102 3.14×102 7.83×101
52 1.58×101 2.65×102 1.27×102 1.41×102 7.27×101
53 4.13×103 7.75×103 5.30×103 5.59×103 9.19×102
54 2.74×102 3.29×102 3.01×102 3.03×102 1.26×101
55 2.97×102 3.69×102 3.26×102 3.28×102 1.41×101
56 2.00×102 4.05×102 3.76×102 3.38×102 7.89×101
57 9.79×102 1.43×103 1.22×103 1.19×103 1.07×102
58 1.00×102 3.76×103 3.00×102 8.14×102 9.32×102
61 3.21×1017 8.01×1015 4.98×1016 1.12×1015 1.47×1015
62 7.55×1015 3.24×1014 1.47×1014 1.77×1014 5.79×1015
63 1.40×102 1.40×102 1.40×102 1.40×102 2.15×1014
64 2.01 7.88 3.49 3.69 1.08
65 1.71×1013 5.03×1011 2.28×1012 2.82×1012 2.78×1012
66 2.44×104 1.88×104 2.05×104 2.07×104 9.66×102
67 1.22×1031 2.06×1027 1.85×1029 1.60×1028 4.09×1028
68 4.50×102 4.50×102 4.50×102 4.50×102 3.63×1014
69 0.00 8.77×102 1.35×102 2.33×102 2.38×102
70 1.80×102 1.80×102 1.80×102 1.80×102 2.09×102
71 0.00 4.65×102 9.86×103 1.12×102 9.71×103
72 4.88×1036 1.88×1031 5.39×1034 6.19×1033 2.69×1032
73 4.50×102 4.50×102 4.50×102 4.50×102 7.03×1014
74 2.96×101 2.94×101 2.96×101 2.96×101 3.85×102
75 8.39×101 7.69×101 8.10×101 8.07×101 1.61×102
76 9.55×1015 3.07×1012 8.71×1014 2.52×1013 5.13×1013
77 5.52×1069 5.12×1063 9.81×1066 3.10×1064 9.22×1064
78 4.06 4.69×101 2.33 2.34 7.45×101
79 0.00 9.55×1010 0.00 2.09×1011 1.35×1010
80 6.17×101 2.22×102 1.15×102 1.19×102 3.15×101
81 2.83×108 1.40 2.15×103 1.09×101 3.54×101
82 6.14 1.29×104 2.00×101 6.24×102 2.16×103
83 1.73×101 2.45×101 2.00×101 1.99×101 1.85×102
84 5.83×102 1.57 4.89×101 5.81×101 3.36×101
85 4.76×1015 1.95×1012 7.92×1014 1.88×1013 3.33×1013
86 9.73×1015 1.78×1010 7.35×1013 8.45×1012 2.78×1011
87 2.27×103 7.29×103 4.66×103 4.53×103 1.18×103
88 6.20 2.46×104 2.53×103 3.74×103 3.99×103
89 1.50×105 1.13×103 1.25×104 2.28×104 2.48×104
90 1.14×1013 1.71×1013 1.14×1013 1.26×1013 2.38×1014
91 4.50×102 4.33×102 4.48×102 4.45×102 4.47
92 3.87×1034 9.21×1033 1.89×1034 2.10×1034 6.63×1033
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 0.00 0.00 0.00 0.00 0.00

Table A3.

Error values for DFOΔ=0.

F No. Min Max Median Mean StdDev
2 5.68×1014 1.88×1012 5.68×1014 1.51×1013 3.03×1013
4 4.84×103 7.30×104 2.93×104 3.14×104 1.40×104
5 2.36×103 7.22×103 3.88×103 4.08×103 1.05×103
6 3.54×108 4.01 4.06×104 1.36 1.91
7 4.70×103 4.70×103 4.70×103 4.70×103 8.69×101
8 2.00×101 2.00×101 2.00×101 2.00×101 5.17×103
11 1.94×101 3.89×101 2.99×101 2.95×101 4.70
12 1.51×102 8.36×104 1.09×104 1.97×104 2.24×104
13 4.35 2.33×101 9.50 1.01×101 4.44
14 1.24×101 1.41×101 1.36×101 1.36×101 3.87×101
15 4.00×102 9.00×102 5.55×102 5.64×102 1.24×102
16 1.97×102 5.05×102 3.44×102 3.51×102 9.54×101
17 2.52×102 7.62×102 4.85×102 4.90×102 1.30×102
18 9.28×102 1.24×103 1.02×103 1.03×103 6.71×101
19 9.41×102 1.15×103 1.01×103 1.01×103 4.66×101
20 9.29×102 1.19×103 1.01×103 1.02×103 5.83×101
21 5.00×102 1.23×103 1.16×103 8.99×102 3.38×102
22 9.78×102 1.34×103 1.14×103 1.16×103 8.49×101
23 5.00×102 1.22×103 5.00×102 7.82×102 3.32×102
24 2.00×102 1.36×103 1.24×103 1.05×103 4.12×102
25 1.69×103 1.82×103 1.77×103 1.77×103 2.87×101
31 0.00 4.55×1013 2.27×1013 2.50×1013 8.28×1014
32 4.23×104 3.72×105 1.43×105 1.57×105 7.59×104
33 2.87×106 1.16×109 6.59×107 1.69×108 2.65×108
34 3.25×101 1.14×104 4.72×102 1.42×103 2.44×103
35 1.14×1013 4.55×1013 2.27×1013 2.21×1013 8.09×1014
36 1.05×102 6.81×101 9.72 1.44×101 1.56×101
37 5.57×101 5.15×102 1.41×102 1.45×102 6.89×101
38 2.07×101 2.11×101 2.10×101 2.10×101 9.73×102
39 2.09×101 3.88×101 3.18×101 3.14×101 4.01
40 9.86×103 3.81×101 7.61×102 8.00×102 5.74×102
41 1.14×102 3.53×102 2.29×102 2.27×102 5.80×101
42 1.45×102 4.25×102 2.59×102 2.58×102 6.50×101
43 2.00×102 6.14×102 3.55×102 3.68×102 9.33×101
44 2.42×103 5.32×103 3.64×103 3.67×103 5.68×102
45 3.00×103 6.35×103 4.63×103 4.61×103 6.80×102
46 1.57×101 2.30 9.64×101 1.06 4.67×101
47 1.38×102 4.18×102 2.61×102 2.65×102 6.88×101
48 1.57×102 5.38×102 2.69×102 2.86×102 8.49×101
49 7.93 3.93×101 1.62×101 1.89×101 8.37
50 1.01×101 1.37×101 1.27×101 1.26×101 7.54×101
51 1.00×102 4.00×102 3.00×102 3.06×102 7.40×101
52 2.65×103 7.24×103 5.01×103 4.85×103 1.10×103
53 3.61×103 7.66×103 5.64×103 5.66×103 9.98×102
54 2.72×102 3.43×102 3.01×102 3.02×102 1.60×101
55 3.08×102 3.69×102 3.36×102 3.36×102 1.46×101
56 2.00×102 4.01×102 3.77×102 3.47×102 7.04×101
57 8.86×102 1.49×103 1.18×103 1.19×103 1.12×102
58 1.00×102 3.18×103 3.00×102 9.83×102 9.83×102
61 5.05×1029 2.78×1013 2.47×1022 5.66×1015 3.93×1014
62 1.34 1.35×101 3.49 4.04 2.21
63 1.38×102 1.21×102 1.36×102 1.34×102 4.52
64 1.90 1.31×101 3.93 4.70 2.50
65 3.01×1011 4.11×108 1.41×1010 4.14×1010 6.88×1010
66 1.56×104 9.98×103 1.32×104 1.29×104 1.38×103
67 1.04×1077 5.12×1068 6.54×1073 1.52×1069 7.52×1069
68 4.50×102 4.50×102 4.50×102 4.50×102 1.71×1013
69 0.00 3.02×101 1.85×102 3.15×102 4.85×102
70 1.80×102 1.80×102 1.80×102 1.80×102 4.05×102
71 0.00 6.87×102 1.23×102 1.45×102 1.27×102
72 2.40×1081 1.66×1074 3.48×1078 1.11×1075 3.23×1075
73 4.50×102 4.50×102 4.50×102 4.50×102 1.07×1013
74 2.59×101 2.04×101 2.35×101 2.34×101 1.33
75 8.09×101 7.31×101 7.69×101 7.71×101 1.78×102
76 5.91×1020 3.26×1011 1.61×1016 7.19×1013 4.62×1012
77 9.78×10150 3.63×10139 4.36×10143 1.54×10140 6.41×10140
78 3.69 2.57 1.88 1.56 1.41
79 5.07×101 2.33×102 1.12×102 1.13×102 3.29×101
80 5.57×101 2.26×102 1.13×102 1.17×102 3.30×101
81 4.56×109 1.18×101 2.11×104 1.43 2.37
82 4.85 7.52×103 1.65×101 2.18×102 1.06×103
83 3.16×101 4.21 5.52×101 7.45×101 5.94×101
84 1.00×101 1.35×101 1.22×101 1.20×101 9.44×101
85 3.97×1020 1.23×1011 1.13×1016 3.61×1013 1.86×1012
86 2.34×1018 9.19×1010 2.19×1014 4.99×1011 1.60×1010
87 1.93×103 6.19×103 3.85×103 3.93×103 1.07×103
88 2.58×101 1.62×105 1.65×104 2.74×104 3.52×104
89 1.09×107 3.63×105 3.13×106 5.27×106 6.40×106
90 5.68×1014 1.14×108 1.71×1013 3.28×1010 1.73×109
91 4.50×102 3.25×102 4.48×102 4.38×102 3.20×101
92 9.89×1028 5.06×1023 1.11×1026 4.52×1027 1.51×1028
93 0.00 3.08×102 9.00 3.00×101 6.45×101
94 0.00 2.84×1014 0.00 2.13×1015 5.42×1015
95 8.96 2.58×101 1.61×101 1.58×101 3.23

Table A4.

Error values for uDFOΔdynmaic=1/1000p.

F No. Min Max Median Mean StdDev
2 5.68×1014 1.02×1012 2.27×1013 3.09×1013 1.82×1013
4 2.13×102 8.68×103 2.07×103 2.55×103 2.11×103
5 2.77×103 7.28×103 4.54×103 4.72×103 1.10×103
6 2.91×106 8.78×101 8.17×103 5.06 1.72×101
7 4.70×103 4.70×103 4.70×103 4.70×103 1.20×1012
8 2.00×101 2.00×101 2.00×101 2.00×101 9.12×103
11 2.17×101 4.12×101 2.84×101 2.90×101 4.67
12 3.31×101 2.48×104 2.70×103 4.25×103 4.80×103
13 7.97×101 2.50 1.59 1.62 3.50×101
14 1.14×101 1.40×101 1.35×101 1.35×101 4.80×101
15 0.00 5.11×102 3.00×102 2.87×102 1.46×102
16 9.94×101 5.52×102 3.22×102 3.29×102 1.17×102
17 1.62×102 8.03×102 4.22×102 3.97×102 1.23×102
18 9.19×102 1.15×103 9.62×102 9.81×102 5.42×101
19 9.23×102 1.16×103 9.69×102 9.86×102 5.48×101
20 9.25×102 1.14×103 9.76×102 9.91×102 5.54×101
21 5.00×102 1.25×103 1.18×103 9.38×102 3.14×102
22 9.83×102 1.33×103 1.13×103 1.14×103 7.75×101
23 5.00×102 1.24×103 8.00×102 8.07×102 3.20×102
24 2.00×102 1.36×103 6.29×102 7.31×102 5.39×102
25 1.68×103 1.79×103 1.73×103 1.73×103 2.52×101
31 0.00 2.27×1013 0.00 2.27×1014 6.89×1014
32 5.27×104 3.33×105 1.65×105 1.76×105 6.65×104
33 2.25×106 2.13×109 7.73×107 1.72×108 3.21×108
34 1.79×101 5.06×102 9.30×101 1.28×102 1.18×102
35 0.00 1.14×1013 1.14×1013 1.11×1013 1.61×1014
36 5.23×103 7.47×101 1.02×101 1.75×101 1.94×101
37 6.51×101 2.57×102 1.31×102 1.34×102 3.49×101
38 2.08×101 2.10×101 2.09×101 2.09×101 5.85×102
39 2.22×101 3.95×101 3.19×101 3.12×101 4.23
40 2.22×102 3.10×101 5.79×102 7.75×102 5.63×102
41 0.00 1.14×1013 0.00 1.93×1014 2.95×1014
42 1.15×102 3.98×102 2.21×102 2.31×102 6.69×101
43 2.11×102 5.82×102 3.45×102 3.51×102 7.90×101
44 1.24 3.52×101 6.35 7.93 5.58
45 2.91×103 5.60×103 4.17×103 4.14×103 5.57×102
46 3.31×101 3.03 1.31 1.29 5.53×101
47 3.05×101 3.11×101 3.06×101 3.07×101 1.56×101
48 3.00×101 3.09×101 3.00×101 3.00×101 1.20×101
49 8.11×101 3.46 1.66 1.70 5.37×101
50 1.14×101 1.36×101 1.27×101 1.26×101 4.95×101
51 1.00×102 4.00×102 3.00×102 3.10×102 7.35×101
52 1.01×101 2.43×102 1.23×102 1.14×102 7.17×101
53 3.26×103 6.95×103 5.50×103 5.45×103 8.83×102
54 2.75×102 3.30×102 3.01×102 3.02×102 1.13×101
55 3.13×102 3.71×102 3.34×102 3.33×102 1.31×101
56 2.00×102 4.11×102 3.78×102 3.35×102 8.13×101
57 1.02×103 1.45×103 1.18×103 1.19×103 8.72×101
58 1.00×102 3.20×103 3.00×102 7.84×102 8.74×102
61 3.50×1017 1.68×1014 6.39×1016 1.39×1015 2.69×1015
62 7.55×1015 3.60×1014 1.47×1014 1.66×1014 5.61×1015
63 1.40×102 1.40×102 1.40×102 1.40×102 2.84×1014
64 2.12 6.94 3.49 3.62 9.60×101
65 1.03×1013 5.03×1011 2.28×1012 2.82×1012 1.89×1012
66 2.27×104 1.76×104 2.04×104 2.04×104 9.52×102
67 2.25×1031 1.31×1027 1.77×1029 1.37×1028 2.71×1028
68 4.50×102 4.50×102 4.50×102 4.50×102 3.81×1014
69 0.00 1.35×101 9.86×103 1.78×102 2.56×102
70 1.80×102 1.80×102 1.80×102 1.80×102 1.65×102
71 0.00 5.90×102 9.86×103 1.30×102 1.26×102
72 4.24×1035 4.38×1032 9.65×1034 4.78×1033 8.80×1033
73 4.50×102 4.50×102 4.50×102 4.50×102 5.39×1014
74 2.96×101 2.95×101 2.96×101 2.96×101 4.26×102
75 8.53×101 7.82×101 8.10×101 8.09×101 1.72×102
76 9.00×1015 2.32×1012 8.44×1014 2.62×1013 4.83×1013
77 2.84×1069 3.44×1062 3.78×1066 1.03×1063 4.96×1063
78 3.49 3.52×101 2.42 2.29 7.50×101
79 0.00 0.00 0.00 0.00 0.00
80 6.57×101 2.05×102 1.18×102 1.21×102 3.36×101
81 1.57×106 7.44 3.33×103 1.86×101 1.06
82 9.01 1.12×104 1.92×101 4.18×102 1.71×103
83 1.73×101 2.45×101 2.00×101 2.03×101 2.12×102
84 2.72×101 1.63 4.75×101 6.15×101 3.47×101
85 1.89×1015 6.65×1012 9.23×1014 3.85×1013 1.09×1012
86 7.54×1015 2.32×1011 1.92×1012 4.66×1012 6.39×1012
87 2.36×103 6.78×103 4.04×103 4.21×103 1.16×103
88 4.21×103 1.44×104 1.41×103 2.93×103 3.44×103
89 2.61×105 1.23×103 1.31×104 1.94×104 2.03×104
90 1.14×1013 1.71×1013 1.14×1013 1.32×1013 2.68×1014
91 4.50×102 3.24×102 4.48×102 4.45×102 1.78×101
92 3.87×1034 1.17×1034 1.89×1034 2.15×1034 5.82×1033
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 0.00 1.42×1014 0.00 2.84×1016 2.01×1015

Table A5.

Error values for uDFOΔdynmaic=1/1500p.

F No. Min Max Median Mean StdDev
2 5.68×1014 3.41×1013 1.14×1013 1.23×1013 6.63×1014
4 1.97×102 6.93×103 2.24×103 2.66×103 1.86×103
5 2.22×103 6.57×103 4.12×103 4.16×103 1.11×103
6 3.07×109 8.06 7.11×104 3.73×101 1.39
7 4.70×103 4.70×103 4.70×103 4.70×103 1.28×1012
8 2.00×101 2.01×101 2.00×101 2.00×101 1.27×102
11 1.97×101 3.99×101 2.86×101 2.95×101 4.04
12 1.14×101 2.57×104 2.72×103 4.29×103 5.35×103
13 1.12 2.82 1.73 1.77 4.11×101
14 1.22×101 1.40×101 1.35×101 1.35×101 3.88×101
15 2.00×102 5.04×102 3.00×102 3.19×102 1.05×102
16 1.77×102 8.00×102 3.39×102 3.41×102 1.14×102
17 1.75×102 8.05×102 4.06×102 3.96×102 1.12×102
18 9.29×102 1.22×103 9.76×102 9.98×102 6.80×101
19 9.20×102 1.23×103 1.00×103 1.02×103 7.67×101
20 8.00×102 1.10×103 9.73×102 9.83×102 5.48×101
21 5.00×102 1.23×103 8.07×102 8.30×102 3.34×102
22 9.92×102 1.37×103 1.15×103 1.17×103 9.07×101
23 5.00×102 1.23×103 5.00×102 7.91×102 3.31×102
24 2.00×102 1.36×103 1.08×103 7.41×102 5.28×102
25 1.67×103 1.80×103 1.74×103 1.74×103 2.82×101
31 0.00 2.27×1013 0.00 1.36×1014 5.45×1014
32 3.03×104 3.65×105 1.47×105 1.65×105 7.88×104
33 4.30×105 1.33×109 1.04×108 1.60×108 2.35×108
34 5.09 5.06×102 5.67×101 8.67×101 9.30×101
35 0.00 1.14×1013 1.14×1013 6.14×1014 5.72×1014
36 3.19×102 8.47×101 9.89 1.71×101 2.00×101
37 5.06×101 2.14×102 1.34×102 1.36×102 3.85×101
38 2.07×101 2.11×101 2.09×101 2.09×101 6.77×102
39 2.28×101 4.01×101 3.10×101 3.10×101 4.32
40 1.48×102 4.36×101 5.79×102 7.45×102 6.52×102
41 0.00 9.95×101 0.00 5.97×102 2.39×101
42 1.16×102 4.40×102 2.42×102 2.51×102 8.30×101
43 2.02×102 5.96×102 3.42×102 3.46×102 8.61×101
44 1.44 1.33×102 1.27×101 1.86×101 2.43×101
45 3.07×103 5.95×103 4.52×103 4.47×103 7.06×102
46 2.44×101 2.56 1.06 1.21 6.08×101
47 3.05×101 3.19×101 3.09×101 3.09×101 2.90×101
48 3.00×101 3.09×101 3.00×101 3.01×101 2.04×101
49 9.90×101 3.37 2.04 2.06 5.29×101
50 1.13×101 1.36×101 1.27×101 1.27×101 5.74×101
51 1.00×102 4.00×102 3.00×102 3.04×102 6.69×101
52 1.64×101 2.57×102 1.33×102 1.47×102 7.41×101
53 3.23×103 7.82×103 5.72×103 5.58×103 9.93×102
54 2.71×102 3.33×102 3.01×102 3.03×102 1.33×101
55 2.92×102 3.60×102 3.24×102 3.25×102 1.44×101
56 2.00×102 4.05×102 3.80×102 3.42×102 7.67×101
57 9.24×102 1.41×103 1.17×103 1.17×103 1.06×102
58 1.00×102 3.22×103 3.00×102 8.97×102 9.47×102
61 1.05×1020 1.73×1017 2.50×1019 1.09×1018 2.73×1018
62 4.00×1015 1.47×1014 7.55×1015 7.76×1015 1.51×1015
63 1.40×102 1.40×102 1.40×102 1.40×102 1.46×1014
64 1.34 6.23 3.60 3.68 1.08
65 6.25×1012 5.03×1011 1.38×1012 1.95×1012 1.26×1012
66 2.23×104 1.86×104 2.05×104 2.05×104 8.91×102
67 2.83×1041 6.96×1036 5.64×1038 4.97×1037 1.20×1036
68 4.50×102 4.50×102 4.50×102 4.50×102 1.15×1014
69 0.00 1.05×101 1.23×102 2.21×102 2.78×102
70 1.80×102 1.80×102 1.80×102 1.80×102 1.73×102
71 0.00 5.13×102 9.86×103 1.21×102 1.26×102
72 9.77×1045 1.86×1038 4.45×1042 7.39×1040 3.48×1039
73 4.50×102 4.50×102 4.50×102 4.50×102 5.86×1014
74 2.96×101 2.93×101 2.95×101 2.95×101 6.20×102
75 8.68×101 7.69×101 7.98×101 8.06×101 1.94×102
76 5.28×1017 1.48×1013 4.55×1015 1.70×1014 3.20×1014
77 3.57×1086 3.00×1076 9.68×1082 6.71×1078 4.24×1077
78 4.00 1.79×101 2.25 2.28 8.43×101
79 0.00 9.95×101 0.00 3.98×102 1.97×101
80 6.87×101 2.45×102 1.21×102 1.29×102 3.72×101
81 8.61×108 4.18 6.39×104 1.80×101 8.11×101
82 4.69×101 9.58×103 1.84×101 6.54×102 1.77×103
83 1.41×101 2.45×101 2.12×101 2.09×101 2.48×102
84 1.36×101 1.46 7.04×101 6.44×101 3.56×101
85 1.14×1017 2.44×1011 5.61×1015 5.00×1013 3.44×1012
86 1.49×1015 6.70×1012 8.00×1014 4.23×1013 1.06×1012
87 1.72×103 8.27×103 4.30×103 4.28×103 1.23×103
88 8.26×101 2.52×104 2.96×103 3.96×103 4.40×103
89 5.91×106 5.54×104 4.73×105 9.84×105 1.31×104
90 5.68×1014 1.14×1013 8.53×1014 8.53×1014 2.87×1014
91 4.50×102 3.08×102 4.48×102 4.42×102 2.56×101
92 3.05×1034 1.17×1034 1.89×1034 1.92×1034 4.75×1033
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 0.00 0.00 0.00 0.00 0.00

Table A6.

Error values for uDFOz5.

F No. Min Max Median Mean StdDev
2 5.68×1014 1.08×1012 1.14×1013 1.44×1013 1.81×1013
4 1.90×102 1.58×104 2.21×103 3.23×103 3.07×103
5 2.27×103 5.92×103 4.27×103 4.15×103 8.70×102
6 2.45×107 1.77×101 1.03×103 5.83×101 2.61
7 4.70×103 4.70×103 4.70×103 4.70×103 1.26×1012
8 2.00×101 2.00×101 2.00×101 2.00×101 8.67×103
11 2.21×101 3.72×101 2.98×101 2.93×101 3.78
12 9.30 2.99×104 3.31×103 6.59×103 7.56×103
13 1.11 2.67 1.72 1.77 3.88×101
14 1.22×101 1.40×101 1.36×101 1.35×101 4.03×101
15 6.29 5.13×102 3.00×102 3.08×102 1.43×102
16 1.67×102 6.16×102 3.81×102 3.69×102 1.07×102
17 1.67×102 9.08×102 3.85×102 4.06×102 1.23×102
18 9.29×102 1.26×103 9.65×102 9.87×102 6.76×101
19 9.23×102 1.17×103 9.76×102 9.93×102 6.05×101
20 9.31×102 1.15×103 9.85×102 1.00×103 5.70×101
21 5.00×102 1.25×103 8.07×102 8.38×102 3.39×102
22 9.75×102 1.34×103 1.14×103 1.14×103 7.94×101
23 5.00×102 1.24×103 8.16×102 8.48×102 3.40×102
24 2.00×102 1.35×103 2.00×102 6.66×102 5.22×102
25 1.70×103 1.89×103 1.76×103 1.77×103 3.88×101
31 0.00 0.00 0.00 0.00 0.00
32 5.35×104 2.91×105 1.51×105 1.54×105 5.35×104
33 5.72×105 1.36×109 7.98×107 1.73×108 2.42×108
34 9.83 7.60×102 4.07×101 7.83×101 1.18×102
35 0.00 1.14×1013 1.14×1013 8.19×1014 5.16×1014
36 1.94×103 8.47×101 9.99 1.39×101 1.87×101
37 5.87×101 2.47×102 1.35×102 1.43×102 4.41×101
38 2.08×101 2.10×101 2.09×101 2.09×101 6.06×102
39 2.09×101 4.27×101 3.30×101 3.26×101 5.21
40 1.23×102 2.63×101 5.42×102 7.05×102 5.04×102
41 0.00 3.98 5.68×1014 3.38×101 7.14×101
42 9.45×101 5.20×102 2.32×102 2.41×102 8.09×101
43 2.62×102 6.12×102 3.51×102 3.67×102 7.98×101
44 1.25×101 4.74×102 7.34×101 1.09×102 1.03×102
45 2.72×103 6.22×103 4.48×103 4.47×103 7.96×102
46 3.15×101 2.94 9.91×101 1.16 5.58×101
47 3.05×101 3.14×101 3.08×101 3.08×101 2.38×101
48 3.00×101 3.09×101 3.00×101 3.01×101 2.70×101
49 4.15×101 3.27 1.66 1.72 5.68×101
50 1.15×101 1.39×101 1.27×101 1.27×101 5.88×101
51 2.00×102 4.00×102 3.00×102 3.08×102 6.65×101
52 3.10×101 6.27×102 1.81×102 2.22×102 1.17×102
53 4.05×103 7.84×103 5.43×103 5.56×103 9.55×102
54 2.70×102 3.31×102 3.03×102 2.99×102 1.58×101
55 3.00×102 3.57×102 3.28×102 3.30×102 1.40×101
56 2.00×102 3.98×102 3.76×102 3.27×102 8.46×101
57 9.81×102 1.41×103 1.18×103 1.19×103 1.05×102
58 1.00×102 3.49×103 3.00×102 8.17×102 9.09×102
61 4.44×1021 1.34×1017 1.93×1019 6.36×1019 1.95×1018
62 4.00×1015 7.55×1015 7.55×1015 7.27×1015 9.74×1016
63 1.40×102 1.40×102 1.40×102 1.40×102 1.57×1014
64 1.90 8.79 3.73 4.08 1.47
65 1.03×1013 3.04×1011 1.38×1012 2.06×1012 1.81×1012
66 2.31×104 1.84×104 2.05×104 2.05×104 9.85×102
67 3.76×1040 2.34×1035 1.48×1037 9.51×1037 3.50×1036
68 4.50×102 4.50×102 4.50×102 4.50×102 1.41×1014
69 0.00 6.61×102 7.40×103 1.45×102 1.95×102
70 1.80×102 1.80×102 1.80×102 1.80×102 2.37×102
71 0.00 5.16×102 9.86×103 1.37×102 1.40×102
72 1.98×1045 3.87×1040 2.05×1042 2.57×1041 6.42×1041
73 4.50×102 4.50×102 4.50×102 4.50×102 5.63×1014
74 2.96×101 2.80×101 2.95×101 2.92×101 4.44×101
75 8.53×101 7.61×101 8.07×101 8.08×101 2.03×102
76 1.33×1016 6.31×1014 3.77×1015 8.03×1015 1.12×1014
77 5.35×1085 7.15×1077 8.41×1082 2.48×1078 1.07×1077
78 3.38 5.43×101 2.20 2.03 9.37×101
79 0.00 2.49×101 0.00 1.49 5.97
80 5.47×101 2.70×102 1.24×102 1.28×102 4.34×101
81 4.70×108 2.31×101 3.91×104 8.22×103 3.35×102
82 7.26 1.27×104 2.00×101 6.46×102 2.27×103
83 1.73×101 2.65×101 2.24×101 2.14×101 2.11×102
84 2.05×101 2.09 3.57×101 6.36×101 4.89×101
85 1.11×1016 1.43×1013 3.81×1015 1.64×1014 3.09×1014
86 3.54×1016 5.60×1012 7.21×1014 3.85×1013 9.08×1013
87 1.58×103 6.18×103 3.85×103 3.90×103 1.03×103
88 2.40×101 4.19×104 8.12×103 9.33×103 8.24×103
89 6.00×106 2.68×104 5.20×105 7.35×105 6.33×105
90 5.68×1014 1.14×1013 1.14×1013 9.21×1014 2.79×1014
91 4.50×102 3.28×102 4.48×102 4.44×102 1.73×101
92 3.87×1034 9.21×1033 1.89×1034 2.04×1034 6.84×1033
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 0.00 3.00 9.59×1014 3.30×101 7.60×101

Table A7.

Error values for GPSO.

F No. Min Max Median Mean StdDev
2 2.35×1011 2.12×108 9.42×1010 2.26×109 4.00×109
4 5.55×101 1.03×104 1.66×103 2.22×103 2.04×103
5 3.63×103 9.85×103 5.42×103 5.52×103 1.33×103
6 3.41×102 1.95×102 1.09×101 2.18×101 4.11×101
7 4.70×103 4.70×103 4.70×103 4.70×103 7.33×105
8 2.07×101 2.10×101 2.09×101 2.09×101 6.75×102
11 2.44×101 3.67×101 3.13×101 3.12×101 3.07
12 2.10×102 1.33×105 1.06×104 1.83×104 2.30×104
13 2.64 1.29×101 5.39 5.72 2.08
14 1.15×101 1.38×101 1.28×101 1.28×101 4.85×101
15 2.30×102 5.86×102 4.56×102 4.46×102 8.57×101
16 1.73×102 9.00×102 3.84×102 3.59×102 1.25×102
17 1.55×102 9.13×102 4.21×102 3.89×102 1.62×102
18 9.23×102 1.18×103 9.76×102 9.87×102 5.43×101
19 9.34×102 1.08×103 9.91×102 9.94×102 4.25×101
20 9.27×102 1.10×103 9.91×102 1.00×103 4.40×101
21 5.00×102 1.24×103 6.50×102 8.16×102 3.33×102
22 9.80×102 1.27×103 1.06×103 1.07×103 6.48×101
23 5.00×102 1.21×103 8.59×102 8.41×102 3.38×102
24 2.00×102 1.33×103 2.00×102 4.71×102 4.62×102
25 1.68×103 1.76×103 1.71×103 1.71×103 1.95×101
31 0.00 2.27×1013 2.27×1013 1.82×1013 9.19×1014
32 2.70×105 1.70×106 7.05×105 7.57×105 3.15×105
33 1.18×107 2.41×109 2.42×108 4.06×108 4.79×108
34 1.33×103 1.61×104 4.48×103 5.31×103 3.13×103
35 0.00 1.14×1013 1.14×1013 1.09×1013 2.25×1014
36 5.45×102 7.41×101 1.34×101 2.29×101 2.26×101
37 5.47×101 3.30×102 1.36×102 1.31×102 4.91×101
38 2.08×101 2.10×101 2.09×101 2.09×101 6.18×102
39 2.28×101 4.07×101 3.29×101 3.26×101 3.60
40 1.23×102 3.54×101 1.03×101 1.16×101 6.51×102
41 4.58×101 1.78×102 1.00×102 1.02×102 3.28×101
42 9.15×101 5.57×102 1.90×102 2.01×102 8.66×101
43 1.71×102 3.59×102 2.58×102 2.53×102 4.30×101
44 1.48×103 3.37×103 2.36×103 2.34×103 4.93×102
45 3.29×103 5.99×103 4.36×103 4.45×103 5.78×102
46 5.79×101 2.97 1.51 1.51 5.03×101
47 7.72×101 1.77×102 1.26×102 1.27×102 2.78×101
48 5.24×101 2.39×102 1.32×102 1.38×102 4.00×101
49 2.65 1.66×101 7.76 8.21 3.02
50 1.07×101 1.32×101 1.20×101 1.20×101 6.17×101
51 1.00×102 4.00×102 3.00×102 3.10×102 8.63×101
52 1.37×103 3.78×103 2.75×103 2.68×103 5.59×102
53 2.85×103 7.83×103 5.52×103 5.63×103 9.36×102
54 2.71×102 3.24×102 2.99×102 2.97×102 1.37×101
55 2.91×102 3.59×102 3.26×102 3.26×102 1.23×101
56 2.00×102 4.00×102 3.85×102 3.63×102 6.14×101
57 1.01×103 1.38×103 1.21×103 1.20×103 8.72×101
58 1.00×102 2.97×103 3.00×102 7.81×102 8.85×102
61 1.78×1039 7.00×1028 6.72×1034 2.99×1029 1.27×1028
62 7.55×1015 5.41 1.50 1.65 1.13
63 1.40×102 1.35×102 1.38×102 1.38×102 8.64×101
64 7.55×1015 5.13 2.41 2.56 1.08
65 1.38×1012 8.50×109 1.39×1011 2.46×1011 2.87×1011
66 1.56×104 1.06×104 1.31×104 1.32×104 1.04×103
67 6.71×1091 3.52×1080 1.56×1086 7.73×1082 4.99×1081
68 4.50×102 4.50×102 4.50×102 4.50×102 2.69×1014
69 0.00 8.06×102 7.40×103 1.61×102 2.03×102
70 1.80×102 1.80×102 1.80×102 1.80×102 2.91×102
71 0.00 6.39×102 8.63×103 1.20×102 1.37×102
72 7.65×1097 1.49×1086 6.08×1092 3.90×1088 2.16×1087
73 4.50×102 4.50×102 4.50×102 4.50×102 8.12×1015
74 2.78×101 2.18×101 2.44×101 2.44×101 1.10
75 8.25×101 7.69×101 7.85×101 7.86×101 1.15×102
76 7.85×1011 3.29×108 1.37×109 3.59×109 6.47×109
77 5.14×10152 3.58×10132 7.62×10145 7.17×10134 5.07×10133
78 4.53 1.62 3.26 3.23 5.53×101
79 4.18×101 1.09×102 7.01×101 7.08×101 1.50×101
80 5.57×101 1.72×102 9.50×101 9.93×101 2.95×101
81 2.49×103 1.76×102 1.03×101 2.23×101 4.59×101
82 1.06×101 9.07×103 2.40×101 5.56×102 1.57×103
83 1.00×101 4.00×101 1.73×101 1.75×101 5.22×102
84 5.31 1.08×101 8.76 8.55 1.17
85 4.55×1011 2.94×108 1.41×109 2.42×109 4.46×109
86 3.49×1010 1.61×106 9.79×109 1.24×107 3.25×107
87 3.72×103 7.66×103 5.54×103 5.63×103 1.08×103
88 3.66×102 8.10×104 1.71×104 2.08×104 1.91×104
89 1.29×106 3.50×103 3.36×105 1.71×104 5.18×104
90 5.68×1014 1.14×1013 1.14×1013 9.89×1014 2.52×1014
91 4.50×102 4.36×102 4.45×102 4.44×102 4.00
92 2.12×1033 7.13×1029 6.51×1031 2.64×1032 4.63×1032
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 1.45 1.19×101 5.57 5.73 2.41

Table A8.

Error values for LPSO.

F No. Min Max Median Mean StdDev
2 7.35×102 5.25 1.03 1.32 1.10
4 3.43×103 2.74×104 1.49×104 1.43×104 4.77×103
5 4.20×103 1.17×104 5.93×103 6.28×103 1.42×103
6 6.36×101 3.30×102 2.22×101 5.16×101 6.70×101
7 4.70×103 4.70×103 4.70×103 4.70×103 4.00×105
8 2.07×101 2.10×101 2.09×101 2.09×101 9.01×102
11 2.50×101 3.76×101 3.09×101 3.08×101 2.40
12 8.61×102 3.56×104 1.00×104 1.11×104 7.44×103
13 3.50 1.03×101 5.92 5.98 1.50
14 1.16×101 1.32×101 1.28×101 1.27×101 3.35×101
15 2.27×102 5.14×102 3.84×102 3.70×102 6.77×101
16 1.18×102 5.00×102 2.56×102 2.74×102 9.87×101
17 1.55×102 5.43×102 2.84×102 3.11×102 9.38×101
18 9.12×102 1.04×103 9.35×102 9.40×102 2.07×101
19 8.00×102 1.03×103 9.33×102 9.36×102 2.94×101
20 8.00×102 9.71×102 9.36×102 9.35×102 2.38×101
21 5.00×102 1.17×103 5.00×102 5.72×102 1.80×102
22 9.69×102 1.15×103 1.06×103 1.06×103 5.51×101
23 5.00×102 1.18×103 5.00×102 5.70×102 1.78×102
24 2.00×102 2.00×102 2.00×102 2.00×102 1.44×1012
25 1.66×103 1.71×103 1.68×103 1.68×103 9.70
31 0.00 2.27×1013 0.00 2.73×1014 7.46×1014
32 3.36×105 7.09×106 2.49×106 2.54×106 1.21×106
33 1.75×107 4.01×109 3.28×108 8.00×108 1.00×109
34 2.25×104 9.06×104 4.35×104 4.46×104 1.28×104
35 1.14×1013 1.14×1013 1.14×1013 1.14×1013 0.00
36 5.32×101 7.76×101 1.63×101 2.38×101 1.95×101
37 5.70×101 1.75×102 1.09×102 1.11×102 2.51×101
38 2.08×101 2.11×101 2.10×101 2.10×101 4.56×102
39 2.51×101 3.67×101 3.21×101 3.20×101 2.50
40 2.46×102 3.23×101 1.28×101 1.34×101 5.92×102
41 4.08×101 1.41×102 7.01×101 7.36×101 1.79×101
42 5.87×101 1.79×102 1.12×102 1.15×102 3.15×101
43 9.63×101 2.32×102 1.59×102 1.67×102 3.63×101
44 1.71×103 3.65×103 2.87×103 2.84×103 4.36×102
45 2.67×103 5.50×103 4.19×103 4.26×103 6.16×102
46 6.70×101 2.48 1.49 1.47 3.48×101
47 7.86×101 1.51×102 1.05×102 1.08×102 1.69×101
48 6.57×101 1.56×102 1.04×102 1.06×102 1.95×101
49 3.97 1.20×101 6.86 7.22 2.00
50 1.03×101 1.24×101 1.16×101 1.16×101 4.57×101
51 1.00×102 4.00×102 3.00×102 2.59×102 7.42×101
52 1.81×103 4.90×103 3.51×103 3.49×103 6.68×102
53 3.72×103 7.16×103 5.35×103 5.39×103 8.47×102
54 2.46×102 3.09×102 2.86×102 2.86×102 1.23×101
55 2.96×102 3.36×102 3.20×102 3.20×102 8.24
56 2.00×102 3.89×102 2.00×102 2.39×102 7.31×101
57 8.95×102 1.33×103 1.17×103 1.16×103 9.78×101
58 1.00×102 1.72×103 3.00×102 3.20×102 2.06×102
61 6.41×1024 3.21×1022 6.81×1023 9.09×1023 6.77×1023
62 4.00×1015 7.55×1015 7.55×1015 6.91×1015 1.38×1015
63 1.40×102 1.40×102 1.40×102 1.40×102 1.82×1014
64 4.00×1015 2.96 1.34 1.11 8.42×101
65 1.06×1012 1.10×1010 1.39×1011 2.40×1011 2.43×1011
66 1.45×104 1.11×104 1.28×104 1.27×104 8.79×102
67 2.93×1037 4.48×1035 4.07×1036 7.06×1036 8.94×1036
68 4.50×102 4.50×102 4.50×102 4.50×102 1.99×1014
69 0.00 1.97×102 0.00 1.84×103 4.16×103
70 1.80×102 1.80×102 1.80×102 1.80×102 4.71×103
71 0.00 1.48×102 0.00 2.07×103 4.12×103
72 2.37×1042 5.44×1039 1.71×1040 5.24×1040 1.00×1039
73 4.50×102 4.50×102 4.50×102 4.50×102 8.39×107
74 2.67×101 2.23×101 2.46×101 2.45×101 8.05×101
75 8.12×101 7.85×101 7.85×101 7.91×101 6.97×103
76 3.41×102 8.93 4.68×101 8.03×101 1.30
77 1.75×1063 4.40×1059 1.60×1061 2.34×1060 6.64×1060
78 4.40 2.79 3.46 3.46 3.17×101
79 4.18×101 1.10×102 7.36×101 7.19×101 1.47×101
80 5.87×101 1.36×102 8.81×101 9.03×101 1.94×101
81 2.30×101 1.49×102 2.24×101 3.54×101 3.79×101
82 2.15×101 5.65×103 2.61×101 1.93×102 8.06×102
83 1.00×101 1.41×101 1.00×101 1.20×101 2.09×102
84 8.16 1.13×101 1.01×101 9.94 7.53×101
85 9.40×102 3.27 5.55×101 6.52×101 5.99×101
86 2.68×101 1.98×101 1.30 2.43 3.33
87 3.31×103 1.01×104 6.24×103 6.31×103 1.41×103
88 8.95×102 3.21×104 9.01×103 9.81×103 6.99×103
89 2.82×102 4.83×101 1.29×101 1.70×101 1.22×101
90 5.68×1014 1.14×1013 5.68×1014 5.91×1014 1.13×1014
91 4.50×102 4.36×102 4.46×102 4.45×102 3.31
92 2.57×1031 9.33×1026 1.01×1029 2.83×1030 6.05×1030
93 0.00 0.00 0.00 0.00 0.00
94 0.00 2.49×1014 0.00 1.28×1015 3.98×1015
95 0.00 2.31×101 0.00 4.62×103 3.27×102

Table A9.

Error values for DE.

F No. Min Max Median Mean StdDev
2 2.12×105 1.16 1.56×103 1.91×102 8.94×102
4 4.27×103 6.27×104 2.38×104 2.49×104 1.12×104
5 2.42×103 8.98×103 4.13×103 4.20×103 1.04×103
6 7.29×105 1.90×102 1.03×101 2.24×101 3.15×101
7 4.70×103 4.70×103 4.70×103 4.70×103 7.73×108
8 2.09×101 2.11×101 2.10×101 2.10×101 6.48×102
11 1.15×101 4.06×101 1.73×101 1.77×101 5.19
12 1.58×102 9.24×104 1.41×104 1.84×104 1.58×104
13 1.97 1.12×101 3.82 4.21 1.96
14 1.25×101 1.35×101 1.29×101 1.29×101 2.77×101
15 2.04×102 5.62×102 4.12×102 4.05×102 8.02×101
16 7.74×101 5.02×102 2.19×102 2.87×102 1.66×102
17 2.25×102 1.02×103 3.98×102 4.39×102 1.65×102
18 8.00×102 1.01×103 9.42×102 9.48×102 3.06×101
19 9.22×102 9.91×102 9.46×102 9.48×102 1.62×101
20 8.00×102 1.02×103 9.42×102 9.42×102 4.21×101
21 5.00×102 1.21×103 5.00×102 8.00×102 3.32×102
22 9.60×102 1.19×103 1.02×103 1.03×103 4.88×101
23 5.00×102 1.19×103 5.00×102 7.68×102 3.16×102
24 2.00×102 1.28×103 2.55×102 6.21×102 4.78×102
25 1.67×103 1.76×103 1.70×103 1.70×103 1.92×101
31 0.00 0.00 0.00 0.00 0.00
32 7.67×105 1.10×107 3.78×106 4.04×106 2.29×106
33 4.51×106 6.89×109 2.74×108 5.94×108 1.10×109
34 6.67×103 3.77×104 2.11×104 2.08×104 7.05×103
35 0.00 1.14×1013 1.14×1013 7.50×1014 5.44×1014
36 7.21 8.02×101 4.11×101 4.70×101 2.70×101
37 1.87×101 1.77×102 8.83×101 9.25×101 3.26×101
38 2.08×101 2.11×101 2.10×101 2.10×101 6.33×102
39 1.37×101 2.46×101 1.91×101 1.92×101 2.91
40 4.20×102 1.35×101 1.44 1.64 2.02
41 3.98×101 1.69×102 8.86×101 9.01×101 2.90×101
42 4.18×101 2.29×102 1.17×102 1.22×102 5.00×101
43 1.12×102 2.91×102 1.80×102 1.82×102 3.86×101
44 5.55×102 2.06×103 1.12×103 1.13×103 3.18×102
45 6.46×103 8.34×103 7.55×103 7.48×103 3.65×102
46 1.99 3.47 2.95 2.90 3.19×101
47 5.75×101 1.79×102 9.62×101 9.90×101 2.59×101
48 7.79×101 2.27×102 1.24×102 1.31×102 3.74×101
49 4.35 9.32×101 1.97×101 2.56×101 1.86×101
50 1.10×101 1.27×101 1.19×101 1.19×101 4.14×101
51 1.00×102 4.00×102 3.00×102 3.04×102 7.55×101
52 3.69×102 2.13×103 1.23×103 1.24×103 4.74×102
53 6.41×103 8.64×103 7.64×103 7.56×103 5.01×102
54 2.33×102 2.84×102 2.60×102 2.59×102 1.24×101
55 2.59×102 3.03×102 2.86×102 2.86×102 8.55
56 2.00×102 3.77×102 3.44×102 3.18×102 6.02×101
57 5.83×102 1.08×103 8.51×102 8.35×102 9.21×101
58 1.00×102 1.84×103 6.85×102 7.45×102 5.12×102
61 6.90×1042 1.50×1013 1.06×1034 3.01×1015 2.13×1014
62 1.34 9.66 3.49 3.94 1.78
63 1.39×102 1.31×102 1.36×102 1.36×102 2.05
64 4.00×1015 6.96 3.43 3.50 1.35
65 1.38×1012 5.00×1010 2.99×1011 3.61×1011 2.89×1011
66 1.84×104 1.26×104 1.55×104 1.53×104 1.38×103
67 4.22×1097 2.08×1085 3.43×1091 7.40×1087 3.55×1086
68 4.50×102 4.50×102 4.50×102 4.50×102 0.00
69 0.00 3.04×101 3.32×102 5.64×102 6.23×102
70 1.80×102 1.79×102 1.80×102 1.80×102 1.30×101
71 0.00 6.12×102 2.40×109 8.61×103 1.23×102
72 1.67×10103 6.50×1090 3.00×1097 1.34×1091 9.19×1091
73 4.50×102 4.49×102 4.50×102 4.50×102 1.04×101
74 2.80×101 2.25×101 2.66×101 2.64×101 1.13
75 7.85×101 7.51×101 7.69×101 7.76×101 8.61×103
76 1.30×105 1.01 3.84×104 4.70×102 1.83×101
77 7.50×10133 6.88×10120 7.06×10128 1.41×10121 9.73×10121
78 3.63 1.27 2.06 1.78 1.08
79 2.09×101 7.66×101 3.83×101 3.96×101 1.12×101
80 3.18×101 2.19×102 1.09×102 1.15×102 6.10×101
81 1.83×103 3.38×102 7.17 2.27×101 5.09×101
82 1.87×101 1.13×104 1.61×102 1.23×103 2.81×103
83 1.41×101 6.71×101 1.87×101 2.32×101 1.03×101
84 5.43 9.79 8.56 8.37 8.78×101
85 3.15×105 5.20×101 1.25×103 2.56×102 9.67×102
86 5.54×104 1.23×101 2.93×101 1.11 2.19
87 2.59×103 6.29×103 4.34×103 4.39×103 9.33×102
88 1.33×103 5.75×104 1.56×104 1.68×104 1.35×104
89 1.76×101 4.06×101 2.99×101 2.94×101 5.93
90 5.68×1014 2.15×108 5.68×1014 4.31×1010 3.04×109
91 4.49×102 4.35×102 4.44×102 4.44×102 3.27
92 3.87×1034 6.10×1032 9.52×1033 1.08×1034 8.92×1033
93 0.00 0.00 0.00 0.00 0.00
94 0.00 0.00 0.00 0.00 0.00
95 8.51×101 9.83 3.81 4.08 1.90

Funding

This research received no external funding.

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.

Footnotes

Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

References

  • 1.Trelea I.C. The particle swarm optimization algorithm: Convergence analysis and parameter selection. Inf. Process. Lett. 2003;85:317–325. doi: 10.1016/S0020-0190(02)00447-7. [DOI] [Google Scholar]
  • 2.Olorunda O., Engelbrecht A.P. Measuring exploration/exploitation in particle swarms using swarm diversity; Proceedings of the 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence); Hong Kong, China. 1–6 June 2008; pp. 1128–1134. [Google Scholar]
  • 3.al-Rifaie M.M. Dispersive Flies Optimisation; Proceedings of the IEEE 2014 Federated Conference on Computer Science and Information Systems; Warsaw, Poland. 7–10 September 2014; pp. 529–538. [DOI] [Google Scholar]
  • 4.al-Rifaie M.M. Perceived Simplicity and Complexity in Nature; Proceedings of the AISB 2017: Computational Architectures for Animal Cognition; Bath, UK. 18–21 April 2017; pp. 299–305. [Google Scholar]
  • 5.Kennedy J. The particle swarm: Social adaptation of knowledge; Proceedings of the IEEE International Conference on Evolutionary Computation; Indianapolis, IN, USA. 13–16 April 1997; pp. 303–308. [Google Scholar]
  • 6.Storn R., Price K. Differential evolution—A simple and efficient heuristic for global optimization over continuous spaces. J. Glob. Optim. 1997;11:341–359. doi: 10.1023/A:1008202821328. [DOI] [Google Scholar]
  • 7.Dorigo M., Di Caro G. Ant colony optimization: A new meta-heuristic; Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406); Washington, DC, USA. 6–9 July 1999; pp. 1470–1477. [Google Scholar]
  • 8.Hansen N., Müller S.D., Koumoutsakos P. Reducing the time complexity of the derandomized evolution strategy with covariance matrix adaptation (CMA-ES) Evol. Comput. 2003;11:1–18. doi: 10.1162/106365603321828970. [DOI] [PubMed] [Google Scholar]
  • 9.Back T., Fogel D.B., Michalewicz Z. Handbook of Evolutionary Computation. IOP Publishing Ltd.; Bristol, UK: 1997. [Google Scholar]
  • 10.Yang X.S. International Symposium on Stochastic Algorithms. Springer; Berlin/Heidelberg, Germany: 2009. Firefly algorithms for multimodal optimization; pp. 169–178. [Google Scholar]
  • 11.Kennedy J. Bare Bones Particle Swarms; Proceedings of the 2003 IEEE Swarm Intelligence Symposium (SIS’03); Indianapolis, IN, USA. 26 April 2003; pp. 80–87. [Google Scholar]
  • 12.Omran M.G., Engelbrecht A.P., Salman A. Bare bones differential evolution. Eur. J. Oper. Res. 2009;196:128–139. doi: 10.1016/j.ejor.2008.02.035. [DOI] [Google Scholar]
  • 13.al-Rifaie M.M., Aber A. Recent Advances in Computational Optimization. Springer; Berlin/Heidelberg, Germany: 2016. Dispersive Flies Optimisation and Medical Imaging; pp. 183–203. [Google Scholar]
  • 14.Lazov B., Vetsov T. Sum of Three Cubes via Optimisation. arXiv. 20202005.09710 [Google Scholar]
  • 15.Acharya B.B., Dhakal S., Bhattarai A., Bhattarai N. PID speed control of DC motor using meta-heuristic algorithms. Int. J. Power Electron. Drive Syst. 2021;12:822–831. [Google Scholar]
  • 16.Alhakbani H. Ph.D. Thesis. Goldsmiths, University of London; London, UK: 2018. Handling Class Imbalance Using Swarm Intelligence Techniques, Hybrid Data and Algorithmic Level Solutions. [Google Scholar]
  • 17.Oroojeni H., al-Rifaie M.M., Nicolaou M.A. Deep Neuroevolution: Training Deep Neural Networks for False Alarm Detection in Intensive Care Units; Proceedings of the IEEE European Association for Signal Processing (EUSIPCO); Rome, Italy. 3–7 September 2018; pp. 1157–1161. [DOI] [Google Scholar]
  • 18.al-Rifaie M.M., Ursyn A., Zimmer R., Javid M.A.J. International Conference on Evolutionary and Biologically Inspired Music and Art. Springer; Cham, Switzerland: 2017. On symmetry, aesthetics and quantifying symmetrical complexity; pp. 17–32. [Google Scholar]
  • 19.Aparajeya P., Leymarie F.F., al-Rifaie M.M. Swarm-Based Identification of Animation Key Points from 2D-medialness Maps. In: Ekárt A., Liapis A., Castro Pena M.L., editors. International Conference on Computational Intelligence in Music, Sound, Art and Design. Springer International Publishing; Cham, Switzerland: 2019. pp. 69–83. [Google Scholar]
  • 20.al-Rifaie M.M., Cavazza M. Beer Organoleptic Optimisation: Utilising Swarm Intelligence and Evolutionary Computation Methods; Proceedings of the 2020 Genetic and Evolutionary Computation Conference Companion (GECCO’20); Cancún, Mexico. 8–12 July 2020; New York, NY, USA: Association for Computing Machinery; 2020. pp. 255–256. [DOI] [Google Scholar]
  • 21.al-Rifaie M.M., Leymarie F.F., Latham W., Bishop M. Swarmic autopoiesis and computational creativity. Connect. Sci. 2017;29:276–294. doi: 10.1080/09540091.2016.1274960. [DOI] [Google Scholar]
  • 22.Blackwell T. A Study of Collapse in Bare Bones Particle Swarm Optimisation. IEEE Trans. Evol. Comput. 2012;16:354–372. doi: 10.1109/TEVC.2011.2136347. [DOI] [Google Scholar]
  • 23.Krohling R.A., Mendel E. Bare bones particle swarm optimization with Gaussian or Cauchy jumps; Proceedings of the IEEE Congress on Evolutionary Computation (CEC’09); Trondheim, Norway. 18–21 May 2009; pp. 3285–3291. [Google Scholar]
  • 24.al-Rifaie M.M., Blackwell T. Bare Bones Particle Swarms with Jumps. In: Birattari M., Blum C., Christensen A.L., Engelbrecht A.P., Groß R., Dorigo M., Stützle T., editors. ANTS 2012, Lecture Notes in Computer Science Series. Volume 7461. Springer; Heidelberg/Berlin, Germany: 2012. pp. 49–60. [Google Scholar]
  • 25.al-Rifaie M.M., Blackwell T. Cognitive Bare Bones Particle Swarm Optimisation with Jumps. Int. J. Swarm Intell. Res. (IJSIR) 2016;7:1–31. doi: 10.4018/IJSIR.2016010101. [DOI] [Google Scholar]
  • 26.Storn R., Price K. Differential Evolution—A Simple and Efficient Adaptive Scheme for Global Optimization over Continuous Spaces. TR-95-012. [(accessed on 21 March 2012)];1995 Available online: http://www.icsi.berkeley.edu/~storn/litera.html.
  • 27.Shi Y., Eberhart R.C. Lecture Notes in Computer Science. Springer; Berlin/Heidelberger, Germany: 1998. Parameter selection in particle swarm optimization; pp. 591–600. [Google Scholar]
  • 28.Blackwell T., Kennedy J. Impact of communication topology in particle swarm optimization. IEEE Trans. Evol. Comput. 2019;23:689–702. doi: 10.1109/TEVC.2018.2880894. [DOI] [Google Scholar]
  • 29.Suganthan P.N., Hansen N., Liang J.J., Deb K., Chen Y.P., Auger A., Tiwari S. Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization. KanGAL Rep. 2005;2005005:2005. [Google Scholar]
  • 30.Liang J., Qu B., Suganthan P., Hernández-Díaz A.G. Problem Definitions and Evaluation Criteria for the CEC 2013 Special Session on Real-Parameter Optimization. Volume 201212. Computational Intelligence Laboratory, Zhengzhou University; Zhengzhou, China: Nanyang Technological University; Singapore: 2013. pp. 281–295. Technical Report. [Google Scholar]
  • 31.Engelbrecht A.P. Particle swarm optimization: Global best or local best?; Proceedings of the IEEE 2013 BRICS Congress on Computational Intelligence and 11th Brazilian Congress on Computational Intelligence; Ipojuca, Brazil. 8–11 September 2013; pp. 124–135. [Google Scholar]
  • 32.al-Rifaie M.M., Bishop J.M., Blackwell T. Information sharing impact of stochastic diffusion search on differential evolution algorithm. Memetic Comput. 2012;4:327–338. doi: 10.1007/s12293-012-0094-y. [DOI] [Google Scholar]
  • 33.Wilcoxon F., Katti S., Wilcox R.A. Critical Values and Probability Levels for the Wilcoxon Rank Sum Test and the Wilcoxon Signed Rank Test. Pearl River; New York, NY, USA: 1963. pp. 171–259. [Google Scholar]
  • 34.Bruyant P.P. Analytic and iterative reconstruction algorithms in SPECT. J. Nucl. Med. 2002;43:1343–1358. [PubMed] [Google Scholar]
  • 35.Shepp L.A., Logan B.F. The Fourier reconstruction of a head section. IEEE Trans. Nucl. Sci. 1974;21:21–43. doi: 10.1109/TNS.1974.6499235. [DOI] [Google Scholar]
  • 36.Cheng S., Shi Y. Diversity control in particle swarm optimization; Proceedings of the 2011 IEEE Symposium on Swarm Intelligence; Paris, France. 11–15 April 2011; pp. 1–9. [Google Scholar]
  • 37.Wang H., Rahnamayan S., Sun H., Omran M.G. Gaussian bare-bones differential evolution. IEEE Trans. Cybern. 2013;43:634–647. doi: 10.1109/TSMCB.2012.2213808. [DOI] [PubMed] [Google Scholar]

Associated Data

This section collects any data citations, data availability statements, or supplementary materials included in this article.

Data Availability Statement

Not applicable.


Articles from Entropy are provided here courtesy of Multidisciplinary Digital Publishing Institute (MDPI)

RESOURCES