Next Article in Journal
A Vector-Based Computational Model of Multimodal Insect Learning Walks
Previous Article in Journal
Development of Variable Elastic Band with Adjustable Elasticities for Semi-Passive Exosuits
Previous Article in Special Issue
High-Accuracy Lower-Limb Intent Recognition: A KPCA-ISSA-SVM Approach with sEMG-IMU Sensor Fusion
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

An Economic Scheduling Management Method for Microgrids Using Multi-Strategy Improved Sand Cat Swarm Optimization

1
School of Business, Macau University of Science and Technology, Taipa, Macau 999078, China
2
School of Automation, Beijing Information Science and Technology University, No. 55 Taihang Road, Changping District, Beijing 102206, China
3
School of Humanities and Public Administration, Jiangxi Agricultural University, Nanchang 330045, China
*
Author to whom correspondence should be addressed.
These authors contributed equally to this work.
Biomimetics 2025, 10(11), 735; https://doi.org/10.3390/biomimetics10110735
Submission received: 17 September 2025 / Revised: 16 October 2025 / Accepted: 29 October 2025 / Published: 2 November 2025

Abstract

With the rise of the digital economy, energy management has become increasingly intelligent and data-driven. Environmental, Social, and Governance (ESG) considerations have emerged as a key driver of corporate competitiveness, while microgrid scheduling serves as an essential pathway for enterprises to achieve carbon reduction, attract green investment, and meet low-carbon development goals. However, traditional microgrid economic dispatch algorithms often suffer from low optimization efficiency, limited scalability, and poor flexibility. To address these challenges, this paper proposes a multi-strategy improved sand cat swarm optimization (MISCSO) algorithm for the economic scheduling of microgrids. First, a distribution-optimized initialization method based on adaptive diversity guidance is developed to enhance the quality of the initial population. This approach improves algorithmic performance by generating individuals in high-potential regions to ensure solution quality while maintaining population diversity through the inclusion of individuals from low-potential regions. Subsequently, an elite-centered global random movement strategy is introduced to balance elite guidance and global exploration, thereby improving both convergence speed and optimization accuracy. In addition, an adaptive elastic boundary mapping mechanism is proposed to effectively handle boundary violations, striking a balance between boundary constraints and global search capability. To evaluate the effectiveness of MISCSO, it is compared with 11 state-of-the-art algorithms using the IEEE CEC2017 benchmark set, and statistical analyses are conducted to assess performance differences. Experimental results demonstrate that MISCSO achieves superior optimization accuracy, convergence performance, and robustness. Finally, the applicability of MISCSO is verified through its implementation in microgrid economic scheduling, where it achieves outstanding optimization results.

1. Introduction

ESG (Environmental, Social, and Governance) has become a key competitive advantage for enterprises (such as attracting green investments and meeting customers’ low-carbon requirements), and microgrid dispatch serves as a critical means for enterprises to achieve their “carbon reduction” goals. In this process, microgrid dispatch serves as an efficient and flexible energy management tool, providing viable technical support for enterprises to achieve low-carbon operational goals [1]. By optimizing dispatch strategies, enterprises can better integrate distributed renewable energy, energy storage, and load demands, significantly reducing carbon emissions while ensuring energy supply security and economic efficiency. Simultaneously, microgrid dispatch enhances transparency and controllability in energy usage, providing data support for corporate ESG disclosure and green audits. This not only aids enterprises in achieving carbon reduction targets but also strengthens their competitive edge in green investment markets and international supply chains.
Moreover, the current era of limited energy resources demands higher standards for efficient energy management and intelligent decision-making. As an integrated platform that combines distributed energy systems with digital management technologies, research on microgrid economic dispatch not only enables enterprises to achieve their “carbon reduction” goals but also supports enhanced decision-making and operational efficiency through data-driven approaches. From a management perspective, microgrid economic dispatch provides a methodological foundation for the digital transformation of energy management while offering practical support for industrial optimization and value creation within the digital economy. Consequently, researching microgrid economic dispatch holds significant importance for advancing intelligent energy management and enhancing operational efficiency in the digital economy.
Existing microgrid economic dispatch algorithms can be primarily categorized into traditional optimization algorithms [2], heuristic algorithms [3], and data-driven approaches [4]. Traditional optimization algorithms include linear programming and mixed-integer linear programming. These algorithms typically rely on precise mathematical models and impose stringent requirements on system characteristics and constraints. However, the high variability of renewable energy sources and significant load uncertainty in actual microgrids often make it difficult to fully satisfy the model assumptions. Artificial intelligence and data-driven approaches encompass methods like reinforcement learning and deep reinforcement learning. These methods heavily depend on high-quality data, exhibit poor interpretability, involve high training and computational costs, and possess limited generalization capabilities. Additionally, integrating them into practical management systems presents significant challenges.
In contrast, intelligent optimization algorithms leverage robust global search capabilities, adaptability to nonlinear problems, multi-objective optimization capabilities, and real-time adaptive scheduling. They not only enhance the economic viability and operational efficiency of microgrids but also fully utilize data resources to provide intelligent support for energy management and corporate decision-making within the digital economy [5]. Therefore, the application of intelligent optimization algorithms in microgrid economic dispatch balances theoretical feasibility, computational efficiency, and practical management value. It has emerged as a key methodology for advancing digital energy management, leading an increasing number of researchers to adopt intelligent optimization algorithms to address microgrid economic dispatch challenges.
For example, Wang et al. established an economic dispatch model for microgrids by integrating electric vehicles with microgrid systems, aiming to minimize operational costs and pollutant treatment expenses [6]. They proposed a multi-strategy real-valued evolutionary algorithm (RVEA) to enhance the economic and environmental protection of microgrid systems, thereby promoting their optimized operation. To provide an uninterruptible power supply with improved voltage regulation (VR), Selvaraj et al. proposed a novel method for optimizing power dispatch in microgrids based on the Raven Search Algorithm [7], specifically for effective load scheduling within distribution systems. Experimental results demonstrate that the Raven Search Algorithm significantly optimizes load scheduling, thereby substantially reducing power losses and enhancing voltage profiles across all scenarios. To achieve efficient optimization dispatch of microgrid cluster (MGC) systems while ensuring the safe and stable operation of the power grid, Wang et al. developed a multi-objective coordinated optimization fitness function based on operational costs, environmental costs, and energy storage losses [8]. They proposed an improved GWO (CDGWO) algorithm for optimization, effectively realizing multi-objective coordinated optimization dispatch of MGC systems. This approach significantly enhances the overall economic efficiency of MGCs while guaranteeing a reliable power supply.
However, as the No Free Lunch Theorem (NFL) states, no single algorithm can solve all optimization problems. Researchers must tailor and refine algorithms to address their specific challenges, ensuring optimal performance for their particular problems. For instance, Xie et al. proposed three strategies to enhance the rime optimization algorithm based on their specific three-dimensional drone path planning problem [9]. They demonstrated the effectiveness of these improvements through three test datasets and ultimately applied them to drone path planning. Compared to the original RIME algorithm, their approach yielded significantly better results. To address multi-level image segmentation challenges, Yue et al. integrated the Invasive Weed Optimization algorithm (IWO) and Grasshopper Optimization Algorithm (GOA) [10], enhancing search precision and accelerating convergence rates. By incorporating a random walk strategy, they further improved algorithm performance, achieving excellent results in image segmentation tasks. Yue et al. proposed a Monarch Butterfly Algorithm based on particle swarm optimization to enhance coverage in wireless sensor networks (WSNs) [11]. This approach optimizes energy consumption, operational performance, and coverage range. Experimental results demonstrate that the proposed improved method effectively reduces network costs while enhancing network coverage and node utilization more efficiently than the original single method.
The sand cat swarm optimization is a nature-inspired optimization algorithm [12]. Inspired by the Sand Cat’s ability to detect low frequencies below 2 kHz and its remarkable skill in digging out prey, it optimizes problems by simulating these two behaviors. This approach enables the discovery of good solutions with fewer parameters. Experiments demonstrate its outstanding performance in problems such as welding beam design and tension/compression spring design. Furthermore, despite SCSO’s already solid performance, it inevitably exhibits certain shortcomings when addressing problems across various domains. This necessitates targeted improvements by researchers to better tailor it for solving problems specific to each field. For instance, Yao et al. proposed three improvement strategies based on SCSO to address their specific feature selection problem: a novel adversarial learning strategy, a new exploration mechanism, and a biological elimination update mechanism [13]. Experiments demonstrated that the proposed algorithm performed better in feature selection tasks, achieving strong optimization capabilities. To address path planning for unmanned aerial vehicles (UAVs) in complex environments with multiple threats, Zhan et al. proposed an improved SCSO algorithm that integrates chaotic mapping initialization with a simulated annealing–particle swarm hybrid development strategy [14]. Experimental results demonstrate that the proposed strategy not only significantly enhances convergence speed while maintaining algorithmic accuracy but also provides an effective approach for improving SCSO performance.
Therefore, to address the problem of economic dispatch in microgrids, based on the above research, this paper proposes a multi-strategy improved SCSO (MISCSO). The specific contributions are as follows:
  • To enhance the quality of the initial population, a distribution optimization initialization based on adaptive diversity guidance is proposed. This method enhances algorithm performance by generating individuals in high-potential regions to ensure initial solution quality, while also generating individuals in low-potential regions to maintain population diversity.
  • We proposed an elite-centered global random movement strategy that balances elite guidance and global diversity, enhancing both the convergence speed and accuracy of the algorithm.
  • We propose an adaptive elastic boundary mapping method to effectively handle out-of-bound individuals, balancing boundary constraints with enhanced global search capabilities to improve algorithm performance.
  • The algorithms were qualitatively analyzed using 30 test functions from the IEEE CEC2017 test set and compared with 11 other algorithms to obtain competitive results. Most importantly, the algorithms were statistically analyzed to fully analyze the superior performance of MISCSO.
  • The MISCSO is applied to the problem of economic dispatch in microgrids and compared with other comparative algorithms.
The next part of this paper is organized as follows: Section 2 gives a brief introduction of the SCSO; Section 3 details the three improved strategies proposed in this paper for addressing the problem of economic dispatch in microgrids; in Section 4, we apply the MISCSO in numerical optimization experiments and analyze the experimental results in detail; in Section 5, we apply the algorithm to the problem of economic dispatch in microgrids and provide a comprehensive analysis of its advantages and disadvantages; and in Section 6, we summarize and provide an outlook on the work in this paper to clarify the direction of future work.

2. Sand Cat Swarm Optimization (SCSO)

Since the economic dispatch management algorithm for microgrids presented in this paper is an enhanced version of SCSO, this section provides a brief introduction to the original SCSO algorithm. Detailed specifications are as follows:

2.1. Initial Population

When solving optimization problems, we need to define the values of relevant variables based on the specific problem being optimized. For example, in particle swarm optimization, population individuals are referred to as particle positions; in gray wolf optimizer, they are called gray wolf positions; and in SCSO, they are termed sand cat positions. Like most optimization algorithms, SCSO employs a random initialization method to obtain the initial population. This involves randomly generating individuals within the problem’s search space, with the initialization formula shown in Equation (1).
D = D 1 D i D N N × d i m = d 1,1 d 1 , j d 1 , d i m d i , 1 d i , j d i , d i m d N , 1 d N , j d N , d i m N × d i m ,
where D denotes the initial population of SCSO, D i denotes the i -th sand cat, N denotes the population size, and m denotes the problem dimension. d i , j can be calculated using Equation (2).
d i , j = l b j + r a n d × ( u b j l b j ) ,
where u b j and l b j represent the upper and lower bounds of the optimization problem, respectively, while r a n d denotes a random number between 0 and 1.

2.2. Searching the Prey (Exploration)

After initializing the sand cat population, the sand cats must search for prey to sustain their daily lives. At this stage, sand cats rely on low-frequency noise emission to locate prey. To simulate this behavior in mathematical modeling, Amir Seyyedabbasi et al. modeled low-frequency noise as a parameter linearly decreasing from 2 to 0 [12]. This indicates that sand cats exhibit peak sensitivity to prey detection during the early algorithmic phase, with sensitivity gradually diminishing as they approach their target. The variation in low-frequency noise ( r G ) with iteration count can be expressed by Equation (3).
r G = s M ( 2 × s M × t 2 × T ) ,
where the value of s M was inspired by the auditory characteristics of sand cats, so the original author set it to 2. t indicates the current iteration count, T indicates the maximum iteration count. Most importantly, it employs a parameter R to control the transition between the exploration and exploitation phases, which can be calculated using Equation (4).
R = 2 × r G × r a n d r G ,
where r a n d represents a random number between 0 and 1. Additionally, to realistically simulate the search process of sand cats, each sand cat is assigned a distinct search sensitivity, which can be calculated for each individual using Equation (5).
r i = r G × r a n d ,
where r i indicates the search sensitivity of i -th sand cat, and use it for position updates during the algorithm’s exploration and development phases. r G is used to guide parameter R for controlling both the exploration and exploitation phases.
During the algorithm’s exploration phase, updates to new positions are influenced by both the current position and the optimal position. Additionally, different sand cats exhibit varying degrees of search sensitivity, which also guides their own position updates. In this phase, the mathematical model for updating a sand cat’s new position can be expressed as Equation (6).
x i t + 1 = r i ( x b e s t t + r a n d x i t ) ,
where x i t represents the position of the sand cat i during iteration t , x i t + 1 represents the position of the sand cat i during iteration t + 1 , x b e s t t represents the position of the sand cat currently occupying the optimal location.

2.3. Attacking on the Prey (Exploitation)

After locating prey, the sand cat must attack to capture it. Since the sand cat detects prey through its ears, the author assumes its sensitivity range as a circle, allowing the sand cat’s movement direction to be controlled via a random angle on the circle. Based on this, the sand cat’s prey-attacking behavior can be modeled using Equation (7).
x i t + 1 = x b e s t t r i P c o s ( θ ) ,
where P represents a random value for the distance between the optimal position and the current position, which can be calculated using Equation (8). θ is a random angle between 0 and 360 degrees.
P = r a n d x b e s t t x i t ,
By using Equation (7), sand cats can move along different circular paths within the search space. The SCSO selects a random angle for each sand cat, enabling them to approach hunting locations.

2.4. Exploration and Exploitation

The exploration and development of SCSO are adjusted via parameters r G and R . These two parameters enable SCSO to switch between the two phases. Since parameter R depends on r G , when the values of parameter r G are uniformly distributed, the value of R can also be well balanced. Therefore, execution between the two phases can be adaptively adjusted according to the problem. From Equation (4), we can see that the range of R is [ r G , r G ]. Since the value of r G decreases linearly from 2 to 0, to balance exploration and exploitation, the author sets the sand cat to exploit when R falls within the range [−1,1] and to explore otherwise. The specific mathematical model can be expressed by Equation (9).
x i t + 1 = x b e s t t r i P cos θ ,   i f R 1 ,   e x p l o i t a t i o n r i x b e s t t + r a n d x i t ,   e l s e ,   e x p l o r a t i o n .
The pseudocode of the SCSO is outlined in Algorithm 1.
Algorithm 1: the pseudo-code of the SCSO
1: Begin
2: Initialize: the relevant parameters and population initialization.
3: Calculate the fitness value for each individual and determine the optimal individual.
4:   While   t   < T do
5:     for   i N do
6:      Randomly select an angle between 0 and 360 degrees.
7:       if   R 1
8:         Attacking on the prey (exploitation):
8:         Update the population by Equation (7)
9:      else:
10:         Searching the prey (exploration):
11:        Update the population by Equation (6)
12:      End If
16:       Update   Parameters   r i ,   R ,   r G
19:    End for
20:    t = t + 1
21:  End while
22:  return best solution
23: end

3. Proposed MISCSO

Although the original SCSO has demonstrated satisfactory performance, it often gets stuck in local optima when addressing the economic dispatch problem of microgrids that we need to solve. Therefore, to address its shortcomings, we propose three improvement strategies that comprehensively enhance the SCSO algorithm in three aspects: population initialization, exploration, and boundary control. The following sections will provide detailed introductions to these three strategies.

3.1. Distribution Optimization Initialization Based on Adaptive Diversity Guidance

For a heuristic algorithm, the initial positions of individuals significantly impact its performance. Poor-quality initial solutions often prevent the algorithm from exploring effectively during early iterations, further slowing its convergence speed. During the algorithm’s initialization phase, obtaining a high-quality solution is our primary objective. To achieve this, we propose a distribution optimization initialization based on adaptive diversity guidance to secure favorable initial solutions during population initialization [15]. This strategy generates a portion of individuals in high-potential regions to ensure solution quality while simultaneously producing individuals in low-potential regions to enhance diversity. This approach effectively balances exploration and exploitation. The detailed mathematical model can be expressed by Equation (10).
D = D H D L
where D H denotes the high-potential individual group, while D L denotes the low-potential individual group. D H and D L are calculated using Equation (11) and Equation (12), respectively.
D H = x Ω S ~ x τ ,   | D L | = N H
D L = x Ω S ~ x < τ ,   | D L | = N L
where N H = γ N and N L = N N H represent the number of high-potential individuals and low-potential individuals, respectively. γ is the adaptive weight, which can be expressed as Equation (13).
γ = γ m i n + γ m a x γ m i n 1 + e k ( D c u r D t a r g e t )
where D c u r represents the current population diversity, D t a r g e t represents the reference population diversity, and k denotes the adjustment parameter. τ represents the high-potential threshold, which can be calculated using Equation (14).
τ = Q q ( S ~ ( x ) ) , q [ 0.7,0.9 ]
where S ~ ( x ) denotes the potential function, which can be computed using Equation (15). Ω denotes the set of all positions. Q q ( · ) denotes the quantile function, which determines the corresponding quantile value q from the output of the latent function S ~ ( x ) .
S ~ ( x ) = S ( x ) S m i n S m a x S m i n , S ~ ( x ) [ 0,1 ]
where S ( x ) represents the fitness value at position x , while S m a x and S m i n denote the maximum and minimum fitness values among all values, respectively. A schematic of the distribution optimization initialization based on adaptive diversity guidance in Figure 1.

3.2. An Elite-Centered Global Random Movement Strategy

During the exploration phase of an algorithm, if position updates rely solely on the optimal value, the likelihood of the algorithm becoming trapped in local optima significantly increases. To address this shortcoming, we propose an Elite-Centered Global Random Movement Strategy to enhance the exploration component of SCSO. In this proposed strategy, position updates depend not only on the optimal solution but also on suboptimal solutions, centroids, and other factors. The specific mathematical model can be expressed as Equation (16).
x i , j t + 1 = E l i t e K 1 , j + R A i , j × ( r 1 x b e s t t x i , j t + 1 r 1 × x c e n t t x i , j t ) ,
where E l i t e denotes the elite pool, which contains the optimal solution, the second-best solution, the third-best solution, and the average of the top half of the individuals. R A i , j generates random numbers with a mean of 0 and a standard deviation of 1, enhancing the algorithm’s ability to escape local optima. r 1 represents a random number between 0 and 1, serving as the coefficient for the difference between the optimal position and the current position. x c e n t t indicates the position of the center point of the target, which can be calculated using Equation (17). K 1 represents a random integer between 1 and 4, used to randomly select individuals from the elite pool.
x c e n t t = 1 N i = 1 N x i , j t ,
A schematic of the elite-centered global random movement strategy in Figure 2.

3.3. Adaptive Elastic Boundary Mapping Method

In optimization algorithms, boundary handling is one of the core issues determining algorithm performance. When individuals exceed the predefined search/feasible domain boundaries during iteration or movement, traditional boundary handling methods often employ truncation or random reset techniques, which frequently exhibit limitations: the former causes individuals to cluster near boundaries, losing diversity; the latter disrupts the continuity of individual movement, reducing algorithm stability. To address this issue, we treat boundaries as “elastic media” rather than rigid barriers. When an agent crosses a boundary, its subsequent position and velocity are adaptively calculated based on the distance of the crossing. This approach ensures the agent remains within the feasible domain while preserving motion continuity and the algorithm’s exploration capability. This can be modeled as expressed in Equation (18).
x i t = l b + α i × l b x i t ,   x i t < l b u b α i × x i t u b ,   x i t > u b
where α i denotes the adaptive elasticity coefficient. It can be calculated using Equation (19).
α i = α m i n + α m a x α m i n × t T × ( 1 + λ × δ i )
where α m a x and α m i n represent the maximum and minimum values of the elastic modulus. λ represents the weighting coefficient for the degree of boundary violation. 111 represents the boundary crossing coefficient, which can be calculated using Equation (20).
δ i = l b x i t u b l b ,   x i t < l b x i t u b u b l b ,   x i t > u b
Figure 3 depicts the flowchart of the MISCSO.

4. Experimental Results and Detailed Analyses on CEC2017

In this section, we carry out experiments on the IEEE CEC2017 test suite to assess the performance of MISCSO. First, we provide a brief overview of the test suite, the comparison algorithms, and their parameter configurations. Next, we verify the performance of MISCSO through comparisons with other optimization algorithms. Finally, to identify whether there are significant differences between MISCSO and the other algorithms, we utilize two statistical testing methods for analysis. The specific details are elaborated as follows.

4.1. Benchmark Test Functions

The IEEE CEC2017 test suite is a standard benchmark collection in the field of evolutionary computation for evaluating the performance of optimization algorithms, possessing high authority and broad applicability [16]. The CEC2017 test suite comprises 30 test functions, primarily categorized into unimodal functions, multimodal functions, hybrid functions, and composite functions. The test set covers a broad spectrum of problem difficulty and characteristics, ranging from simple functions to highly complex nonlinear and nonconvex functions. Widely used in academic research, it presents a significant challenge to algorithms while enjoying high academic recognition. It provides a unified testing platform for optimization algorithm researchers worldwide, facilitating objective and fair comparisons of different algorithms’ strengths and weaknesses. Therefore, this paper selects IEEE CEC2017 as the benchmark for algorithm testing.

4.2. Competitor Algorithms and Parameter Setting

In this section, we evaluate the performance of the MISCSO by comparing it with 11 advanced algorithms to demonstrate its strong capabilities. The algorithms used for comparison include particle swarm optimization (PSO), dung beetle optimizer (DBO), dwarf mongoose optimization algorithm (DMO), information acquisition optimizer (IAO), moss growth optimization (MGO), parrot optimizer (PO), polar lights optimizer (PLO), black-winged kite algorithm (BKA), hybridization of constriction coefficient based on particle swarm optimization and gravitational search algorithm (CPSOGSA), hybrid parallel harris hawks optimization algorithm (HPHHO), and sand cat optimization algorithm (SCSO). For the sake of experimental fairness, all comparison algorithms were assigned a consistent population size of 50 and a maximum iteration number of 1000. To mitigate randomness in the algorithms, each was independently executed 30 times, and the results were averaged for analysis. Table 1 summarizes the parameter configurations of these algorithms for enhanced readability.

4.3. Compare Using CEC 2017 Test Functions

To showcase the performance advantages of MISCSO, this section implements experimental analysis using the CEC2017 test set, where MISCSO is compared with 11 benchmark algorithms. Figure 4 depicts the average convergence curves of all 12 algorithms after 30 independent runs. Table 2, Table 3 and Table 4 report the three-dimensional performance metrics of the 12 algorithms on the CEC2017 test set. Here, “Mean” indicates the average of the 30 independent runs, and “Std” reflects the standard deviation of each algorithm’s results across the 30 independent runs. To visually exhibit the results and underscore MISCSO’s performance superiority, Figure 5 presents box plots derived from the 30 independent runs of each algorithm.
As shown in Figure 4, the MISCSO algorithm generally exhibits a faster rate of decline in the average fitness value during the convergence process of various functions. It converges more rapidly toward optimal solutions, and its final stable average fitness value is significantly lower than that of most benchmark algorithms. Its distinctive feature lies in its robust search and convergence capabilities across monomodal, multimodal, and composite functions. It rapidly reduces fitness values during early iterations while maintaining stable performance at lower levels thereafter, demonstrating exceptional efficiency and robustness in solving complex optimization problems. This provides a clear advantage over other algorithms. For functions with 50 dimensions, MISCSO’s average fitness value rapidly declines as iterations increase, converging faster than most benchmark algorithms and stabilizing at a lower level. Even when dimensionality increases to 100, MISCSO maintains a significant advantage. Its convergence curve exhibits a steep initial decline and sustains a relatively low average fitness value throughout the process, demonstrating robust search capability and resilience even in high-dimensional complex problem spaces.
The data in the table shows that for most test functions, MISCSO’s “mean” value is significantly lower than that of many other algorithms. A lower “mean” value indicates that MISCSO achieves better optimization results on average. Additionally, MISCSO exhibits relatively low “std” values, indicating greater stability and reduced performance variability across multiple independent runs. This confirms its effectiveness in tackling complex optimization problems.
Figure 5 illustrates the performance distribution of the MISCSO algorithm alongside 11 benchmark algorithms (PSO, DBO, DMO, IAO, MGO, PO, PLO, BKA, CPOSGSA, HPHHO, SCSO) across multiple functions and varying dimensions within the CEC2017 test set. At 30 dimensions, MISCSO’s box plot occupies a lower position compared to most benchmark algorithms. At 50 dimensions, it maintains a lower median and narrower box range. At 100 dimensions, MISCSO’s box plot remains at a low level with minimal fluctuation. This demonstrates MISCSO’s strong scalability, enabling it to effectively handle high-dimensional complex optimization problems. In summary, box plot analysis demonstrates that across different functions and dimensions in the CEC2017 test set, the MISCSO algorithm exhibits significant advantages over other benchmark algorithms in both solution accuracy and stability, validating its effectiveness in solving complex optimization problems.

4.4. Statistical Analysis

To ascertain if there are notable disparities between the proposed algorithm and other algorithms, statistical analyses are carried out on each algorithm in this section. Firstly, the Wilcoxon signed-rank test is utilized to assess the 12 algorithms and compare their significant differences. Then, the Friedman test of median ranks is adopted to evaluate the ranking performance of each algorithm. The detailed results are presented as follows:

4.4.1. Wilcoxon Rank Sum Test

In this section, we conducted the Wilcoxon rank sum test on 12 algorithms [27]. The Wilcoxon Rank Sum Test is a nonparametric statistical test used to determine whether there is a significant difference between two independent samples without requiring the data to follow a specific distribution. It offers advantages such as broad applicability and relatively lenient data requirements. In this experiment, we set the significance level to 0.05. If p < 0.05 , we reject the null hypothesis, indicating a significant difference; otherwise, we accept the null hypothesis, suggesting no significant difference.
Table 5, Table 6 and Table 7 present experimental results across three dimensions for 11 comparison algorithms on the CEC2017 test set. The data reveal that MISCSO exhibits significant differences from the comparison algorithms on most test functions.

4.4.2. Friedman Mean Rank Test

In this subsection, we applied the Friedman mean rank test to 12 algorithms [28]. The Friedman mean rank test is another nonparametric statistical method primarily used to assess whether significant differences exist among multiple related samples. It is frequently applied to evaluate performance variations among different algorithms. This test is agnostic to the distribution shape of the data and does not require assumptions such as normal distribution, making it widely applicable. Therefore, we used it to test the performance of various comparison algorithms and rank them. Table 8 displays the average rankings of the 12 algorithms across 30 test functions in three dimensions. Among these, M . R represents the average ranking of each algorithm across 30 test functions, while T . R denotes the final ranking of each algorithm across 30 test functions.
The experimental results show that the MISCSO algorithm achieved the top ranking in all three scenarios with dimensions of 10, 30, and 50. Additionally, its average rankings were 2.33, 2.33, and 2.40, respectively, the lowest among all algorithms. In contrast, the SCSO algorithm achieved final rankings of 9th, 9th, and 8th across the three dimensions. This indicates that MISCSO represents a significant improvement over SCSO, clearly demonstrating its substantial advantage in the CEC2017 test set. MISCSO outperformed all other comparison algorithms across different dimensionality settings.

5. MISCSO for Economic Scheduling of Microgrids

In the current era where the digital economy deeply permeates the energy sector, microgrid economic dispatch is transitioning from traditional experience-driven models to data-driven intelligent approaches. The core driving force behind this transformation lies in the deep integration of digital technologies and innovative management. Leveraging big data, the Internet of Things, artificial intelligence, and other technologies as connecting links, the digital economy enables real-time collection and dynamic analysis of massive datasets—including distributed energy, energy storage equipment, and load demand. This enables precise load forecasting and multi-energy complementary optimization algorithms for microgrid economic dispatch. It not only reduces operational costs through peak-valley electricity arbitrage but also enhances clean energy consumption rates via source-load coordination, elevating economic dispatch from “rough balancing” to “precise regulation.” Simultaneously, innovative management models provide institutional safeguards for this technological empowerment. By establishing cross-entity data-sharing mechanisms, information barriers across energy production, transmission, and consumption are dismantled. Agile organizational structures bring dispatch decisions closer to dynamic user-side demands. Market-based incentive mechanisms encourage user participation in demand response, creating a dual-engine drive of “technological optimization + management innovation.” It can be said that the digital economy has infused the technical core into microgrid economic dispatch, while innovative management has built an efficient institutional framework for its operation. The synergistic efforts of these three elements not only reshape the economic logic of energy systems but also serve as a key driver for the deep integration of the energy revolution and the digital revolution.
In this section, to address the economic dispatch optimization problem for microgrids, we first establish a mathematical model of the micro-power source system. This model incorporates photovoltaic power generation, wind power generation, energy storage devices, and diesel generators. Subsequently, an objective function is formulated based on economic and environmental costs to guide the optimization process. The specific implementation steps are as follows:

5.1. Micro-Power Mathematical Model

In this subsection, we construct the mathematical model for the micro-power source system using models of the photovoltaic power generation system, wind power generation system, energy storage device, and diesel generator. The specific details are as follows:

5.1.1. Photovoltaic Power Generation Model

Photovoltaic power generation is a system that utilizes the photovoltaic effect to convert solar energy into electrical energy. The power output of the generating device is primarily influenced by factors such as temperature and illumination. Therefore, the photovoltaic power generation system model can be calculated using Equation (21).
P P V = P S T C G C G S T C [ 1 + k ( T C T S T C ) ] ,
where P S T C denotes the rated power under standard conditions; G C and G S T C represent the actual illuminance and illuminance under standard conditions, respectively; T C and T S T C denote the operating temperature and standard temperature, respectively. k denotes the power temperature coefficient, which characterizes how the output power of photovoltaic cells varies with temperature. Its value is −0.4%/°C.

5.1.2. Wind Power Generation System Model

Wind power generation systems primarily consist of wind turbines, whose output power is influenced by factors such as wind speed, wind force, and turbine location. Therefore, the wind power generation system model can be expressed using Equation (22).
P W T = 0 ,       u u i , P W T , r a t e u u i u r u i ,             u i u u r , P W T , r a t e ,       u r u u o , 0 ,       u u o
where P W T , r a t e denotes the fan’s rated output power; u i , u , and u r represent the cut-in wind speed, cut-out wind speed, and rated wind speed, respectively.

5.1.3. Energy Storage Device Model

Energy storage devices can effectively ensure the stable operation of microgrids and also achieve peak shaving and valley filling functions. The electrical energy stored in the energy storage system is related to the state of charge (SOC) of the batteries. Its charging and discharging model at time t is shown in Equation (23).
f S O C t = f S O C t 1 + P k t η c ,       P k ( t ) > 0 , f S O C t = f S O C t 1 + P k t η d ,       P k ( t ) 0 ,
where f S O C t and f S O C t 1 represent the remaining battery capacity at times t and t 1 , respectively; P k t indicates the charging/discharging power of the energy storage device; P k t > 0 denotes charging status, while P k t 0 indicates discharging status; η c and η d represent charging and discharging efficiency, respectively.

5.1.4. Diesel Generator Model

The power generation cost of diesel generators is expressed by a quadratic function as shown in Equation (24).
C D E = a + b P D E + c P D E 2 ,
where C D E represents fuel costs, P D E represents the power output of diesel generators; a , b , and c represent fuel cost coefficients, respectively.

5.2. Objective Function

The objective function aims to minimize economic costs while maximizing environmental benefits. Economic costs primarily encompass operational expenses, fuel costs, and electricity exchange costs with the grid. Environmental costs include pollution control expenses for micro-power sources (CO2, NO2, SO2). The objective function to minimize economic and environmental control costs can be expressed as Equation (25).
F = m i n ( φ F 1 + μ F 2 ) ,
where F represents the total operating cost; F 1 and F 2 denote economic cost and environmental remediation expenses, respectively; φ and μ are the coefficients for economic cost and environmental remediation expenses, both set at 0.5.

5.2.1. Economic Cost

The specific economic costs can be calculated based on the fuel coefficients and operational management expenses of each micro power source, and can be expressed as shown in Equation (26).
m i n F 1 ( x ) = t = 1 T i = 1 N ( C i , f P i , t + C i , m P i , t ) + C G R I D , t P G R I D , t ,
where T denotes a scheduling cycle, N indicates the type of distributed power source; C i , f and C i , m represent the fuel coefficient and operational management fee for each micro-power source, respectively; P i , t is the output power of the i -th micro-power source; C G R I D , t is the electricity price at time t; P G R I D , t is the power exchanged with the grid at time t .

5.2.2. Environmental Costs

Environmental costs are primarily determined by the expenses incurred in treating various pollutants, which can be specifically expressed as Equation (27).
m i n F 2 x = t = 1 T i = 1 N h = 1 M β i , h α i , h P i , t ,
where M represents the pollutant type; β i , h denotes the emission factor for pollutant h emitted by distributed power source i ; α i , h indicates the abatement cost for pollutant h emitted by distributed power source i .

5.3. Constraints

In this subsection, we employ power balance, the interaction power between the microgrid and the main grid, and the battery as constraints in solving the optimization problem. These constraints are specifically expressed as Equations (28)–(31).
P l o a d ( t ) = i = 1 N P G i ( t ) + P G R I D ( t ) ,
P G R I D m i n P G R I D ι P G R I D m a x ( t ) ,
P i m i n ( t ) P i t ( t ) P i m a x ( t ) ,
f S O C , m i n f S O C , t f S O C , m a x ,
where Equation (28) represents the power balance constraint, Equation (29) denotes the power interaction constraint between the microgrid and the main grid, Equation (30) indicates the output constraints for each micro-source, and Equation (31) specifies the constraints for the battery. P l o a d ( t ) represents the total power load at time t ; P G i ( t ) represents the output power of each micro-power source at time t ; P G R I D ( t ) represents the power exchanged with the grid at time t . P G R I D m i n and P G R I D m a x represent the minimum and maximum power levels for mainnet interactions, respectively. P i m i n ( t ) and P i m a x ( t ) represent the minimum and maximum output power values of each micro power source at time t , respectively. f S O C , m i n and f S O C , m a x represent the upper and lower limits of the battery’s state of charge, respectively.

5.4. Simulation Parameter Settings and Experimental Analysis

5.4.1. Simulation Parameters for the Case Study

This study primarily investigates grid-connected microgrids, utilizing MATLAB 2023a as the simulation platform. GRID represents the power grid. To ensure a fair comparison among algorithms, the population size is set to 50, with an interaction power of 200 kW between the microgrid and the main grid. The operational parameters of each micro-power source and the pollutant treatment costs are presented in Table 9 and Table 10, respectively.
During microgrid grid-connected operation, grid electricity prices are based on real-time pricing, disregarding electricity sales. The real-time electricity purchase and sale unit prices for each time period are shown in Table 11.

5.4.2. Analysis of Experimental Results

This study examines a typical day in a specific region of Guangdong. To ensure experimental fairness and eliminate randomness, each algorithm was independently run 30 times. Experimental statistics include the maximum value (Max), minimum value (Min), mean (Ave), standard deviation (Std), and ranking (Rank), as shown in Table 12. The output of each distributed power source is illustrated in Figure 6. Figure 7 shows the power allocation stacking diagram planned by the MISCSO algorithm.
The data in the table demonstrates that the MISCSO algorithm exhibits significant advantages across all key metrics. Regarding minimum cost (Min), MISCSO achieved 4986.87, the lowest value among all compared algorithms. For instance, the minimum cost of the PSO algorithm was 5026.37, while that of the DBO algorithm was 6153.18, both exceeding MISCSO’s result. This fully demonstrates MISCSO’s outstanding capability in locating the lowest-cost solution. For mean cost (Mean), MISCSO’s average of 5495.67 remains the lowest among all algorithms. Other algorithms, such as PSO with an average cost of 6571.94 and DBO at 6765.53, exhibit significantly higher mean costs than MISCSO, indicating its outstanding overall cost performance after multiple iterations. In terms of stability (Std), MISCSO exhibits the smallest standard deviation at 242.91 among all algorithms. In contrast, algorithms like PSO (standard deviation 679.16) and DBO (537.96) demonstrate significantly greater cost fluctuations than MISCSO. This indicates that MISCSO delivers more stable costs per run and stands out for its consistency in results. Regarding the overall ranking (Rank), MISCSO achieved the highest position at 1st place among all algorithms. This directly demonstrates that under the objective of “cost minimization,” MISCSO delivers the most optimal comprehensive performance compared to all other algorithms. When specifically compared against typical algorithms like PSO, DBO, and MGO, MISCSO exhibits lower minimum and average costs than these algorithms while maintaining superior stability, resulting in the best overall ranking. In summary, across the four core dimensions of minimum cost, average cost, stability, and overall ranking, the MISCSO algorithm demonstrates significant advantages over all comparison algorithms: it exhibits the strongest ability to find optimal solutions, achieves the lowest overall cost, and delivers the most stable results. It is the algorithm with the best overall performance in this comparison. Based on CPU execution time, MISCSO ran for 201.08 s, ranking third among the 12 algorithms. Its CPU time exceeded that of SCSO by less than two seconds. Given the performance improvement achieved, this time overhead is acceptable.
As shown in Figure 6, photovoltaic power generation exhibits distinct peaks and troughs in output between 0 and 25 h. For instance, it reaches a higher output (exceeding 300 kW) around 20 h, while output drops significantly during certain periods (such as near 15 h), even turning negative. This may be related to variations in sunlight conditions, highlighting the significant influence of weather and time on photovoltaic power generation. Wind power: Overall output is relatively dispersed and fluctuates, with values generally ranging from −50 kW to 100 kW. This reflects the instability of wind power output due to varying wind conditions. Energy storage: Output fluctuates within a certain range, enabling energy storage or release during different periods to serve a regulatory function. For instance, output may be positive (releasing energy) during certain periods and negative (storing energy) during others. Diesel Generation: Output remains relatively stable, primarily fluctuating between 0 and 100 kW. As a conventional energy source, it provides a stable power supplement when renewable generation is insufficient. In terms of coordinating output from various units, the MISCSO algorithm enables optimized scheduling of energy units with differing characteristics, including photovoltaic power generation, wind power, energy storage, and diesel generation. When photovoltaic and wind power outputs fluctuate unpredictably, the system relies on energy storage regulation and diesel generation supplementation to ensure overall power supply effectively adapts to total load demands. This demonstrates the algorithm’s effectiveness in optimizing multi-energy system configurations, thereby enhancing energy utilization efficiency and power system stability.
Figure 7 illustrates the power output distribution of different energy units (photovoltaic power generation, wind power generation, energy storage, diesel power generation) over 0–25 h and their relationship with total load. The MISCSO algorithm enables efficient optimization of these energy units with distinct characteristics—photovoltaic power generation, wind power generation, energy storage, and diesel power generation. By rationally allocating the output of each energy source, the algorithm ensures that the overall power supply can effectively meet the total load demand. This is achieved through the regulation of energy storage and the supplementation of diesel power generation, even when intermittent energy sources like solar and wind exhibit unstable output. This demonstrates the algorithm’s effectiveness in optimizing the scheduling of multi-energy systems, thereby enhancing energy utilization efficiency and the stability of the power system.
Finally, Table 13 summarizes the full forms of abbreviations frequently used in this paper for the reader’s reference. Table 14 summarizes the symbols used in this paper.

6. Conclusions

In this paper, we propose a multi-strategy improved SCSO (MISCSO) to address the economic scheduling problem of microgrids. First, to enhance the quality of the initial population, a distribution-optimized initialization method based on adaptive diversity guidance is developed. This approach improves the algorithm’s performance by generating individuals in high-potential regions to ensure solution quality, while simultaneously producing individuals in low-potential regions to maintain population diversity. Subsequently, an elite-centered global random movement strategy is introduced to balance elite guidance and global exploration, thereby enhancing both the convergence speed and optimization accuracy of the algorithm. In addition, an adaptive elastic boundary mapping mechanism is proposed to effectively handle boundary violations, ensuring a balance between constraint satisfaction and global search capability. To evaluate the performance of the proposed MISCSO, we compared it with 11 advanced algorithms on the IEEE CEC2017 benchmark set, and conducted statistical analyses to assess performance differences. Experimental results demonstrated that MISCSO exhibits superior optimization ability and robustness. Finally, its practical applicability is verified by applying it to the economic scheduling of microgrids, where it achieves excellent optimization results.

Author Contributions

Conceptualization, B.L. and Z.S.; methodology, B.L. and Z.S.; software, B.L. and Z.S.; validation, B.L. and Z.S.; formal analysis, B.L. and Z.S.; investigation, B.L. and H.W.; resources, B.L. and H.W.; data curation, B.L. and H.W.; writing—original draft preparation, B.L. and H.W.; writing—review and editing, B.L. and H.W.; visualization, Z.S. and H.W.; supervision, Z.S. and H.W.; funding acquisition, Z.S. and H.W. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by the Jiangxi Provincial Philosophy and Social Science Fund Project of China under Grant No. 25GL33; in part by the Jiangxi Provincial Education Science Planning Project under Grant No. 2025GQN019; in part by the Jiangxi Provincial University Humanities and Social Sciences Research Project of China under Grant No. JC24225; in part by the Jiangxi Provincial Department of Education Science and Technology Research Project of China under Grant No. GJJ210458.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Nosratabadi, S.; Hooshmand, R.; Gholipour, E. A Comprehensive Review on Microgrid and Virtual Power Plant Concepts Employed for Distributed Energy Resources Scheduling in Power Systems. Renew. Sustain. Energy Rev. 2017, 67, 341–363. [Google Scholar] [CrossRef]
  2. Qing, K.; Du, Y.; Huang, Q.; Duan, C.; Hu, W. Energy Scheduling for Microgrids with Renewable Energy Sources Considering an Adjustable Convex Hull Based Uncertainty Set. Renew. Energy 2024, 220, 119611. [Google Scholar] [CrossRef]
  3. Baron, C.; Al-Sumaiti, A.; Rivera, S. Impact of Energy Storage Useful Life on Intelligent Microgrid Scheduling. Energy 2020, 13, 957. [Google Scholar] [CrossRef]
  4. Gamarra, C.; Guerrero, J. Computational Optimization Techniques Applied to Microgrids Planning: A Review. Renew. Sustain. Energy Rev. 2015, 48, 413–424. [Google Scholar] [CrossRef]
  5. Rezk, H.; Olabi, A.; Sayed, E.; Wilberforce, T. Role of Metaheuristics in Optimizing Microgrids Operating and Management Issues: A Comprehensive Review. Sustainability 2023, 15, 4982. [Google Scholar] [CrossRef]
  6. Wang, Y.; Guo, X.; Zhang, C.; Liang, R.; Peng, T.; Yang, Y.; Wu, M.; Zhou, Y. Multi-Strategy Reference Vector Guided Evolutionary Algorithm and Its Application in Multi-Objective Optimal Scheduling of Microgrid Systems Containing Electric Vehicles. J. Energy Storage 2024, 95, 112500. [Google Scholar] [CrossRef]
  7. Selvaraj, G.; Rajangam, K.; Vishnuram, P.; Bajaj, M.; Zaitsev, I. Optimal Power Scheduling in Real-Time Distribution Systems Using Crow Search Algorithm for Enhanced Microgrid Performance. Sci. Rep. 2024, 14, 30982. [Google Scholar] [CrossRef]
  8. Wang, X.; Wang, S.; Ren, J.; Song, Z.; Zhang, S.; Feng, H. Optimizing Economic Dispatch for Microgrid Clusters Using Improved Grey Wolf Optimization. Electronics 2024, 13, 3139. [Google Scholar] [CrossRef]
  9. Xie, C.; Li, S.; Qin, X.; Fu, S.; Zhang, X. Multiple Elite Strategy Enhanced RIME Algorithm for 3D UAV Path Planning. Sci. Rep. 2024, 14, 21734. [Google Scholar] [CrossRef]
  10. Yue, X.; Zhang, H.; Yu, H. A Hybrid Grasshopper Optimization Algorithm with Invasive Weed for Global Optimization. IEEE Access 2020, 8, 5928–5960. [Google Scholar] [CrossRef]
  11. Yue, Y.; Cao, L.; Zhang, Y. Novel WSN Coverage Optimization Strategy Via Monarch Butterfly Algorithm and Particle Swarm Optimization. Wirel. Pers. Commun. 2024, 135, 2255–2280. [Google Scholar] [CrossRef]
  12. Seyyedabbasi, A.; Kiani, F. Sand Cat Swarm Optimization: A Nature-Inspired Algorithm to Solve Global Optimization Problems. Eng. Comput. 2023, 39, 2627–2651. [Google Scholar] [CrossRef]
  13. Yao, L.; Yang, J.; Yuan, P.; Li, G.; Lu, Y.; Zhang, T. Multi-Strategy Improved Sand Cat Swarm Optimization: Global Optimization and Feature Selection. Biomimetics 2023, 8, 492. [Google Scholar] [CrossRef]
  14. Zhan, Z.; Lai, D.; Huang, C.; Zhang, Z.; Deng, Y.; Yang, J. MSCSO: A Modified Sand Cat Swarm Algorithm for 3D UAV Path Planning in Complex Environments with Multiple Threats. Sensors 2025, 25, 2730. [Google Scholar] [CrossRef] [PubMed]
  15. Rauf, H.; Shoaib, U.; Lali, M.; Alhaisoni, M.; Irfan, M.; Khan, M. Particle Swarm Optimization with Probability Sequence for Global Optimization. IEEE Access 2020, 8, 110535–110549. [Google Scholar] [CrossRef]
  16. Awad, N.H.; Ali, M.Z.; Suganthan, P.N. Ensemble sinusoidal differential covariance matrix adaptation with Euclidean neighborhood for solving CEC2017 benchmark problems. In Proceedings of the 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, Spain, 5–8 June 2017; pp. 372–379. [Google Scholar]
  17. Anantathanavit, M.; Munlin, M. IEEE Radius Particle Swarm Optimization. In Proceedings of the 2013 International Computer Science and Engineering Conference (ICSEC), Nakhonpathom, Thailand, 4–6 September 2013; pp. 126–130. [Google Scholar]
  18. Xue, J.; Shen, B. Dung Beetle Optimizer: A New Meta-Heuristic Algorithm for Global Optimization. J. Supercomput. 2023, 79, 7305–7336. [Google Scholar] [CrossRef]
  19. Agushaka, J.; Ezugwu, A.; Abualigah, L. Dwarf Mongoose Optimization Algorithm. Comput. Methods Appl. Mech. Eng. 2022, 391, 114570. [Google Scholar] [CrossRef]
  20. Wu, X.; Li, S.; Jiang, X.; Zhou, Y. Information Acquisition Optimizer: A New Efficient Algorithm for Solving Numerical and Constrained Engineering Optimization Problems. J. Supercomput. 2024, 80, 25736–25791. [Google Scholar] [CrossRef]
  21. Zheng, B.; Chen, Y.; Wang, C.; Heidari, A.; Liu, L.; Chen, H. The Moss Growth Optimization (MGO): Concepts and Performance. J. Comput. Des. Eng. 2024, 11, 184–221. [Google Scholar] [CrossRef]
  22. Lian, J.; Hui, G.; Ma, L.; Zhu, T.; Wu, X.; Heidari, A.A.; Chen, Y.; Chen, H. Parrot Optimizer: Algorithm and Applications to Medical Problems. Comput. Biol. Med. 2024, 172, 108064. [Google Scholar] [CrossRef]
  23. Yuan, C.; Zhao, D.; Heidari, A.A.; Liu, L.; Chen, Y.; Chen, H. Polar Lights Optimizer: Algorithm and Applications in Image Segmentation and Feature Selection. Neurocomputing 2024, 607, 128427. [Google Scholar] [CrossRef]
  24. Wang, J.; Wang, W.; Hu, X.; Qiu, L.; Zang, H. Black-Winged Kite Algorithm: A Nature-Inspired Meta-Heuristic for Solving Benchmark Functions and Engineering Problems. Artif. Intell. Rev. 2024, 57, 98. [Google Scholar] [CrossRef]
  25. Dao, F.; Zou, Y.; Zeng, Y.; Qian, J.; Li, X. An Intelligent CPSOGSA-Based Mixed H2/H∞ Robust Controller for the Multi-Hydro-Turbine Governing System with Sharing Common Penstock. Renew. Energy 2023, 206, 481–497. [Google Scholar] [CrossRef]
  26. Su, Y.; Dai, Y.; Liu, Y. A Hybrid Parallel Harris Hawks Optimization Algorithm for Reusable Launch Vehicle Reentry Trajectory Optimization with No-Fly Zones. Soft Comput. 2021, 25, 14597–14617. [Google Scholar] [CrossRef]
  27. Dwivedi, A.; Mallawaarachchi, I.; Alvarado, L. Analysis of Small Sample Size Studies Using Nonparametric Bootstrap Test with Pooled Resampling Method. Stat. Med. 2017, 36, 2187–2205. [Google Scholar] [CrossRef]
  28. Fang, D.; Yan, J.; Zhou, Q. Channa Argus Optimizer for Solving Numerical Optimization and Engineering Problems. Sci. Rep. 2025, 15, 21502. [Google Scholar] [CrossRef] [PubMed]
Figure 1. Distribution optimization initialization based on adaptive diversity guidance.
Figure 1. Distribution optimization initialization based on adaptive diversity guidance.
Biomimetics 10 00735 g001
Figure 2. A schematic of the elite-centered global random movement strategy.
Figure 2. A schematic of the elite-centered global random movement strategy.
Biomimetics 10 00735 g002
Figure 3. Flowchart of MISCSO.
Figure 3. Flowchart of MISCSO.
Biomimetics 10 00735 g003
Figure 4. Comparison of convergence speed of different algorithms on CEC2017 test set. (a) CEC2017-F5 (Dim = 30), (b) CEC2017-F8 (Dim = 30), (c) CEC2017-F10 (Dim = 30), (d) CEC2017-F16 (Dim = 30), (e) CEC2017-F20 (Dim = 30), (f) CEC2017-F24 (Dim = 30), (g) CEC2017-F5 (Dim = 50), (h) CEC2017-F8 (Dim = 50), (i) CEC2017-F10 (Dim = 50), (j) CEC2017-F16 (Dim = 50), (k) CEC2017-F21 (Dim = 50), (l) CEC2017-F26 (Dim = 50), (m) CEC2017-F5 (Dim = 100), (n) CEC2017-F18 (Dim = 100), (o) CEC2017-F20 (Dim = 100), (p) CEC2017-F21 (Dim = 100), (q) CEC2017-F23 (Dim = 100), (r) CEC2017-F26 (Dim = 100).
Figure 4. Comparison of convergence speed of different algorithms on CEC2017 test set. (a) CEC2017-F5 (Dim = 30), (b) CEC2017-F8 (Dim = 30), (c) CEC2017-F10 (Dim = 30), (d) CEC2017-F16 (Dim = 30), (e) CEC2017-F20 (Dim = 30), (f) CEC2017-F24 (Dim = 30), (g) CEC2017-F5 (Dim = 50), (h) CEC2017-F8 (Dim = 50), (i) CEC2017-F10 (Dim = 50), (j) CEC2017-F16 (Dim = 50), (k) CEC2017-F21 (Dim = 50), (l) CEC2017-F26 (Dim = 50), (m) CEC2017-F5 (Dim = 100), (n) CEC2017-F18 (Dim = 100), (o) CEC2017-F20 (Dim = 100), (p) CEC2017-F21 (Dim = 100), (q) CEC2017-F23 (Dim = 100), (r) CEC2017-F26 (Dim = 100).
Biomimetics 10 00735 g004aBiomimetics 10 00735 g004bBiomimetics 10 00735 g004c
Figure 5. Boxplot analysis for different algorithms on the CEC2017 test set. (a) CEC2017-F5 (Dim = 30), (b) CEC2017-F8 (Dim = 30), (c) CEC2017-F16 (Dim = 30), (d) CEC2017-F20 (Dim = 30), (e) CEC2017-F23 (Dim = 30), (f) CEC2017-F24 (Dim = 30), (g) CEC2017-F3 (Dim = 50), (h) CEC2017-F10 (Dim = 50), (i) CEC2017-F16 (Dim = 50), (j) CEC2017-F21 (Dim = 50), (k) CEC2017-F5 (Dim = 100), (l) CEC2017-F8 (Dim = 100), (m) CEC2017-F20 (Dim = 100), (n) CEC2017-F21 (Dim = 100).
Figure 5. Boxplot analysis for different algorithms on the CEC2017 test set. (a) CEC2017-F5 (Dim = 30), (b) CEC2017-F8 (Dim = 30), (c) CEC2017-F16 (Dim = 30), (d) CEC2017-F20 (Dim = 30), (e) CEC2017-F23 (Dim = 30), (f) CEC2017-F24 (Dim = 30), (g) CEC2017-F3 (Dim = 50), (h) CEC2017-F10 (Dim = 50), (i) CEC2017-F16 (Dim = 50), (j) CEC2017-F21 (Dim = 50), (k) CEC2017-F5 (Dim = 100), (l) CEC2017-F8 (Dim = 100), (m) CEC2017-F20 (Dim = 100), (n) CEC2017-F21 (Dim = 100).
Biomimetics 10 00735 g005aBiomimetics 10 00735 g005bBiomimetics 10 00735 g005c
Figure 6. Output Power of Each Power Supply After MISCSO.
Figure 6. Output Power of Each Power Supply After MISCSO.
Biomimetics 10 00735 g006
Figure 7. Power Distribution Stackup Diagram.
Figure 7. Power Distribution Stackup Diagram.
Biomimetics 10 00735 g007
Table 1. Parameter settings of the comparison algorithms.
Table 1. Parameter settings of the comparison algorithms.
AlgorithmsParameter NameParameter ValueReference
PSO V m a x ,   w M a x ,   w M i n ,   c 1 ,   c 2 6, 0.9, 0.6, 2, 2[17]
DBO P _ p e r c e n t 0.2[18]
DMO p e e p 2[19]
IAO a l p h a 0.5[20]
MGORec, w, d11, 2, 0.2[21]
PO B e t a 1.5[22]
PLO B e t a 1.5[23]
BKA p 0.9[24]
CPSOGSA p h i 1 2.05[25]
HPHHO R a b b i t _ E n e r g y 1 × 1020[26]
SCSO S 2[12]
Table 2. Results of various algorithms tested on the CEC 2017 benchmark (dim = 30).
Table 2. Results of various algorithms tested on the CEC 2017 benchmark (dim = 30).
IDMetricPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSOMISCSO
F1mean2.2091 × 1051.8798 × 1071.1622 × 1062.2219 × 10108.3689 × 10105.1717 × 1087.6459 × 10107.8964 × 1092.8746 × 1039.9424 × 1084.2861 × 1098.9823 × 105
std1.2262 × 1052.2615 × 1071.4200 × 1065.4481 × 1091.3990 × 10105.2480 × 1081.6098 × 10101.2665 × 10103.7008 × 1035.7386 × 1082.5945 × 1092.0484 × 105
F2mean5.2899 × 1094.2621 × 10284.8542 × 10314.9180 × 10293.0023 × 10461.6438 × 10318.8433 × 10445.0686 × 10397.8063 × 10271.0000 × 10201.2044 × 10336.6077 × 1013
std1.2806 × 10101.6127 × 10291.6032 × 10321.3743 × 10309.9573 × 10467.1850 × 10313.1955 × 10452.7745 × 10404.0246 × 10280.0000 × 1004.8686 × 10335.2354 × 1013
F3mean5.6855 × 1036.7094 × 1041.1122 × 1053.7433 × 1042.2896 × 1054.1243 × 1041.9017 × 1051.1762 × 1046.5738 × 1043.3279 × 1044.6717 × 1048.6403 × 103
std2.9498 × 1031.3185 × 1041.6079 × 1041.1193 × 1044.9962 × 1047.5511 × 1033.2697 × 1048.0095 × 1032.2409 × 1049.2237 × 1031.1329 × 1041.1697 × 103
F4mean4.7371 × 1025.8079 × 1025.1558 × 1023.8787 × 1032.3917 × 1045.7897 × 1021.8050 × 1041.2642 × 1035.2289 × 1026.0051 × 1028.7244 × 1024.8154 × 102
std2.7466 × 1019.2824 × 1011.6464 × 1011.7244 × 1035.9704 × 1034.3904 × 1014.4268 × 1032.2560 × 1037.3596 × 1014.9290 × 1014.8649 × 1027.4718 × 100
F5mean6.6823 × 1027.2608 × 1027.1876 × 1027.4565 × 1021.0537 × 1037.4869 × 1021.0185 × 1037.2777 × 1027.8766 × 1027.5841 × 1027.4342 × 1026.4080 × 102
std2.9983 × 1014.8066 × 1011.2375 × 1014.6566 × 1014.4448 × 1013.8245 × 1013.8090 × 1013.8033 × 1014.8540 × 1013.4278 × 1013.5956 × 1011.1530 × 101
F6mean6.4100 × 1026.3615 × 1026.0054 × 1026.5268 × 1027.0926 × 1026.5970 × 1027.0524 × 1026.5855 × 1026.6671 × 1026.5749 × 1026.5761 × 1026.3587 × 102
std8.1053 × 1001.1999 × 1011.2669 × 10−11.1372 × 1019.0599 × 1008.3707 × 1001.1216 × 1016.0173 × 1001.0812 × 1017.4344 × 1009.2870 × 1003.7184 × 100
F7mean8.4572 × 1029.4577 × 1029.6538 × 1021.1275 × 1032.7866 × 1031.1651 × 1032.6477 × 1031.1853 × 1031.3761 × 1031.1734 × 1031.1047 × 1039.1610 × 102
std2.7599 × 1018.5186 × 1011.0709 × 1018.1321 × 1011.4542 × 1027.8294 × 1011.8454 × 1027.2807 × 1011.5558 × 1029.8289 × 1011.0274 × 1022.8965 × 101
F8mean9.2037 × 1021.0062 × 1031.0198 × 1039.9951 × 1021.2775 × 1039.8063 × 1021.2681 × 1039.6371 × 1021.0062 × 1039.8111 × 1029.9628 × 1029.0442 × 102
std2.2809 × 1016.1351 × 1011.2538 × 1012.7507 × 1013.4889 × 1013.0043 × 1013.8253 × 1014.3419 × 1014.7866 × 1013.3167 × 1013.0428 × 1016.3807 × 100
F9mean4.4760 × 1035.5061 × 1031.1026 × 1034.8459 × 1032.5527 × 1045.9736 × 1032.2294 × 1044.7678 × 1037.8899 × 1035.7999 × 1035.3273 × 1033.1510 × 103
std1.1760 × 1032.0868 × 1037.0045 × 1019.2771 × 1023.1517 × 1031.3419 × 1034.0851 × 1038.0420 × 1022.0837 × 1034.6560 × 1021.0388 × 1033.0085 × 102
F10mean4.7975 × 1035.3850 × 1038.3255 × 1035.6208 × 1039.4978 × 1036.2471 × 1039.1113 × 1035.0180 × 1035.0336 × 1035.1503 × 1035.8335 × 1034.3607 × 103
std7.3037 × 1027.6270 × 1023.7251 × 1023.9800 × 1023.7859 × 1029.1376 × 1023.4878 × 1028.6048 × 1024.7119 × 1025.7052 × 1026.3513 × 1023.3057 × 102
F11mean1.2146 × 1031.5807 × 1031.3076 × 1031.6051 × 1031.8695 × 1041.6141 × 1031.8857 × 1041.3375 × 1031.2660 × 1031.4021 × 1032.0465 × 1031.2236 × 103
std2.9453 × 1013.0856 × 1022.3674 × 1012.1265 × 1025.4881 × 1031.9013 × 1025.6987 × 1032.5045 × 1024.3000 × 1014.2434 × 1016.9747 × 1022.4300 × 101
F12mean1.0111 × 1062.5295 × 1071.0060 × 1072.8625 × 1081.3365 × 10101.2902 × 1081.1257 × 10104.3250 × 1081.3944 × 1067.6292 × 1071.4023 × 1084.3800 × 106
std4.5521 × 1053.5154 × 1073.5443 × 1063.6221 × 1083.3381 × 1091.2476 × 1082.8103 × 1091.0600 × 1091.2581 × 1065.5136 × 1071.3252 × 1081.6557 × 106
F13mean1.8993 × 1041.6274 × 1061.4709 × 1042.9759 × 1049.7732 × 1094.6369 × 1067.1522 × 1095.5056 × 1063.9751 × 1041.0077 × 1062.1756 × 1074.1934 × 104
std2.0013 × 1041.9652 × 1069.3708 × 1032.2157 × 1044.2451 × 1091.3241 × 1072.4771 × 1092.1391 × 1072.3361 × 1041.7137 × 1064.9355 × 1071.2269 × 104
F14mean2.8124 × 1041.3929 × 1058.1612 × 1041.5347 × 1037.3854 × 1064.3445 × 1054.6119 × 1062.4762 × 1033.2515 × 1041.0523 × 1053.1896 × 1059.2681 × 103
std3.4144 × 1041.6541 × 1053.6973 × 1043.4674 × 1014.8434 × 1064.1255 × 1053.2202 × 1061.3168 × 1032.9287 × 1046.9809 × 1043.7534 × 1053.1857 × 103
F15mean7.8991 × 1038.5189 × 1043.7989 × 1033.0194 × 1031.7927 × 1091.5656 × 1059.1793 × 1083.0543 × 1041.4028 × 1044.7496 × 1045.4897 × 1051.1367 × 104
std7.2737 × 1039.4273 × 1042.9766 × 1031.0039 × 1031.1773 × 1092.4076 × 1055.6871 × 1083.7296 × 1041.3247 × 1043.9716 × 1041.4112 × 1063.1207 × 103
F16mean2.7016 × 1033.1543 × 1033.2198 × 1032.5685 × 1035.5876 × 1033.6855 × 1035.2419 × 1032.9788 × 1033.1881 × 1032.9683 × 1033.2435 × 1032.5947 × 103
std2.5256 × 1024.4247 × 1021.7290 × 1022.9293 × 1026.0550 × 1024.7665 × 1025.2355 × 1024.4153 × 1023.8850 × 1023.6159 × 1023.3138 × 1021.2817 × 102
F17mean2.2794 × 1032.5730 × 1032.3092 × 1031.9461 × 1034.1238 × 1032.4383 × 1033.6327 × 1032.2426 × 1032.6080 × 1032.3038 × 1032.3449 × 1031.9846 × 103
std2.7717 × 1022.5420 × 1021.2729 × 1021.0835 × 1028.1611 × 1022.2300 × 1023.5718 × 1021.7419 × 1022.4774 × 1022.3595 × 1021.9392 × 1028.0074 × 101
F18mean4.4829 × 1051.1853 × 1063.6019 × 1064.7945 × 1036.5949 × 1072.2040 × 1064.3159 × 1071.6409 × 1052.7332 × 1051.5461 × 1061.3844 × 1061.5971 × 105
std4.0547 × 1051.2893 × 1061.7371 × 1065.1017 × 1033.7026 × 1071.6357 × 1063.4046 × 1074.8933 × 1052.0796 × 1051.4657 × 1061.5346 × 1064.9887 × 104
F19mean8.5089 × 1034.9179 × 1057.7215 × 1032.4706 × 1031.8294 × 1093.8168 × 1061.1551 × 1092.9972 × 1051.2667 × 1046.8433 × 1051.4214 × 1061.0679 × 105
std7.0987 × 1039.8238 × 1056.0219 × 1031.0744 × 1037.6056 × 1082.5128 × 1064.4618 × 1086.6506 × 1051.2903 × 1049.0218 × 1052.4026 × 1067.3105 × 104
F20mean2.5483 × 1032.7128 × 1032.6962 × 1032.3145 × 1033.2669 × 1032.6522 × 1033.1480 × 1032.5114 × 1032.7583 × 1032.6160 × 1032.6266 × 1032.3468 × 103
std1.7608 × 1022.1449 × 1029.7777 × 1017.1269 × 1011.4208 × 1021.6342 × 1021.3700 × 1021.8423 × 1022.1798 × 1021.8945 × 1021.7636 × 1023.6869 × 101
F21mean2.4721 × 1032.5349 × 1032.5125 × 1032.4735 × 1032.7991 × 1032.5409 × 1032.7590 × 1032.5150 × 1032.5705 × 1032.5222 × 1032.5184 × 1032.4203 × 103
std3.1714 × 1013.7455 × 1011.1836 × 1016.5982 × 1014.1707 × 1014.2051 × 1014.1855 × 1015.5133 × 1014.1515 × 1013.9185 × 1014.9359 × 1011.1352 × 101
F22mean4.3993 × 1035.4299 × 1034.5365 × 1034.8925 × 1031.0689 × 1043.7756 × 1039.9037 × 1035.7577 × 1035.8230 × 1034.5446 × 1033.8712 × 1032.3124 × 103
std2.1899 × 1032.0346 × 1032.4460 × 1038.0687 × 1025.7949 × 1022.1091 × 1031.2695 × 1032.0636 × 1032.0755 × 1032.5788 × 1031.5267 × 1031.3613
F23mean3.1413 × 1032.9146 × 1032.8537 × 1032.9144 × 1033.5201 × 1032.9968 × 1033.3742 × 1033.0377 × 1033.0621 × 1032.9631 × 1032.9316 × 1032.7885 × 103
std1.3554 × 1026.4965 × 1011.3865 × 1014.7353 × 1011.0623 × 1029.2096 × 1016.5209 × 1011.1706 × 1021.2011 × 1026.8163 × 1016.3598 × 1011.3490 × 101
F24mean3.1804 × 1033.0670 × 1033.0217 × 1033.0915 × 1033.7703 × 1033.1479 × 1033.5671 × 1033.1898 × 1033.2614 × 1033.1565 × 1033.0356 × 1032.9463 × 103
std6.9984 × 1017.0714 × 1011.3135 × 1017.0599 × 1011.7933 × 1027.9792 × 1011.0491 × 1021.0203 × 1029.2964 × 1016.6042 × 1015.2799 × 1011.8954 × 101
F25mean2.8868 × 1032.9437 × 1032.8892 × 1033.5497 × 1031.0953 × 1042.9960 × 1039.9811 × 1033.0164 × 1032.9273 × 1033.0173 × 1033.0673 × 1032.8980 × 103
std1.6211 × 1013.7801 × 1019.0494 × 10−12.8154 × 1021.9415 × 1033.2839 × 1011.5360 × 1032.6358 × 1022.4654 × 1015.0787 × 1017.2889 × 1017.4671
F26mean6.0316 × 1036.2387 × 1035.7669 × 1037.0490 × 1031.2366 × 1046.7362 × 1031.1209 × 1047.3263 × 1037.1320 × 1036.2685 × 1036.1536 × 1032.8834 × 103
std1.8462 × 1031.0046 × 1031.1892 × 1021.2078 × 1039.3537 × 1021.4815 × 1039.8286 × 1021.3198 × 1037.7884 × 1021.6524 × 1031.1082 × 1036.1073 × 101
F27mean3.3207 × 1033.2832 × 1033.2265 × 1033.3037 × 1034.2525 × 1033.3950 × 1033.9930 × 1033.3906 × 1033.4781 × 1033.3330 × 1033.3631 × 1033.2553 × 103
std1.8663 × 1024.2780 × 1015.2334 × 1008.2012 × 1013.1731 × 1028.0192 × 1011.6880 × 1021.1327 × 1021.5062 × 1027.9206 × 1017.4251 × 1011.0003 × 101
F28mean3.2273 × 1033.4576 × 1033.2813 × 1034.5518 × 1039.2000 × 1033.3852 × 1038.5148 × 1033.5787 × 1033.2535 × 1033.3838 × 1033.4963 × 1033.2263 × 103
std2.5873 × 1014.1676 × 1021.7738 × 1015.4461 × 1021.1052 × 1035.8650 × 1017.6068 × 1027.5970 × 1022.1426 × 1015.8545 × 1019.7327 × 1019.1916
F29mean4.1318 × 1034.1407 × 1034.2951 × 1034.0358 × 1037.4570 × 1034.8503 × 1036.5519 × 1034.4184 × 1034.3611 × 1034.2380 × 1034.6267 × 1034.0188 × 103
std2.3381 × 1023.0088 × 1021.6788 × 1022.1658 × 1021.5567 × 1034.4456 × 1026.6381 × 1023.4373 × 1022.8790 × 1023.0932 × 1023.7478 × 1029.3907 × 101
F30mean4.6429 × 1041.7286 × 1061.7652 × 1059.8724 × 1041.1312 × 1092.8170 × 1078.8037 × 1081.9250 × 1061.1450 × 1056.7548 × 1061.2843 × 1071.5369 × 106
std2.9880 × 1042.6549 × 1061.1343 × 1051.5524 × 1056.3220 × 1084.0626 × 1074.9386 × 1083.1153 × 1068.5736 × 1045.7149 × 1061.1160 × 1075.4004 × 105
Table 3. Results of various algorithms tested on the CEC 2017 benchmark (dim = 50).
Table 3. Results of various algorithms tested on the CEC 2017 benchmark (dim = 50).
IDMetricPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSOMISCSO
F1mean8.9897 × 1063.8830 × 1086.8241 × 1087.2852 × 10102.0034 × 10113.0362 × 1091.8587 × 10111.3892 × 10108.0228 × 1071.2151 × 10101.6462 × 10101.7401 × 107
std3.0397 × 1062.0759 × 1081.6897 × 1081.1916 × 10101.7560 × 10101.6281 × 1091.7736 × 10101.3333 × 10103.1379 × 1082.9029 × 1094.5194 × 1093.1662 × 106
F2mean1.7366 × 10234.9106 × 10592.5265 × 10652.5978 × 10674.5250 × 10856.3464 × 10551.6571 × 10811.1868 × 10707.5540 × 10571.0000 × 10201.7256 × 10611.5470 × 1035
std6.0879 × 10231.7983 × 10607.1325 × 10651.4213 × 10682.0008 × 10863.0826 × 10564.7047 × 10816.5005 × 10704.0307 × 10580.0000 × 1009.4203 × 10612.0672 × 1035
F3mean7.6456 × 1042.1162 × 1053.0074 × 1051.0315 × 1054.4547 × 1051.3993 × 1053.9858 × 1056.1453 × 1042.3049 × 1057.8358 × 1041.0695 × 1055.0798 × 104
std2.2408 × 1044.5391 × 1042.8965 × 1041.8764 × 1041.1217 × 1051.9049 × 1045.1826 × 1043.8998 × 1045.8799 × 1041.0846 × 1041.8706 × 1044.2001 × 103
F4mean5.3716 × 1028.0239 × 1028.7736 × 1021.8250 × 1047.0239 × 1041.0449 × 1035.5375 × 1043.1949 × 1036.4201 × 1021.9547 × 1032.4143 × 1035.6831 × 102
std5.0765 × 1011.2802 × 1025.5883 × 1015.6579 × 1031.2618 × 1042.1039 × 1021.2311 × 1045.6780 × 1035.7264 × 1016.7531 × 1021.1714 × 1033.3318 × 101
F5mean7.6352 × 1029.4542 × 1029.7494 × 1029.9920 × 1021.5085 × 1039.1577 × 1021.4719 × 1038.7416 × 1029.7727 × 1029.3596 × 1029.1821 × 1027.6681 × 102
std3.2423 × 1018.4692 × 1011.7387 × 1013.6338 × 1016.1268 × 1014.3380 × 1015.6923 × 1016.6440 × 1017.5410 × 1013.3968 × 1013.8691 × 1011.2256 × 101
F6mean6.5033 × 1026.5599 × 1026.1348 × 1026.6854 × 1027.2929 × 1026.7630 × 1027.2743 × 1026.6713 × 1026.7526 × 1026.7319 × 1026.7171 × 1026.5399 × 102
std5.6599 × 1001.1148 × 1011.7602 × 1008.5585 × 1001.0039 × 1016.9614 × 1007.6965 × 1006.3200 × 1009.1079 × 1006.6246 × 1006.7441 × 1003.2413 × 100
F7mean1.0948 × 1031.2719 × 1031.2956 × 1031.6689 × 1035.0273 × 1031.6449 × 1035.0203 × 1031.6836 × 1032.3661 × 1031.6965 × 1031.6117 × 1031.2508 × 103
std8.8706 × 1011.7884 × 1022.8861 × 1011.1367 × 1023.0848 × 1021.0492 × 1023.9740 × 1028.4073 × 1012.7540 × 1021.2634 × 1021.2786 × 1025.6057 × 101
F8mean1.0851 × 1031.2816 × 1031.2715 × 1031.3117 × 1031.8246 × 1031.2461 × 1031.7768 × 1031.2152 × 1031.2208 × 1031.2429 × 1031.2261 × 1031.0789 × 103
std3.3980 × 1018.4717 × 1011.8896 × 1013.9585 × 1018.4306 × 1014.0751 × 1015.2736 × 1018.0004 × 1016.1311 × 1013.4434 × 1014.4748 × 1011.9967 × 101
F9mean2.2091 × 1041.6831 × 1046.8065 × 1032.0580 × 1047.5428 × 1042.2588 × 1046.8868 × 1041.5273 × 1041.9327 × 1041.9931 × 1041.9139 × 1041.1559 × 104
std4.4515 × 1036.8780 × 1031.4345 × 1032.6027 × 1038.0130 × 1032.6779 × 1038.1827 × 1033.7172 × 1033.9444 × 1033.0756 × 1032.9953 × 1031.4641 × 103
F10mean7.5691 × 1039.4782 × 1031.4822 × 1041.0629 × 1041.6027 × 1041.1254 × 1041.5770 × 1049.3151 × 1038.2329 × 1039.5573 × 1039.7088 × 1037.3454 × 103
std1.0257 × 1031.6171 × 1033.8813 × 1026.7649 × 1027.1636 × 1021.1608 × 1034.8646 × 1022.0822 × 1037.2495 × 1021.0361 × 1038.8439 × 1025.1975 × 102
F11mean1.3084 × 1032.8057 × 1033.4290 × 1038.4334 × 1035.0425 × 1043.4656 × 1035.0020 × 1042.1447 × 1031.6932 × 1032.0302 × 1035.3820 × 1031.4838 × 103
std4.4726 × 1013.1472 × 1036.6895 × 1022.5305 × 1039.6248 × 1038.4350 × 1028.9463 × 1038.1748 × 1022.1881 × 1022.1977 × 1022.2845 × 1034.1901 × 101
F12mean1.2636 × 1074.4924 × 1084.0077 × 1081.9878 × 10108.3546 × 10106.4397 × 1087.2780 × 10105.2672 × 1092.8980 × 1077.4617 × 1082.3667 × 1094.3955 × 107
std6.8351 × 1064.3211 × 1089.2467 × 1078.4191 × 1091.8339 × 10103.2408 × 1081.2532 × 10101.1417 × 10101.6236 × 1075.5954 × 1081.7902 × 1091.5910 × 107
F13mean3.1687 × 1041.3667 × 1076.6872 × 1034.7262 × 1084.1161 × 10106.6942 × 1073.5808 × 10101.4816 × 1096.6906 × 1042.3602 × 1071.7187 × 1081.3468 × 105
std1.6727 × 1041.6969 × 1074.1016 × 1036.3704 × 1081.2017 × 10109.7544 × 1079.5093 × 1093.9241 × 1094.7047 × 1042.7145 × 1072.3588 × 1082.6952 × 104
F14mean1.3470 × 1052.1477 × 1061.5048 × 1062.0190 × 1037.4678 × 1073.0796 × 1064.4965 × 1071.0076 × 1052.3467 × 1051.1184 × 1061.3126 × 1061.8089 × 105
std9.3046 × 1042.1338 × 1065.8449 × 1054.5436 × 1026.0237 × 1071.6255 × 1062.8857 × 1071.7383 × 1051.6995 × 1057.7343 × 1051.6067 × 1066.1229 × 104
F15mean9.4583 × 1034.1022 × 1071.0580 × 1042.4265 × 1041.4440 × 10103.7018 × 1061.0244 × 10101.3835 × 1083.3724 × 1042.2098 × 1063.5576 × 1072.5660 × 104
std7.4309 × 1031.6150 × 1084.1280 × 1031.4673 × 1045.0160 × 1095.7302 × 1063.2543 × 1093.5153 × 1081.6147 × 1043.2240 × 1061.1387 × 1084.2022 × 103
F16mean3.3922 × 1034.5915 × 1035.0723 × 1034.1689 × 1039.4577 × 1034.7916 × 1038.6668 × 1034.1650 × 1034.0791 × 1034.2674 × 1034.4603 × 1033.4372 × 103
std4.9670 × 1025.9073 × 1022.3257 × 1024.4128 × 1021.0670 × 1037.3801 × 1028.1791 × 1029.4155 × 1025.4438 × 1025.6211 × 1025.2932 × 1022.3198 × 102
F17mean3.1624 × 1034.0404 × 1033.9932 × 1033.1527 × 1036.2401 × 1043.9160 × 1033.4947 × 1043.4769 × 1033.8316 × 1033.5956 × 1033.7673 × 1033.0168 × 103
std3.5573 × 1024.9686 × 1021.5217 × 1022.3741 × 1026.6416 × 1043.9606 × 1024.0201 × 1044.6386 × 1024.9900 × 1023.3314 × 1024.1176 × 1021.5959 × 102
F18mean1.4819 × 1066.1166 × 1061.6441 × 1078.8023 × 1042.5618 × 1081.2051 × 1071.7325 × 1083.1260 × 1061.2420 × 1065.8020 × 1061.1772 × 1078.2573 × 105
std1.0028 × 1066.3179 × 1066.0826 × 1063.8600 × 1041.3547 × 1081.0071 × 1076.4040 × 1079.7107 × 1061.1660 × 1064.8214 × 1061.5287 × 1072.4819 × 105
F19mean1.5635 × 1044.4341 × 1061.6262 × 1043.3861 × 1055.5993 × 1097.8509 × 1064.2829 × 1095.0375 × 1072.6380 × 1047.0202 × 1058.4308 × 1063.5103 × 105
std1.0625 × 1046.9827 × 1066.8507 × 1035.0725 × 1051.5878 × 1096.7613 × 1061.2356 × 1091.5638 × 1081.6900 × 1047.7571 × 1051.1979 × 1072.1807 × 105
F20mean3.1615 × 1033.5236 × 1034.0469 × 1032.8847 × 1034.7552 × 1033.5465 × 1034.7079 × 1033.2162 × 1033.4197 × 1033.1248 × 1033.3806 × 1032.9304 × 103
std3.4935 × 1023.6323 × 1022.1201 × 1021.5020 × 1022.7404 × 1023.2637 × 1022.8110 × 1022.5417 × 1023.1547 × 1022.8352 × 1022.6095 × 1021.0680 × 102
F21mean2.6717 × 1032.7804 × 1032.7634 × 1032.8274 × 1033.3412 × 1032.7984 × 1033.2658 × 1032.7986 × 1032.8834 × 1032.8095 × 1032.7442 × 1032.5964 × 103
std5.9562 × 1017.0692 × 1011.8472 × 1014.9625 × 1016.4493 × 1017.3872 × 1016.7888 × 1018.3227 × 1019.5616 × 1016.9845 × 1016.6961 × 1012.1165 × 101
F22mean9.2216 × 1031.1527 × 1041.6071 × 1041.2242 × 1041.7902 × 1041.2663 × 1041.7281 × 1049.9427 × 1031.0028 × 1041.2031 × 1041.1786 × 1048.4733 × 103
std9.5078 × 1021.3529 × 1031.0737 × 1031.2702 × 1034.7019 × 1021.2700 × 1035.6768 × 1028.9377 × 1029.3330 × 1029.1668 × 1021.1439 × 1032.1008 × 103
F23mean3.5916 × 1033.3896 × 1033.1828 × 1033.4926 × 1034.4736 × 1033.5000 × 1034.2168 × 1033.7011 × 1033.5119 × 1033.4746 × 1033.2987 × 1033.1267 × 103
std2.2505 × 1021.1927 × 1021.7076 × 1011.3328 × 1022.4277 × 1021.2086 × 1021.4020 × 1021.8246 × 1021.1937 × 1021.5604 × 1028.8678 × 1012.1117 × 101
F24mean3.5469 × 1033.4724 × 1033.3312 × 1033.5904 × 1034.9357 × 1033.6792 × 1034.5729 × 1033.7385 × 1033.9314 × 1033.6763 × 1033.4205 × 1033.2304 × 103
std1.2528 × 1021.0877 × 1021.2478 × 1019.1181 × 1012.4920 × 1021.4087 × 1021.5763 × 1021.2822 × 1021.6048 × 1021.3779 × 1029.0690 × 1012.7000 × 101
F25mean2.9835 × 1033.2277 × 1033.3276 × 1031.0425 × 1043.9095 × 1043.5450 × 1033.5369 × 1044.5997 × 1033.1239 × 1033.9349 × 1034.3439 × 1033.1040 × 103
std4.3010 × 1018.7647 × 1016.4777 × 1011.3513 × 1035.6212 × 1031.7605 × 1025.3989 × 1032.4586 × 1033.2608 × 1013.0082 × 1025.1200 × 1022.1872 × 101
F26mean8.4219 × 1031.0059 × 1048.3198 × 1031.3926 × 1042.3770 × 1049.5870 × 1032.0979 × 1041.1074 × 1041.1839 × 1041.1393 × 1041.0844 × 1043.7741 × 103
std3.4611 × 1031.0294 × 1032.0570 × 1021.0432 × 1032.2506 × 1032.5757 × 1031.8586 × 1032.2617 × 1031.3737 × 1031.3204 × 1032.2053 × 1033.7862 × 102
F27mean3.8664 × 1033.7775 × 1033.5385 × 1033.8716 × 1036.6507 × 1034.0439 × 1035.9407 × 1034.1983 × 1034.6542 × 1033.9183 × 1034.1476 × 1033.6785 × 103
std6.8506 × 1021.9470 × 1023.7385 × 1011.1793 × 1024.7349 × 1023.0257 × 1023.5751 × 1023.9154 × 1023.2811 × 1022.4541 × 1022.2826 × 1025.6679 × 101
F28mean3.2911 × 1035.3736 × 1033.7746 × 1038.5576 × 1031.8003 × 1044.1462 × 1031.6527 × 1044.6413 × 1033.4260 × 1034.6468 × 1035.0102 × 1033.3727 × 103
std3.1086 × 1012.2895 × 1031.3090 × 1028.5361 × 1021.8625 × 1032.2770 × 1021.3132 × 1031.2330 × 1031.1099 × 1023.4522 × 1024.9098 × 1021.7543 × 101
F29mean5.1661 × 1035.7056 × 1035.6765 × 1036.5253 × 1037.6935 × 1047.2752 × 1034.5461 × 1046.1550 × 1036.3027 × 1036.4383 × 1036.4535 × 1035.3625 × 103
std3.5375 × 1028.6028 × 1022.6418 × 1021.0053 × 1036.7638 × 1049.4449 × 1022.5702 × 1041.2094 × 1035.5447 × 1027.1051 × 1028.0067 × 1022.1798 × 102
F30mean4.5567 × 1062.9449 × 1071.6845 × 1076.0409 × 1077.9246 × 1092.0830 × 1086.7389 × 1091.0056 × 1084.1553 × 1071.4806 × 1081.6542 × 1086.7228 × 107
std1.5213 × 1062.3182 × 1077.0009 × 1063.1111 × 1072.9827 × 1098.3280 × 1072.9003 × 1093.0905 × 1081.6847 × 1075.7281 × 1071.2992 × 1081.0398 × 107
Table 4. Results of various algorithms tested on the CEC 2017 benchmark (dim = 100).
Table 4. Results of various algorithms tested on the CEC 2017 benchmark (dim = 100).
IDMetricPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSOMISCSO
F1mean1.3417 × 1087.5275 × 10105.3144 × 10102.1959 × 10115.2807 × 10112.4302 × 10105.1969 × 10119.9858 × 10102.6018 × 1096.8836 × 10107.1122 × 10105.9830 × 108
std3.0715 × 1077.1062 × 10104.5607 × 1091.9282 × 10103.1059 × 10105.1713 × 1093.9216 × 10103.7310 × 10101.4501 × 1091.3717 × 10101.5200 × 10108.6889 × 107
F2mean3.4896 × 10707.6065 × 101491.0263 × 101544.6125 × 101531.5353 × 101842.0033 × 101477.7085 × 101808.5159 × 101591.0393 × 101441.0000 × 10203.1511 × 101473.9429 × 10106
std1.8584 × 10714.1657 × 101506.5535 × 1046.5535 × 1046.5535 × 1041.0931 × 101486.5535 × 1046.5535 × 1044.1438 × 101440.0000 × 1001.2700 × 101486.4596 × 10106
F3mean3.8388 × 1055.1027 × 1057.9320 × 1052.7192 × 1057.1314 × 1063.2742 × 1059.6133 × 1052.1070 × 1057.1606 × 1052.6138 × 1052.7788 × 1052.4673 × 105
std6.5156 × 1041.9002 × 1055.5838 × 1042.2068 × 1043.2253 × 1071.7737 × 1041.1674 × 1054.7311 × 1041.0491 × 1052.3532 × 1041.9801 × 1049.3426 × 103
F4mean7.2547 × 1027.3972 × 1036.8730 × 1036.6603 × 1042.2101 × 1053.7932 × 1031.9902 × 1051.8181 × 1041.7090 × 1039.1244 × 1038.5617 × 1031.0729 × 103
std7.8092 × 1017.3116 × 1039.7090 × 1021.2471 × 1042.7481 × 1048.6808 × 1022.5537 × 1042.1043 × 1044.1576 × 1022.1043 × 1032.2072 × 1034.6174 × 101
F5mean1.2616 × 1031.6985 × 1031.7317 × 1031.8512 × 1032.8740 × 1031.6066 × 1032.8265 × 1031.4397 × 1031.7515 × 1031.6633 × 1031.5491 × 1031.2647 × 103
std6.3621 × 1012.1028 × 1023.4889 × 1014.4516 × 1011.2735 × 1025.9595 × 1019.7750 × 1019.4815 × 1011.1151 × 1026.3565 × 1016.1464 × 1012.2101 × 101
F6mean6.6425 × 1026.7480 × 1026.5356 × 1026.8974 × 1027.4996 × 1026.8707 × 1027.4546 × 1026.7519 × 1026.7767 × 1026.8418 × 1026.8075 × 1026.6850 × 102
std4.0104 × 1001.0430 × 1012.9298 × 1003.5934 × 1007.2824 × 1004.8998 × 1006.5568 × 1007.4819 × 1005.0511 × 1003.6326 × 1005.2711 × 1001.4058 × 100
F7mean1.9310 × 1032.4859 × 1033.6656 × 1033.5548 × 1031.2055 × 1043.4556 × 1031.2102 × 1043.3425 × 1035.6263 × 1033.4906 × 1033.2834 × 1032.6046 × 103
std1.9336 × 1023.5410 × 1021.8671 × 1021.3194 × 1026.7245 × 1021.4942 × 1024.9136 × 1022.3969 × 1023.9818 × 1021.5693 × 1021.9165 × 1028.1318 × 101
F8mean1.6581 × 1031.9770 × 1032.0341 × 1032.2749 × 1033.3048 × 1032.0662 × 1033.1968 × 1031.9594 × 1032.0318 × 1032.1104 × 1032.0049 × 1031.6702 × 103
std7.7515 × 1012.1795 × 1023.0489 × 1018.7933 × 1011.2395 × 1028.4005 × 1019.9289 × 1012.1150 × 1021.4369 × 1025.9972 × 1016.5791 × 1014.9479 × 101
F9mean6.0135 × 1045.3976 × 1045.7983 × 1045.1146 × 1041.8895 × 1055.2315 × 1041.8141 × 1053.1862 × 1044.2118 × 1044.5908 × 1043.6853 × 1043.0554 × 104
std5.6835 × 1031.9578 × 1045.5381 × 1033.4822 × 1031.3739 × 1047.0990 × 1031.3169 × 1047.9575 × 1034.3950 × 1035.4467 × 1033.8356 × 1031.8353 × 103
F10mean1.6112 × 1042.0124 × 1043.2166 × 1042.5587 × 1043.4078 × 1042.4590 × 1043.3289 × 1041.9880 × 1041.5535 × 1042.3895 × 1042.0994 × 1041.6721 × 104
std1.3922 × 1034.1579 × 1034.7389 × 1029.3680 × 1027.2730 × 1021.8571 × 1038.0971 × 1023.8254 × 1031.6013 × 1032.2183 × 1031.7852 × 1036.8311 × 102
F11mean5.5082 × 1031.2994 × 1052.0793 × 1051.0047 × 1054.5115 × 1051.0318 × 1054.1373 × 1052.8720 × 1048.0193 × 1044.7338 × 1046.5927 × 1041.2607 × 104
std7.8387 × 1023.9820 × 1043.2477 × 1042.0703 × 1047.4983 × 1042.0204 × 1045.8962 × 1041.6852 × 1042.8207 × 1048.0111 × 1031.4250 × 1041.4629 × 103
F12mean1.9315 × 1082.1943 × 1096.4257 × 1091.1456 × 10112.7801 × 10115.1881 × 1092.5099 × 10113.2564 × 10107.3962 × 1081.1653 × 10102.0530 × 10104.5209 × 108
std6.4261 × 1078.1147 × 1087.6621 × 1082.4020 × 10102.9384 × 10101.5215 × 1092.5618 × 10104.4735 × 10102.8725 × 1083.7579 × 1099.5426 × 1097.3371 × 107
F13mean2.1439 × 1051.0409 × 1082.5152 × 1042.1896 × 10106.3415 × 10101.8314 × 1085.9511 × 10102.5207 × 1095.9130 × 1045.6564 × 1082.7126 × 1095.3201 × 105
std9.1403 × 1041.2228 × 1085.1916 × 1036.4544 × 1091.0951 × 10101.3609 × 1081.0263 × 10106.7668 × 1092.0832 × 1043.6837 × 1082.1081 × 1099.1890 × 104
F14mean1.6929 × 1061.0114 × 1074.3416 × 1071.2523 × 1062.8907 × 1081.0307 × 1072.0241 × 1082.9805 × 1061.2923 × 1065.6790 × 1069.0924 × 1061.9009 × 106
std7.3655 × 1058.9530 × 1061.0916 × 1077.5832 × 1051.0941 × 1083.3532 × 1066.6580 × 1075.1294 × 1065.9305 × 1052.3965 × 1065.3195 × 1063.1197 × 105
F15mean3.8409 × 1042.5386 × 1074.3138 × 1034.7115 × 1092.9896 × 10102.9369 × 1072.4322 × 10101.5839 × 1099.9209 × 1071.6142 × 1074.1581 × 1089.8767 × 104
std1.5797 × 1044.2384 × 1071.2470 × 1032.1347 × 1096.5440 × 1092.7073 × 1074.3845 × 1093.6645 × 1095.4314 × 1081.3577 × 1076.5657 × 1081.2761 × 104
F16mean5.9023 × 1038.6327 × 1031.1152 × 1041.3122 × 1042.7906 × 1041.1317 × 1042.4361 × 1049.0805 × 1037.1024 × 1031.1695 × 1049.9139 × 1037.2233 × 103
std7.4294 × 1021.2257 × 1032.7198 × 1022.3579 × 1033.8252 × 1031.3929 × 1033.1986 × 1032.4697 × 1038.4138 × 1021.3186 × 1031.3788 × 1034.5936 × 102
F17mean5.2135 × 1038.2577 × 1037.8288 × 1032.8828 × 1041.3481 × 1078.0902 × 1039.5828 × 1062.7447 × 1046.2810 × 1037.4052 × 1031.2082 × 1045.3440 × 103
std4.8549 × 1021.2441 × 1031.9766 × 1024.9208 × 1041.0991 × 1071.3704 × 1037.4423 × 1067.7080 × 1046.5333 × 1021.2525 × 1031.1775 × 1042.4747 × 102
F18mean2.9703 × 1061.7444 × 1077.4587 × 1072.7474 × 1065.4712 × 1081.0270 × 1073.3874 × 1083.0589 × 1062.1624 × 1068.4424 × 1067.6992 × 1062.1353 × 106
std1.6847 × 1061.1891 × 1072.0434 × 1072.1554 × 1062.1677 × 1083.7278 × 1061.1721 × 1089.6891 × 1061.2873 × 1065.2353 × 1064.5529 × 1064.0130 × 105
F19mean1.3983 × 1053.2923 × 1077.3914 × 1036.0907 × 1093.1967 × 10105.6972 × 1072.4464 × 10101.1938 × 1093.0443 × 1053.4562 × 1072.7124 × 1082.7859 × 106
std1.0726 × 1052.3692 × 1075.2099 × 1033.6484 × 1097.0427 × 1093.0206 × 1076.0497 × 1093.9181 × 1092.4613 × 1053.1005 × 1074.1897 × 1081.2052 × 106
F20mean5.2029 × 1036.2214 × 1037.6732 × 1035.2612 × 1038.8850 × 1036.0953 × 1038.5595 × 1035.4585 × 1035.8445 × 1035.5406 × 1036.0480 × 1034.8782 × 103
std4.2759 × 1026.3022 × 1022.4911 × 1022.7328 × 1022.4668 × 1026.8116 × 1023.6335 × 1026.4669 × 1026.3348 × 1024.7647 × 1025.8050 × 1022.0478 × 102
F21mean3.5566 × 1033.8161 × 1033.5552 × 1033.9587 × 1035.0584 × 1033.9986 × 1034.8757 × 1034.0417 × 1034.0718 × 1033.8261 × 1033.6868 × 1033.3045 × 103
std1.6298 × 1021.5814 × 1021.9908 × 1011.1317 × 1021.3765 × 1021.7688 × 1021.2379 × 1022.4963 × 1022.1573 × 1021.5736 × 1021.5412 × 1026.5374 × 101
F22mean1.9438 × 1042.3606 × 1043.4357 × 1042.9350 × 1043.6714 × 1042.7450 × 1043.5858 × 1042.3450 × 1041.9149 × 1042.7190 × 1042.4304 × 1042.0667 × 104
std1.4741 × 1034.5183 × 1035.9876 × 1027.5912 × 1026.7439 × 1021.6484 × 1036.0757 × 1024.3770 × 1031.7701 × 1031.2764 × 1031.6426 × 1037.0815 × 102
F23mean4.8375 × 1034.4524 × 1033.9615 × 1034.6464 × 1036.8251 × 1034.8022 × 1036.1770 × 1034.9967 × 1034.8377 × 1034.6312 × 1034.3476 × 1033.9001 × 103
std3.4874 × 1021.7784 × 1022.8351 × 1011.7691 × 1023.4460 × 1022.0527 × 1022.1078 × 1023.0879 × 1021.9663 × 1022.2894 × 1021.7691 × 1027.6276 × 101
F24mean5.4915 × 1035.5158 × 1034.4254 × 1036.0469 × 1031.1242 × 1046.0808 × 1039.6470 × 1036.5956 × 1036.4250 × 1035.5311 × 1035.4512 × 1034.6226 × 103
std4.7362 × 1022.8658 × 1022.7806 × 1012.8678 × 1027.9258 × 1023.4380 × 1026.6463 × 1026.5386 × 1023.7405 × 1023.5290 × 1023.7562 × 1026.4913 × 101
F25mean3.3535 × 1038.8468 × 1031.3265 × 1042.2048 × 1041.0759 × 1055.6565 × 1039.9680 × 1049.9253 × 1033.9953 × 1037.4599 × 1038.1929 × 1033.7610 × 103
std4.7772 × 1015.2477 × 1038.7086 × 1022.0174 × 1031.3457 × 1044.0243 × 1021.4290 × 1045.5418 × 1032.6511 × 1026.6584 × 1021.4645 × 1033.5168 × 101
F26mean1.7600 × 1042.4786 × 1041.7903 × 1044.2072 × 1047.1745 × 1042.9723 × 1046.3946 × 1043.2939 × 1043.1013 × 1042.8991 × 1043.0282 × 1041.3552 × 104
std7.5967 × 1033.1601 × 1034.3060 × 1022.9494 × 1037.6872 × 1034.7466 × 1035.0715 × 1036.2733 × 1032.5840 × 1033.4741 × 1032.0934 × 1035.1113 × 103
F27mean3.4709 × 1034.2447 × 1034.5080 × 1035.6710 × 1031.3122 × 1044.6439 × 1031.1341 × 1045.5933 × 1035.5228 × 1034.8841 × 1035.2115 × 1034.1508 × 103
std2.0127 × 1022.8770 × 1021.0691 × 1024.3914 × 1021.2431 × 1032.9640 × 1021.3540 × 1031.0501 × 1035.4416 × 1023.7166 × 1024.9903 × 1021.1908 × 102
F28mean3.4068 × 1031.8846 × 1041.5219 × 1042.5772 × 1046.0657 × 1047.0005 × 1035.5754 × 1041.5308 × 1044.1726 × 1039.3222 × 1031.0817 × 1043.8440 × 103
std5.9616 × 1016.5191 × 1038.9659 × 1022.4713 × 1034.8545 × 1038.0981 × 1024.6421 × 1038.7921 × 1034.2315 × 1021.1253 × 1031.7695 × 1033.9568 × 101
F29mean8.3723 × 1031.0313 × 1041.0708 × 1042.5008 × 1042.4034 × 1061.4682 × 1041.3342 × 1061.5583 × 1041.0435 × 1041.3225 × 1041.2871 × 1049.5424 × 103
std6.1003 × 1021.6888 × 1033.7774 × 1021.4571 × 1042.3469 × 1061.8804 × 1039.0266 × 1051.1953 × 1041.1081 × 1031.3959 × 1031.5185 × 1034.2615 × 102
F30mean6.3701 × 1069.7467 × 1071.0439 × 1071.4970 × 10105.0011 × 10107.4598 × 1084.1053 × 10102.4285 × 1091.1978 × 1078.2198 × 1081.4441 × 1099.0562 × 107
std3.2492 × 1066.1779 × 1074.1847 × 1067.4639 × 1099.7578 × 1093.4036 × 1087.5905 × 1095.5095 × 1095.9905 × 1063.2161 × 1081.1092 × 1091.5677 × 107
Table 5. p-values for various algorithms on the CEC 2017 (dim = 30).
Table 5. p-values for various algorithms on the CEC 2017 (dim = 30).
ItemPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSO
F13.3384 × 10−112.7548 × 10−31.2967 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.6132 × 10−103.0199 × 10−111.2118 × 10−123.0199 × 10−11
F32.1959 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.1199 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−11
F42.7719 × 10−16.1210 × 10−104.5043 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−114.5726 × 10−94.4272 × 10−33.0199 × 10−113.0199 × 10−11
F58.8829 × 10−65.4941 × 10−113.0199 × 10−118.9934 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F69.0307 × 10−43.3285 × 10−13.0199 × 10−117.0881 × 10−83.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.3715 × 10−101.4643 × 10−10
F71.8567 × 10−92.9047 × 10−11.0937 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F86.3772 × 10−32.9215 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.2023 × 10−83.0199 × 10−111.4643 × 10−103.0199 × 10−11
F99.5139 × 10−62.1959 × 10−73.0199 × 10−111.0105 × 10−83.0199 × 10−113.0199 × 10−113.0199 × 10−115.4941 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F101.1711 × 10−21.3853 × 10−63.0199 × 10−113.0199 × 10−113.0199 × 10−115.5727 × 10−103.0199 × 10−111.5292 × 10−52.1959 × 10−71.1077 × 10−61.6947 × 10−9
F119.3341 × 10−23.0199 × 10−114.5043 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.3768 × 10−74.2175 × 10−43.0199 × 10−113.0199 × 10−11
F122.2273 × 10−91.0407 × 10−47.3803 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.2640 × 10−46.5277 × 10−83.0199 × 10−113.0199 × 10−11
F132.3168 × 10−61.7294 × 10−71.0702 × 10−97.2884 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−112.0338 × 10−94.1191 × 10−13.0199 × 10−112.7829 × 10−7
F146.5671 × 10−22.4386 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.3715 × 10−102.6243 × 10−35.0723 × 10−108.4848 × 10−9
F154.9818 × 10−41.0105 × 10−83.1967 × 10−96.0658 × 10−113.0199 × 10−114.5043 × 10−113.0199 × 10−117.5991 × 10−72.3985 × 10−13.4742 × 10−103.0199 × 10−11
F164.8413 × 10−24.7445 × 10−66.0658 × 10−114.4642 × 10−13.0199 × 10−118.1527 × 10−113.0199 × 10−111.4918 × 10−69.2603 × 10−91.3367 × 10−53.1589 × 10−10
F172.1540 × 10−65.4941 × 10−115.5727 × 10−101.0547 × 10−13.0199 × 10−112.3715 × 10−103.0199 × 10−119.2603 × 10−93.0199 × 10−111.7294 × 10−78.1014 × 10−10
F181.5178 × 10−33.2555 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−112.1544 × 10−103.0199 × 10−115.1857 × 10−78.5000 × 10−22.9215 × 10−91.1567 × 10−7
F192.4386 × 10−97.0617 × 10−11.8567 × 10−93.0199 × 10−113.0199 × 10−111.0937 × 10−103.0199 × 10−119.9410 × 10−12.0152 × 10−82.0523 × 10−33.4742 × 10−10
F203.5708 × 10−62.9215 × 10−93.0199 × 10−115.8282 × 10−33.0199 × 10−114.1997 × 10−103.0199 × 10−117.2208 × 10−61.2870 × 10−91.5964 × 10−71.2023 × 10−8
F213.6459 × 10−83.0199 × 10−113.0199 × 10−119.5332 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−112.6695 × 10−93.0199 × 10−113.0199 × 10−111.7769 × 10−10
F221.0000 × 1007.3803 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.9881 × 10−43.0199 × 10−113.0199 × 10−11
F233.0199 × 10−111.9568 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.4742 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F243.0199 × 10−114.5043 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.1589 × 10−10
F255.0912 × 10−66.0459 × 10−76.5261 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.6099 × 10−104.3531 × 10−53.0199 × 10−113.0199 × 10−11
F264.1178 × 10−63.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F279.9410 × 10−15.7460 × 10−26.6955 × 10−111.2362 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−118.8910 × 10−103.4742 × 10−104.1127 × 10−71.0702 × 10−9
F286.2040 × 10−13.6897 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.7769 × 10−106.7362 × 10−63.0199 × 10−113.0199 × 10−11
F292.8129 × 10−23.6439 × 10−22.8314 × 10−89.2344 × 10−13.0199 × 10−118.1527 × 10−113.0199 × 10−111.5964 × 10−76.5261 × 10−71.2362 × 10−39.2603 × 10−9
F303.0199 × 10−112.2360 × 10−27.3891 × 10−114.9752 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.1702 × 10−14.0772 × 10−111.6947 × 10−93.0199 × 10−11
Table 6. p-values for various algorithms on the CEC 2017 (dim = 50).
Table 6. p-values for various algorithms on the CEC 2017 (dim = 50).
ItemPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSO
F11.2870 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−119.3519 × 10−13.0199 × 10−113.0199 × 10−11
F23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.2118 × 10−123.0199 × 10−11
F33.0103 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−116.5204 × 10−13.0199 × 10−112.1544 × 10−103.0199 × 10−11
F49.0688 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.1937 × 10−63.0199 × 10−113.0199 × 10−11
F52.2823 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F65.5699 × 10−33.5547 × 10−13.0199 × 10−115.9673 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−114.6159 × 10−106.0658 × 10−113.0199 × 10−113.6897 × 10−11
F76.5277 × 10−83.7904 × 10−12.6806 × 10−43.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F86.3088 × 10−13.1589 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F93.0199 × 10−113.3386 × 10−33.4742 × 10−101.0937 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−116.1210 × 10−106.0658 × 10−113.0199 × 10−112.6099 × 10−10
F101.1882 × 10−17.5991 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.0666 × 10−71.7290 × 10−64.1997 × 10−103.0199 × 10−11
F113.6897 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.3111 × 10−81.0277 × 10−63.0199 × 10−113.0199 × 10−11
F122.8716 × 10−106.6955 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.0912 × 10−61.0035 × 10−33.0199 × 10−113.1589 × 10−10
F133.0199 × 10−112.0283 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−117.1186 × 10−93.0199 × 10−113.0199 × 10−11
F144.2259 × 10−37.7387 × 10−63.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.4913 × 10−65.6922 × 10−12.2273 × 10−92.0152 × 10−8
F159.7555 × 10−105.5727 × 10−104.9752 × 10−111.2597 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−112.0152 × 10−86.5671 × 10−23.0199 × 10−113.0199 × 10−11
F169.1171 × 10−13.1589 × 10−103.0199 × 10−115.9673 × 10−93.0199 × 10−116.1210 × 10−103.0199 × 10−111.6351 × 10−51.7290 × 10−63.0811 × 10−81.3289 × 10−10
F177.7272 × 10−25.0723 × 10−103.0199 × 10−113.5137 × 10−23.0199 × 10−114.0772 × 10−113.0199 × 10−112.8790 × 10−61.6132 × 10−108.4848 × 10−93.8249 × 10−9
F183.0339 × 10−31.4733 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−119.4683 × 10−35.2978 × 10−14.6159 × 10−105.4617 × 10−9
F193.3384 × 10−114.0595 × 10−23.0199 × 10−111.8368 × 10−23.0199 × 10−113.4742 × 10−103.0199 × 10−119.0688 × 10−33.6897 × 10−111.1536 × 10−11.1737 × 10−9
F207.6171 × 10−34.5726 × 10−93.0199 × 10−111.2967 × 10−13.0199 × 10−114.1997 × 10−103.0199 × 10−116.7362 × 10−67.1186 × 10−97.2951 × 10−42.6695 × 10−9
F211.1937 × 10−63.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F224.3764 × 10−18.1527 × 10−113.0199 × 10−118.8910 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−111.5292 × 10−58.2919 × 10−63.0199 × 10−112.8716 × 10−10
F232.1544 × 10−106.6955 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−114.6159 × 10−10
F243.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.4941 × 10−11
F257.3891 × 10−112.6099 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.9428 × 10−23.0199 × 10−113.0199 × 10−11
F261.9527 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F279.7052 × 10−13.3874 × 10−22.8716 × 10−101.8567 × 10−93.0199 × 10−114.6856 × 10−83.0199 × 10−113.0199 × 10−113.0199 × 10−111.0666 × 10−78.1527 × 10−11
F282.2273 × 10−97.3803 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.5923 × 10−53.0199 × 10−113.0199 × 10−11
F297.9590 × 10−31.2597 × 10−11.8731 × 10−78.8411 × 10−73.0199 × 10−114.0772 × 10−113.0199 × 10−111.0277 × 10−62.3715 × 10−101.4110 × 10−91.1567 × 10−7
F303.0199 × 10−119.8329 × 10−83.0199 × 10−114.6756 × 10−23.0199 × 10−118.1527 × 10−113.0199 × 10−113.6459 × 10−81.1567 × 10−77.3803 × 10−104.5726 × 10−9
Table 7. p-values for various algorithms on the CEC 2017 (dim = 100).
Table 7. p-values for various algorithms on the CEC 2017 (dim = 100).
ItemPSODBODMOIAOMGOPOPLOBKACPSOGSAHPHHOSCSO
F13.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.6947 × 10−93.0199 × 10−113.0199 × 10−11
F23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.2118 × 10−123.0199 × 10−11
F31.9568 × 10−103.0199 × 10−113.0199 × 10−115.1857 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−111.4918 × 10−63.0199 × 10−111.3703 × 10−33.6459 × 10−8
F43.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F55.9969 × 10−13.4971 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F61.5292 × 10−52.0523 × 10−33.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−118.8411 × 10−71.6980 × 10−83.0199 × 10−113.0199 × 10−11
F73.3384 × 10−111.4412 × 10−23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F82.5805 × 10−13.8249 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.2057 × 10−103.0199 × 10−113.0199 × 10−11
F93.0199 × 10−111.3367 × 10−53.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.8945 × 10−13.0199 × 10−113.0199 × 10−115.9673 × 10−9
F106.5671 × 10−23.0103 × 10−73.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−112.9215 × 10−91.5969 × 10−33.0199 × 10−113.0199 × 10−11
F113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F124.9752 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−116.7362 × 10−63.0199 × 10−113.0199 × 10−11
F138.9934 × 10−114.0772 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F141.3832 × 10−22.5721 × 10−73.0199 × 10−117.1988 × 10−53.0199 × 10−113.0199 × 10−113.0199 × 10−111.7836 × 10−46.7362 × 10−64.5043 × 10−114.6159 × 10−10
F153.6897 × 10−111.2057 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.5465 × 10−93.0199 × 10−113.0199 × 10−11
F161.1023 × 10−84.6856 × 10−83.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−115.1857 × 10−75.9428 × 10−23.0199 × 10−113.0199 × 10−11
F171.5798 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.8202 × 10−103.2555 × 10−75.0723 × 10−105.5727 × 10−10
F181.4128 × 10−13.0199 × 10−113.0199 × 10−117.7312 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−111.0188 × 10−52.7071 × 10−13.0199 × 10−112.9215 × 10−9
F193.0199 × 10−112.6695 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−117.7725 × 10−95.4941 × 10−113.0199 × 10−113.0199 × 10−11
F207.9590 × 10−35.5727 × 10−103.0199 × 10−113.8053 × 10−73.0199 × 10−113.1589 × 10−103.0199 × 10−112.0023 × 10−63.9648 × 10−81.1567 × 10−76.6955 × 10−11
F217.7725 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F221.7836 × 10−41.1711 × 10−23.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.7836 × 10−41.3017 × 10−33.0199 × 10−112.6099 × 10−10
F233.0199 × 10−113.0199 × 10−113.3679 × 10−43.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F241.3289 × 10−103.0199 × 10−111.7769 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F253.0199 × 10−114.1825 × 10−93.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−116.5261 × 10−73.0199 × 10−113.0199 × 10−11
F268.1200 × 10−48.9934 × 10−113.2651 × 10−23.0199 × 10−113.0199 × 10−111.0937 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F279.9186 × 10−114.1191 × 10−15.4941 × 10−113.0199 × 10−113.0199 × 10−118.1014 × 10−103.0199 × 10−118.1527 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−11
F283.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.1573 × 10−53.0199 × 10−113.0199 × 10−11
F291.4294 × 10−81.2235 × 10−13.1589 × 10−103.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.2057 × 10−108.6634 × 10−56.0658 × 10−116.0658 × 10−11
F303.0199 × 10−118.7663 × 10−13.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−113.0199 × 10−111.7666 × 10−33.0199 × 10−113.0199 × 10−114.6159 × 10−10
Table 8. The ranking of different algorithms on CEC2017.
Table 8. The ranking of different algorithms on CEC2017.
  SuitesCEC2017
  Dimensions103050
  Algorithms M . R T . R M . R T . R M . R T . R
  PSO3.0322.5722.502
  DBO5.8365.6055.604
  DMO4.7335.5346.106
  IAO5.1346.9088.3710
  MGO12.001211.931211.9312
  PO7.93107.63106.879
  PLO11.001111.071111.0711
  BKA5.5755.2735.675
  CPSOGSA6.5375.6765.073
  HPHHO6.5786.6076.207
  SCSO7.3396.9096.238
  MISCSO2.3312.3312.401
Table 9. Parameters of each distributed power supply.
Table 9. Parameters of each distributed power supply.
TypeMinimum Power/kWMaximum Power/kW Operating   Costs   ( $ k g 1 ) Fuel   Costs   ( $ k g 1 )
Photovoltaic Power (PV)01500.04500
Wind Power (WT)01000.00960
Energy Storage Device (BSS)−60600.05500
Diesel Generator (DE)01500.07800.21
Table 10. Pollutant treatment costs.
Table 10. Pollutant treatment costs.
Pollutant Type DE   Emission   Factor   ( k g / k W h ) Governance   Expenses   ( $ k g 1 )
C O 2 4.330.028
S O 2 0.465.950
N O 2 2.328.510
Table 11. Unit price of electricity purchase and sale.
Table 11. Unit price of electricity purchase and sale.
Price   ( $ h 1 ) Time Slot
Peak HoursOff-Peak HoursRegular Hours
10:00–14:0018:00–20:0007:00–09:0015:00–17:0000:00–06:0023:00–24:00
Purchase electricity0.690.460.31
Electricity Sales0.640.380.23
Table 12. Cost results obtained from different algorithms.
Table 12. Cost results obtained from different algorithms.
AlgorithmMaxMinMeanStdCPU TimeRank
PSO9053.315026.376571.94679.16213.962
DBO9314.996153.186765.53537.96228.133
DMO9922.436541.888371.58598.43235.058
IAO13,126.4410,707.3511,052.59412.19246.1112
MGO9563.786098.107239.33596.69253.064
PO8635.957569.528094.38185.62259.566
PLO9862.897635.818639.25394.87265.0310
BKA9948.467991.508742.36347.86270.0311
CPSOGSA9849.876213.968234.95623.58288.507
HPHHO9767.547036.798524.15171.69276.239
SCSO9122.866584.947974.972097.3208.545
MISCSO6258.324986.875495.67242.91210.081
Table 13. Full forms of abbreviations commonly used in this article.
Table 13. Full forms of abbreviations commonly used in this article.
AbbreviationFull Name
BKAblack-winged kite algorithm
CPSOGSAhybridization of constriction coefficient based on particle swarm optimization and gravitational search algorithm
DBOdung beetle optimizer
DMOdwarf mongoose optimization algorithm
GOAGrasshopper Optimization Algorithm
GWOgray wolf optimizer
HPHHOhybrid parallel Harris hawks optimization algorithm
IAOinformation acquisition optimizer
IWOInvasive Weed Optimization algorithm
MGOmoss growth optimization
MISCSOMulti-Strategy Improved Sand Cat Swarm Optimization
PSOparticle swarm optimization
POparrot optimizer
PLOpolar lights optimizer
RVEAreal-valued evolutionary algorithm
RIMERime optimization algorithm
SCSOsand cat optimization algorithm
Table 14. Common Symbols Used in This Article.
Table 14. Common Symbols Used in This Article.
SymbolMeaning
d i m Problem Dimensions
N Population size
P G R I D ι Interactive Power Between Microgrids and the Main Grid
P P V Photovoltaic power generation capacity
P W T Wind power generation capacity
P D E Diesel Generator Power
T Maximum number of iterations
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Liu, B.; Song, Z.; Wang, H. An Economic Scheduling Management Method for Microgrids Using Multi-Strategy Improved Sand Cat Swarm Optimization. Biomimetics 2025, 10, 735. https://doi.org/10.3390/biomimetics10110735

AMA Style

Liu B, Song Z, Wang H. An Economic Scheduling Management Method for Microgrids Using Multi-Strategy Improved Sand Cat Swarm Optimization. Biomimetics. 2025; 10(11):735. https://doi.org/10.3390/biomimetics10110735

Chicago/Turabian Style

Liu, Bingnan, Zhiyi Song, and Huiji Wang. 2025. "An Economic Scheduling Management Method for Microgrids Using Multi-Strategy Improved Sand Cat Swarm Optimization" Biomimetics 10, no. 11: 735. https://doi.org/10.3390/biomimetics10110735

APA Style

Liu, B., Song, Z., & Wang, H. (2025). An Economic Scheduling Management Method for Microgrids Using Multi-Strategy Improved Sand Cat Swarm Optimization. Biomimetics, 10(11), 735. https://doi.org/10.3390/biomimetics10110735

Article Metrics

Back to TopTop