Next Article in Journal
BPSKT: Knowledge Tracing with Bidirectional Encoder Representation Model Pre-Training and Sparse Attention
Previous Article in Journal
Learnable Anchor Embedding for Asymmetric Face Recognition
Previous Article in Special Issue
Interval Constrained Multi-Objective Optimization Scheduling Method for Island-Integrated Energy Systems Based on Meta-Learning and Enhanced Proximal Policy Optimization
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch

1
School of Computer Information and Engineering, Changzhou Institute of Technology, Changzhou 213032, China
2
School of Software and Big Data, Changzhou College of Information Technology, Changzhou 213164, China
*
Author to whom correspondence should be addressed.
Electronics 2025, 14(3), 456; https://doi.org/10.3390/electronics14030456
Submission received: 14 December 2024 / Revised: 16 January 2025 / Accepted: 20 January 2025 / Published: 23 January 2025

Abstract

:
Numerous optimization problems exist in the design and operation of power systems, critical for efficient energy use, cost minimization, and system stability. With increasing energy demand and diversifying energy structures, these problems grow increasingly complex. Metaheuristic algorithms have been highlighted for their flexibility and effectiveness in addressing such complex problems. To further explore the theoretical support of metaheuristic algorithms for optimization problems in power systems, this paper proposes a novel algorithm, the Boston Consulting Group Matrix-based Equilibrium Optimizer (BCGEO), which integrates the Equilibrium Optimizer (EO) with the classic economic decision-making model, the Boston Consulting Group Matrix. This matrix is utilized to construct a model for evaluating the potential of individuals, aiding in the rational allocation of computational resources, thereby achieving a better balance between exploration and exploitation. In comparative experiments across various dimensions on CEC2017, the BCGEO demonstrated superior search performance over its peers. Furthermore, in dynamic economic dispatch, the BCGEO has shown strong optimization capabilities and potential in power system optimization problems. Additionally, the experimental results in the spacecraft trajectory optimization problem suggest its potential for broader application across various fields.

1. Introduction

Optimization problems are pervasive across various fields, including economic dispatch in power systems [1], photovoltaic parameter estimation [2], wind farm layout in the new energy field [3], and feature selection in machine learning [4]. With escalating data volume, variables, and constraints, these problems grow increasingly complex, often eluding solutions from traditional algorithms. Such challenges necessitate innovative approaches, leading to the rise in metaheuristic algorithms (MHAs), which have attracted significant attention in recent decades [5,6,7]. Distinguished from traditional algorithms, MHAs offer the advantage of finding acceptable solutions even when the optimal solution remains unattainable within specified constraints. Their excellent search capability stems from the diverse sources of inspiration that inform their construction [8].
To this day, the sources of inspiration for MHAs continue to expand and can be broadly categorized into four main groups. The first category comprises evolutionary algorithms, originally inspired by Darwinian evolution and Mendelian genetics. A prime example is the genetic algorithm (GA), which employs chromosomes as search agents to iteratively explore and exploit the solution space in pursuit of optimality [9,10,11]. This foundational concept has also spurred the development of other algorithms, such as evolutionary strategies and differential evolution (DE) [12,13,14]. The second category consists of swarm intelligence algorithms, which emulate the social behaviors observed in animal populations. For instance, particle swarm optimization (PSO) simulates the collective foraging behavior of birds, where each bird’s flight is guided by both its personal best position and the best position of the swarm [15,16,17]. Similarly, ant colony optimization (ACO) simulates the pheromone-influenced foraging paths of ants [18,19,20,21]. The third category encompasses human-based algorithms, which are designed to simulate various aspects of human social behavior and cognitive processes. An example is the brain storm optimization (BSO) algorithm, which models the idea-generation process akin to the brainstorming approach proposed by Osborn [22,23], clustering ideas as search agents. The final category is physics-based algorithms, which draw inspiration from the principles of physics. A quintessential example is the gravitational search algorithm (GSA), applying gravitational laws and mass interactions to update search agents’ positions [24,25,26]. These diverse algorithms play a significant role across various domains. They contribute to constructing convolutional neural networks [27], enhancing medical image recognition [28,29,30,31], and even forecasting the spread of diseases like COVID-19, showcasing the versatility and adaptability of MHAs in addressing complex real-world optimizations [32].
In 2020, the Equilibrium Optimizer (EO) was introduced as a novel physics-based algorithm [33]. Drawing inspiration from a well-established mass balance model [34], this optimizer is founded on the principle of mass conservation within a control volume, as described in [35,36]. Since its inception, the EO has demonstrated remarkable performance across various domains. It has been effectively applied to diode parameter  estimation [37,38], solar photovoltaic parameter estimation [39,40,41], and multimodal image registration [42,43,44], among other applications. Nonetheless, adhering to the theory of No-Free-Lunch, there is a recognized scope for further enhancement of the EO algorithm.
The performance of MHAs, including the EO, is intrinsically linked to two fundamental search behaviors: exploration and exploitation [45]. Exploration is the process of seeking new solutions across the search space, aiming to find potentially globally optimal solutions [46,47]. It emphasizes diversity and breadth, introducing randomness and a variety of search strategies to escape local optima and expand the search horizon. Exploitation, on the other hand, involves the refinement and optimization of identified high-quality solutions, accelerating the convergence towards the global optimum [48,49]. This behavior prioritizes precision and focus, selectively enhancing existing solutions to focus on the global optimum. Neither behavior alone suffices for optimal MHA performance; instead, a delicate balance between the two is sought. Overemphasis on exploration may result in slow convergence, while an excessive focus on exploitation risks becoming trapped in local optima [50]. However, achieving this balance is challenging, as the solution space is often not fully known, making it difficult to discern whether a particular action constitutes exploration or exploitation [51]. This quest for balance remains an open and active area of research.
Within the MHA community, there is a widely acknowledged perspective that exploration and exploitation are intrinsically linked to population diversity [52]. Diversity reflects the variation among individuals, and a lack of diversity may hinder an algorithm from jumping out of local optima. Conversely, a diverse population usually indicates a stronger global search capability [53]. In algorithms such as the GA and DE, a diverse population also facilitates more efficient information exchange, as offspring similarity to their parents can limit the exploration of new solution spaces. While diversity is advantageous for MHAs, its precise relationship with the balance between exploration and exploitation remains unclear. This is because diversity can be achieved through pure exploration, and higher diversity does not necessarily imply better fitness in the population. Therefore, when designing MHAs, diversity should not be employed as the sole metric of performance [54,55]. Nevertheless, it is often regarded as a critical metric that must be balanced with other factors. Evidence from successful classical algorithms supports this view. For instance, the greedy selection mechanism commonly utilized in the GA and DE ensures that the most promising individuals are carried over to subsequent generations; offspring displace parents only if they demonstrate superior fitness. This mechanism not only accelerates convergence but also maintains population diversity, as each individual is an iteration from the initial generation. Additionally, in PSO, the personal best positions and the global best position serve as attractors, guiding the population towards potentially advantageous solutions [56]. This approach is also seen as a means of balancing convergence and diversity.
Building upon the established understanding of the interplay between exploration, exploitation, and population diversity, this paper introduces a novel approach to individual selection inspired by the Boston Consulting Group (BCG) Matrix. This approach, termed BCGEO, is designed to enhance the performance of the Equilibrium Optimizer (EO) by incorporating strategic principles from the BCG Matrix. The BCG Matrix, a classic decision model in economic strategy, was developed by Bruce D. Henderson in 1970 for the Boston Consulting Group [57]. It has since become a cornerstone for product analysis, aiding organizations in the rational distribution of their strategic resources. The matrix categorizes products into four quadrants—stars, question marks, dogs, and cash cows—based on relative market share and market growth rate. This classification enables companies to apply tailored strategies, prioritizing investment in more lucrative products [58,59]. The BCGEO employs a similar conceptual framework, using fitness and the magnitude of fitness improvement as key criteria for evaluating the potential of individuals. This two-dimensional evaluation allows for the identification of individuals with higher potential, ensuring that computational resources are directed towards those with the most promising prospects for improvement. Conversely, those considered to have lower potential are discarded, thereby optimizing the performance of the search process. By integrating the strategic insights of the BCG Matrix, the BCGEO aims to achieve a better balance between exploration and exploitation while maintaining diversity. In the field of metaheuristic algorithms, this application of a classic economic decision-making model is expected to contribute to the discussions on algorithm design and optimization strategies.
The motivation of this paper is to propose a novel mechanism for evaluating the potential of individuals to improve the performance of the EO and to provide more theoretical support for optimization problems existing in power systems. Similarly to most MHAs, the EO relies on fitness to evaluate the quality of individuals. However, the intermediate state of an individual does not accurately reflect its final state, which leads to the fact that relying on fitness alone may stifle individuals that have great potential but whose fitness is not good enough in the early stages. The BCGEO algorithm evaluates the potential of an individual based on its fitness and the magnitude of fitness improvement. Individuals that do not meet the criteria in both aspects will be discarded and computational resources will be shifted to the region near the individuals with higher potential through a local search. We expect such an evaluation mechanism to bring performance improvement to the EO, and provide more theoretical support for the research of MHAs. It is also our hope that these theories will assist in solving optimization problems in areas like the power systems.
The contributions of this paper can be summarized as follows: (1) This study incorporates the BCG Matrix decision model and innovatively proposes a two-dimensional particle potential evaluation mechanism based on the fitness and its improvement magnitude. (2) The BCGEO algorithm adopting this evaluation mechanism is benchmarked against the original EO as well as six other mainstream algorithms in numerical optimization comparison experiments, thus verifying the effectiveness of the evaluation mechanism and the competitiveness. (3) Through two real-world optimization problems, this paper verifies the potential of the BCGEO algorithm in the field of power systems, as well as the possibility of its application in other fields. (4) This paper also discusses the impact of this evaluation mechanism on population diversity, which provides a theoretical basis for further optimization and application of the algorithm.
The remaining sections of this paper are organized as follows: Section 2 describes the optimization process of the original EO algorithm in detail. Section 3 details the BCG Matrix decision model and describes how the model can be integrated into the BCGEO.  Section 4 shows experimental validation on numerical optimization and real-world optimization problems. Section 5 discusses the BCGEO and EO algorithms in terms of population diversity. Section 6 provides a comprehensive summary of the work in this study and an outlook on future research directions.

2. Equilibrium Optimizer

The EO derives its inspiration from a dynamic mass balance model that represents an equilibrium state within a control volume [60,61,62]. This state of equilibrium is defined by a condition where the rate of change in mass for non-reactive constituents over a unit time is balanced by the sum of the mass entering the system, the mass generated within it, and the mass exiting the system [63,64]. In the EO, particles that act as search agents are characterized by their concentrations, with the search objective being to reach this equilibrium state. The EO follows a process similar to PSO, with its main steps including population initialization, candidate update, and population update.

2.1. Initialization

In the original EO algorithm, the population initialization is executed through a random approach. Let x symbolize the particle utilized for search, with x u and x l denoting the upper and lower bounds of the search space, respectively. The population initialization equation of the EO can be represented as follows:
x i , d 0 = x d l + r i , d 0 · ( x d u x d l ) i = 1 , . . . , N d = 1 , . . . , D
where x 0 signifies the particles within the initial population, i represents the index of each particle, and N indicates the size of the population (i.e., the total number of particles). The dimension of the search space is denoted by D, and r 0 is a randomly assigned value ranging from 0 to 1.

2.2. Candidates Update

The candidate solution set in the EO, known as the equilibrium pool, fulfills a role akin to that of p b e s t and g b e s t in PSO. At the beginning of the search process, due to the lack of information about equilibrium states, “promising” particles are required to act as candidates for the equilibrium state, guiding the motion of the population. These “promising” particles constitute the equilibrium pool, which includes four best-so-far particles found by the population and an average particle. The average particle is obtained by taking the arithmetic mean of these four best particles. The calculation can be conducted   as follows:
x a p = x 1 p + x 2 p + x 3 p + x 4 p 4
here, x a p represents the average particle, and x 1 p to x 4 p represent the four best particles. The equilibrium pool can be represented as follows:
X p = x 1 p , x 2 p , x 3 p , x 4 p , x a p
The particles in the equilibrium pool are relevant to the update of each individual in the population. Among them, the four best-so-far particles provide exploration capabilities, enabling the population to explore a wider solution space. The average particle, on the other hand, contributes to exploitation capabilities, assisting the population in progressing towards better solutions. This combination of exploration and exploitation abilities helps improve the search efficiency of the algorithm and the quality of the optimization results.

2.3. Population Update

The population update equation for the EO is as follows:
x i , d ( k + 1 ) = x i , d p ( k ) + ( x i , d ( k ) x i , d p ( k ) ) · Q i , d ( k ) + E i , d ( k ) θ i , d ( k ) · V · ( 1 Q i , d ( k ) ) i = 1 , 2 , 3 , . . . , N d = 1 , 2 , 3 , . . . , D k = 1 , 2 , 3 , . . . , K
where x p signifies a particle randomly selected from the equilibrium pool. The index k is utilized to indicate the current generation, while K represents the maximum number of iterations. The control volume, denoted as V, is set to 1. θ is a random number that ranges between 0 and 1. Q is defined as follows:
Q i , d = α × g ( r Q 0.5 ) × [ e θ t 1 ]
t = ( 1 k K ) ( β k K )
In Equation (5), r Q represents a random value between 0 and 1. g ( ) is a sign function that takes a positive value if the variable is greater than 0, and a negative value otherwise. The parameters α and β are used to adjust the tendency of exploration and exploitation. A higher value of α increases the intensity of exploration, while a higher value of β increases the intensity of exploitation. The recommended values in the original EO are α = 2 and β = 1 . The third term in Equation (4) is referred to as the generation term, which is determined by the generation rate E, which can enhance the exploitation phase to provide the exact solutions. It can be calculated using the following equations:
E = E 0 Q
E i , d 0 = G i , d · ( x i , d p θ i , d · x i , d ) i = 1 , 2 , . . . . N d = 1 , 2 , . . . , D
G = 0.5 r G r P P 0 r P < P
Equation (9) defines the generation rate control parameter G, which determines the likelihood of the generation term contributing to the update process. The value of G is controlled by the generation probability P and two random numbers r G and r P , both ranging from 0 to 1. When r P is greater than P, the value of G is the product of r G and 0.5, at which point E is activated, and the current particle uses the generation term to update its state. When r P is less than P, G is 0, deactivating E, and the current particle update does not include the generation term. The number 0, along with G, and r G are represented as vectors, as they are arrays of length D, where D corresponds to the dimensions of each particle. When P is set to 1, the generation term is completely excluded from the update process. In contrast, when P is set to 0, the generation term is always involved in the update process. In the original EO, the generation probability parameter P is set to 0.5. From the equations above, it can be observed that the second term in Equation (4) tends to induce larger displacements of the particles, promoting an explorative effect. On the other hand, the third term is responsible for smaller displacements, facilitating a more exploitative behavior. This characteristic of the algorithm allows for a balanced exploration and exploitation in the search process.

3. Boston Consulting Group Matrix-Based Equilibrium Optimizer

3.1. Boston Consulting Group Matrix

The BCG Matrix, also known as the growth/share matrix, is an analytical tool for product portfolio management that is utilized to facilitate strategic decision-making and adjustments within a company [65]. It assesses the value and potential of a product by measuring its relative market share (RMS) and market growth rate (MGR) [66,67]. The relative market share is the proportional relationship between the sales of a product and that of its main competitors in a specific market. A larger RMS usually implies greater competitiveness, which can be viewed as the degree of success of a company’s product, as well as an internal measure of the company’s strength in the market. The market growth rate refers to the change in the market size of a product, which can be used to evaluate whether the size of the market opportunity is growing or declining. Thus, the MGR is also an external measure of market attractiveness. Typically, from an investment perspective, companies with declining relative market share are disfavored, while companies with growing market share indicate a competitive advantage. The BCG Matrix categorizes products into four quadrants using RMS and MGR as the horizontal and vertical axes, respectively: stars, question marks, dogs, and cash cows, as illustrated in Figure 1.
The descriptions and strategies for the four product categories are as follows:
  • Cash Cows: Products with high relative market share but low market growth rates. Renowned for their high profitability and cash-generating capabilities, Cash Cows typically generate excess cash that surpasses the amount needed to maintain business operations. Companies often strive to bolster their portfolios with a strong lineup of “Cash Cows”. The strategic approach to these products is to minimize further investment and to squeeze as much cash as possible, as significant investment in a low-growth sector may not generate commensurate returns.
  • Stars: Products with both high relative market share and market growth rate. They may necessitate significant cash infusion to secure and enhance their market standing. However, for companies, this investment is worthwhile because the focus of stars is to protect their market share and gain a larger share of the market growth than competitors. Under the precondition of maintaining market leadership, “Stars” have the potential to mature into “Cash Cows” when market growth rates decline. Conversely, if they fail to preserve their competitive position, they risk degenerating into “Dogs”.
  • Question Marks: Products with high market growth rates but low relative market shares. The high market growth rates suggest a need for substantial investment. However, due to their limited market share, these products do not generate substantial cash flows and may even incur a net cash outflow. If “Question Marks” can successfully increase their market share, they may evolve into “Stars”, and subsequently, “Cash Cows”; failure to do so may see them transform into “Dogs”.
  • Dogs: Products with low relative market share and market growth. They are generally less profitable and consume more cash than they yield. Dogs can detract from a company’s return on investment (ROI), a critical metric used by investors to gauge the effectiveness of a company’s management. To bolster overall performance, companies need to minimize their investments in “Dogs” or even divest from these less profitable businesses.

3.2. BCGEO

In 1999, Cooper et al. concluded from their research on portfolio management and performance practices that, in order to achieve higher performance, companies of reference place more emphasis on strategic methods rather than financial approaches [68,69]. Portfolio management refers to the strategic process of optimizing overall performance through methods such as resource allocation and risk assessment. It can be considered an optimization problem with the objective of maximizing overall performance. The BCG Matrix was introduced as a solution to this problem as early as the 1970s. The increasing usage of the BCG Matrix over the decades has further demonstrated its significance as a valuable tool for addressing portfolio management issues [70].
The integration of the BCG Matrix’s principles into the EO is particularly inspired by its two-dimensional evaluation of product potential. In the BCGEO, the potential of particles within the search space is evaluated based on their fitness and the magnitude of fitness improvement. This approach is analogous to the BCG Matrix’s classification of products into “Stars”, “Question Marks”, “Cash Cows”, and “Dogs”, each with distinct strategic implications. The magnitude of improvement in fitness refers to the difference in fitness between a particle in the current generation and in the previous generation. In the context of maximization optimization, it can be represented as follows:
Δ f ( x i ) = f ( x i c u r ) f ( x i p r e )
where f ( x i c u r ) is the fitness of the particle in the current generation, and f ( x i p r e ) is the fitness of the particle in the previous generation, thus Δ f denotes the change in fitness, which is also called the magnitude of the improvement.
In the BCGEO, particles with high fitness and significant improvement are identified as having high potential, akin to “Stars” with high market growth and relative market share. Conversely, those with low fitness and minimal improvement are considered less viable, similarly to “Dogs” with low market growth and relative market share, indicating a need to reduce investment or even divest. Computational resources initially assigned to particles with low fitness and limited improvement potential will be reallocated to those exhibiting high potential. This process reflects strategic decisions in portfolio management, aiming for a strategic shift of the population towards more promising search areas. The consistency with BCG Matrix decision-making ensures that the BCGEO serves not only as an optimization algorithm but also as a strategic tool for resource allocation and risk management in complex search spaces. This process can be represented by the following equations:
X A = [ x 1 A , x 2 A , x 3 A , . . . , x m A , . . . , x M A ] , 1 m M , 1 M N
X B = [ x 1 B , x 2 B , x 3 B , . . . , x m B , . . . , x M B ] , 1 m M , 1 M N
X C = X A X B
In Equations (11) and (12), X A represents the set of M worst particles sorted by fitness. X B represents the set of M worst particles sorted by the magnitude of fitness improvement. X C represents the intersection of these two sets, where particles within X C will be discarded. As the BCG Matrix divides products into four categories, for simplicity, M is set as one-fourth of the population size. The equation for discarding particles is as follows:
x m C = x p + S × ( x u x l ) × ( r C 0.5 ) , 1 m M
S ( k + 1 ) = S ( k ) γ , 1 k K
In Equation (14) and (15), x m C is a particle in X C , and x u and x l represent the upper and lower bounds of the search space, respectively. r C is a random number between 0 and 1. The search radius is denoted by S, and following previous research [12,71], it is initially set to 0.01. As the iterations progress, its value decreases, and the extent of its change depends on the shrinking parameter γ , which is set to 0.985. These equations illustrate that a discarded particle, once updated, loses its original information. The updated particle’s characteristics are entirely determined by the search behavior of particles in the equilibrium pool. This process differs from conventional local searches in that it does not perform function evaluations on updated particles, nor does it use comparisons to decide whether new particles are retained. The aim of this approach is to facilitate particles’ escape from the current region, thus preventing the wastage of computational resources that would arise from further exploitation of that area.
Furthermore, the equilibrium pool in the BCGEO introduces a distinctive approach compared to the original EO algorithm. Here, the particle exhibiting the most significant fitness improvement is selected for inclusion in the equilibrium pool. This strategy is driven by two rationales. First, as previously established, a significant increase in fitness is a strong indicator of a particle’s potential, hence an in-depth search around its location is worthwhile. Second, directly allocating computational resources to the most elite particles risks falling into a local optimum. To mitigate this, the infusion of new particles into the equilibrium pool is intended to enhance population diversity and encourage exploration. The equilibrium pool in the BCGEO is mathematically represented as follows:
x a p = x 1 p + x 2 p + x 3 p + x 4 p 4
X p = x 1 p , x 2 p , x 3 p , x 4 p , x a p , x b p
here, x b p represents the particle with the highest magnitude of fitness improvement in the current iteration. Algorithm 1 shows the pseudo code of the BCGEO, where the positions of some key equations in the search process are indicated.
Figure 2 illustrates the descriptive process of the BCGEO. In the case of a minimization evaluation function, the orange dots represent particles in the k-th iteration and the red dots represent particles in the ( k + 1 ) -th iteration. The green hexagram signifies a randomly selected particle from the equilibrium pool. The length of the blue arrows indicates the magnitude of fitness improvement. Particle x 2 is discarded due to insufficient fitness and the magnitude of fitness improvement. The newly generated particle x 2 n e w emerges within the search range of x p , escaping from the previous region. Figure 3 depicts the general flowchart of the BCGEO.
Algorithm 1: BCGEO
Electronics 14 00456 i001

4. Experimental Analysis

To evaluate the performance of the BCGEO algorithm, a comprehensive set of 29 benchmark functions from the CEC2017 competition was utilized. These functions encompass a range of complexities, including unimodal functions F1 to F2, simple multimodal functions F3 to F9, hybrid functions F10 to F19, and composition functions F20 to F29 [72]. In particular, hybrid functions combine different types of optimization problems or functions, typically by merging unimodal and multimodal components, to create more challenging problem scenarios. This structure is designed to reflect the complexity of real-world problems, where different subcomponents of the variables may exhibit distinct properties. Composition functions combine multiple basic functions, each with its own shifted optimum position and coverage range, to form a more complex and multimodal landscape. The composition function is defined as a weighted sum of these basic functions, with weights determined by the distance from the new shifted optimum positions.
In addition, to evaluate the effectiveness of BCGEO in addressing real-world challenges, two real-world optimization problems from the CEC2011 competition were included in the test, which are a dynamic economic dispatch problem in power systems and a spacecraft trajectory optimization problem [73].
Each experiment was independently run 51 times to ensure the accuracy and reliability of the results. Performance comparisons against other algorithms were statistically validated using the Wilcoxon signed-rank test at a significance level of 0.05 [74]. Superior performance by the BCGEO was denoted by “+”, underperformance by “−”, and no significant difference by “≈”. The cumulative counts of these indicators were denoted as w, t, and l, representing the number of “wins”, “tosses”, and “losses”, respectively. Furthermore, the Friedman test was utilized to rank the performance of the algorithms. The experiments were performed on a system equipped with an Intel(R) Core(TM) i7-12700H CPU at 2.30 GHz, running the Windows 11 operating system, with MATLAB R2020a serving as the computational platform.

4.1. Effectiveness Testing

The improvements in the BCGEO are divided into two main aspects: discarding unpromising particles and increasing the number of particles in the equilibrium pool. To ensure that these modifications enhance the algorithmic performance without adverse effects, we conducted an experimental comparison with two alternative versions: “OnlyPoolChange”, discarding no particles, and “NoPoolChange”, making no alterations to the equilibrium pool. Moreover, to confirm the benefits of assessing particle potential based on two dimensions rather than one, we introduced additional experimental configurations: “FitnessDiscard”, focusing solely on fitness as the criterion for discarding particles, and “FitnessImproveDiscard”, considering only the magnitude of fitness improvement as the criterion for discarding particles. The experiments were conducted on problems from the CEC2017 benchmark on 30 dimensions. The population size was set to 100, and the termination criterion was defined as the total number of function evaluations reaching D × 10 4 . Here, D refers to the dimension of the evaluation function. The results of the experiment are presented in Table 1.
In the effectiveness testing, the BCGEO was compared alongside FitnessDiscard, FitnessImproveDiscard, OnlyPoolChange, and NoPoolChange against the EO algorithm. Table 1 presents the results, showing that the BCGEO achieved 19 wins, while FitnessDiscard, FitnessImproveDiscard, and OnlyPoolChange each secured 18 wins, and NoPoolChange obtained 17 wins. These outcomes indicate that each modification in the BCGEO positively contributes to the algorithm’s performance. According to the Friedman rankings, the BCGEO’s performance ranks at the top. Consequently, the conclusion is reached that the two-dimensional evaluation of particle potential, factoring in both the fitness and the magnitude of fitness improvement, proves to be an effective approach.
To validate the effectiveness of the proposed enhancement approach in practical problems, we conducted an additional experiment on multi-threshold image segmentation. The experiment utilized three images, namely starfish, parrot, and boats, from commonly used test sets in the field of image processing [75,76]. The objective function chosen for the experiment was Kapur’s entropy, with a population size of 20 and a termination criterion of 100 iterations. The segmented images were evaluated using the Peak Signal to Noise Ratio (PSNR), Quality Index based on Local Variance (QILV), and Haar wavelet-based Perceptual Similarity Index (HPSI) to assess the image quality [77].
Figure 4 displays the original images and their segmented counterparts, obtained with threshold counts set to 6, 7, and 8. Table 2 presents the mean and best values of the objective function from 51 experiments, along with the average PSNR, QILV, and HPSI scores. Superior values within the table are indicated in bold. It can be observed that in optimizing the Kapur entropy, the BCGEO outperforms the EO in terms of both mean and best objective function values, indicating that the BCGEO is capable of segmenting images into regions with distinct features more effectively. Furthermore, based on the assessment results of the PSNR, QILV, and HPSI indicators, in most cases, the images segmented by the BCGEO algorithm have a higher degree of similarity to the original images. These experimental results demonstrate that the improvement scheme in the BCGEO is also effective for practical problems.

4.2. Benchmark Function Test

To evaluate the competitiveness of the BCGEO, comparative experiments were conducted against CBSO [78], RGBSO [79], GGSA [80], HGSA [81], GLPSO [82], and WFS [83]. The evaluation utilized the CEC2017 benchmark functions, tested over dimensions of 30, 50, and 100. Except for WFS, the population size for the algorithms was set to 100. Due to its particular nature, WFS operated with a population size of 10,000. The termination criterion was set as reaching D 10 4 function evaluations, where D represents the dimensions. Table 3 displays the parameter settings for the algorithms in this experiment.
Table 4, Table 5 and Table 6 show the experimental results of the algorithm on 30, 50, and 100 dimensions, respectively, across the 29 functions from the CEC2017 benchmark. In comparison with the EO, the BCGEO achieved 19, 20, and 20 wins on benchmark functions with these dimensions, respectively. Most of these wins came from simple multimodal functions, hybrid functions, as well as composition functions. The results clearly indicate that the improvement scheme in the BCGEO is effective across both low and high dimensions. In the comparison with CBSO, RGBSO, GGSA, HGSA, GLPSO, and WFS, the BCGEO achieved 23, 22, 23, 19, 24, and 27 wins on the 30 dimensions, 26, 25, 22, 19, 25, and 28 wins on the 50 dimensions, and 24, 21, 21, 18, 25, and 28 wins on the 100 dimensions, respectively. Additionally, BCGEO’s top ranking in the Friedman test further demonstrates its exceptional competitiveness.
Table 2. Experimental results of image segmentation.
Table 2. Experimental results of image segmentation.
Number of
Thresholds
EO BCGEO EOBCGEOEOBCGEOEOBCGEOEOBCGEO
MeanstdMeanstdBest Value PSNR QILV HPSI
Starfish631.42650.12930231.46150.1473231.6198231.624219.5876419.85260.9203960.926910.5940640.60912
735.309360.15426735.36070.1565835.5087335.513521.2821121.32890.9408160.944090.6817850.68428
838.901760.16576639.0030.1464539.1726139.182922.6051922.66490.952380.954250.7427320.74772
Parrot631.61760.1064831.65870.0789231.708531.708720.5626120.62210.9136350.920450.654160.651928
735.378670.12718235.44450.0475235.4766535.482321.8674521.99520.9347290.938340.6944950.69719
838.781850.19812338.85120.1784839.0661739.067422.9595923.120.9503920.954440.7267410.73209
Boats630.749640.12176230.79690.1003130.8666230.868620.7204720.80990.9180290.922670.6279630.63262
734.398530.06649734.4310.0492734.4896734.509521.746621.741050.9279980.928540.651520.649653
837.774820.11138637.81440.0934737.9585738.067823.1521423.20840.9487180.949740.718930.72054
Table 3. Parameter settings on CEC2017 benchmark functions.
Table 3. Parameter settings on CEC2017 benchmark functions.
AlgorithmParameters
CBSO P r e p = 0.2 ,   P c l u s / 1 = 0.8 ,   P c e n / 1 = 0.4 ,   P c e n / 2 = 0.5
RGBSO K = 5 ,   P c l u s / 1 = 0.8 ,   P c e n / 1 = 0.4 ,   P c e n / 2 = 0.5
GGSAS G 0 = 100 ,   α = 20 ,   w 1 ( t ) = 2 2 t 3 / T 3 ,   w 2 ( t ) = 2 t 3 / T 3
HGSA G 0 = 100 ,   L = 100 ,   w 1 ( t ) = 1 t 6 / T 6 ,   w 2 ( t ) = t 6 / T 6
GLPSO ω = 0.7298 ,   p m = 0.01 ,   c = 1.49618 ,   s g = 7
WFS v > 0
Table 4. Experimental results on CEC2017 benchmark functions with 30 dimensions.
Table 4. Experimental results on CEC2017 benchmark functions with 30 dimensions.
BCGEO EO CBSO RGBSO
Meanstd Meanstd Meanstd Meanstd
F1 4.028 × 10 3 4.732 × 10 3 3.535 × 10 3 3.996 × 10 3 3.455 × 10 3 2.883 × 10 3 2.539 × 10 3 2.795 × 10 3
F2 8.612 × 10 3 3.653 × 10 3 5.660 × 10 1 8.386 × 10 1 2.801 × 10 0 3.076 × 10 0 1 . 894 × 10 0 1 . 350 × 10 1
F3 8.774 × 10 1 6.386 × 10 0 7 . 715 × 10 1 2 . 398 × 10 1 9.278 × 10 1 1.907 × 10 1 8.010 × 10 1 3.150 × 10 1
F4 2 . 056 × 10 1 5 . 529 × 10 0 6.108 × 10 1 1.766 × 10 1 + 1.916 × 10 2 3.655 × 10 1 + 2.184 × 10 2 4.395 × 10 1 +
F5 4 . 383 × 10 5 4 . 633 × 10 5 5.462 × 10 3 1.602 × 10 2 + 4.901 × 10 1 7.888 × 10 0 + 5.755 × 10 1 1.011 c 10 1 +
F6 5.631 × 10 1 7.148 × 10 0 8.607 × 10 1 1.773 × 10 1 + 4.274 × 10 2 9.785 × 10 1 + 7.225 × 10 2 1.530 × 10 2 +
F7 2.317 × 10 1 6.187 × 10 0 6.216 × 10 1 1.442 × 10 1 + 1.441 × 10 2 2.804 × 10 1 + 1.591 × 10 2 2.882 × 10 1 +
F8 3.511 × 10 3 1.755 × 10 2 5.585 × 10 0 5.919 × 10 0 + 3.181 × 10 3 7.398 × 10 2 + 3.916 × 10 3 1.192 × 10 3 +
F9 2 . 012 × 10 3 4 . 675 × 10 2 3.432 × 10 3 7.442 × 10 2 + 4.254 × 10 3 5.554 × 10 2 + 4.451 × 10 3 5.690 × 10 2 +
F10 3 . 682 × 10 1 2 . 903 × 10 1 4.305 × 10 1 2.958 × 10 1 1.327 × 10 2 4.708 × 10 1 + 1.527 × 10 2 5.218 × 10 1 +
F11 8 . 469 × 10 4 4 . 558 × 10 4 8.837 × 10 4 1.270 × 10 5 1.930 × 10 6 1.182 × 10 6 + 8.852 × 10 5 6.113 × 10 5 +
F12 1.541 × 10 4 1.773 × 10 4 2.230 × 10 4 2.061 × 10 4 + 5.136 × 10 4 3.499 × 10 4 + 5.641 × 10 4 2.480 × 10 4 +
F13 2.128 × 10 4 1.261 × 10 4 7.908 × 10 3 8.610 × 10 3 2 . 097 × 10 3 2 . 322 × 10 3 3.556 × 10 3 3.019 × 10 3
F14 3.377 × 10 3 5.865 × 10 3 6.723 × 10 3 1.015 × 10 4 + 2.654 × 10 4 1.527 × 10 4 + 3.676 × 10 4 3.419 × 10 4 +
F15 3 . 449 × 10 1 3 . 990 × 10 1 6.280 × 10 2 2.601 × 10 2 + 1.189 × 10 3 2.768 × 10 2 + 1.557 × 10 3 4.261 × 10 2 +
F16 3 . 289 × 10 1 1 . 435 × 10 1 2.250 × 10 2 1.478 × 10 2 + 4.767 × 10 2 1.883 × 10 2 + 8.679 × 10 2 3.156 × 10 2 +
F17 3.921 × 10 5 1.743 × 10 5 1.252 × 10 5 1.048 × 10 5 8.636 × 10 4 4.595 × 10 4 1.108 × 10 5 7.374 × 10 4
F18 5.017 × 10 3 6.193 × 10 3 6.135 × 10 3 9.934 × 10 3 8.726 × 10 4 5.287 × 10 4 + 5.951 × 10 4 2.562 × 10 4 +
F19 7 . 777 × 10 1 5 . 412 × 10 1 2.391 × 10 2 1.543 × 10 2 + 5.045 × 10 2 1.292 × 10 2 + 8.956 × 10 2 2.159 × 10 2 +
F20 2 . 199 × 10 2 5 . 473 × 10 0 2.572 × 10 2 1.750 × 10 1 + 3.771 × 10 2 4.322 × 10 1 + 4.176 × 10 2 3.928 × 10 1 +
F21 1 . 000 × 10 2 2 . 040 × 10 13 1.209 × 10 3 1.693 × 10 3 + 3.123 × 10 3 2.118 × 10 3 + 4.539 × 10 3 1.663 × 10 3 +
F22 3 . 623 × 10 2 9 . 457 × 10 0 4.095 × 10 2 2.177 × 10 1 + 7.008 × 10 2 1.260 × 10 2 + 1.005 × 10 3 1.210 × 10 2 +
F23 4 . 359 × 10 2 7 . 736 × 10 0 4.811 × 10 2 1.929 × 10 1 + 7.231 × 10 2 1.255 × 10 2 + 1.155 × 10 3 1.021 × 10 2 +
F24 3 . 860 × 10 2 1 . 504 × 10 0 3.888 × 10 2 1.203 × 10 1 + 3.896 × 10 2 8.816 × 10 0 + 3.904 × 10 2 1.295 × 10 1
F25 9.561 × 10 2 1.424 × 10 2 1.580 × 10 3 2.792 × 10 2 + 3.696 × 10 3 2.039 × 10 3 + 6.068 × 10 3 1.041 × 10 3 +
F26 5 . 053 × 10 2 8 . 418 × 10 0 5.130 × 10 2 8.095 × 10 0 + 6.713 × 10 2 1.593 × 10 2 + 1.233 × 10 3 2.523 × 10 2 +
F27 3.813 × 10 2 4.230 × 10 1 3.412 × 10 2 4.823 × 10 1 3.830 × 10 2 4.589 × 10 1 3.434 × 10 2 5.768 × 10 1
F28 4 . 821 × 10 2 3 . 279 × 10 1 6.372 × 10 2 1.416 × 10 2 + 1.324 × 10 3 2.881 × 10 2 + 1.675 × 10 3 3.453 × 10 2 +
F29 4 . 814 × 10 3 2 . 707 × 10 3 5.843 × 10 3 3.528 × 10 3 3.925 × 10 5 2.109 × 10 5 + 2.167 × 10 5 1.611 × 10 5 +
w/t/l - 19/4/6 23/3/3 22/2/5
Friedman
Rankings
2.2241 2.8966 5.4828 6.069
GGSA HGSA GLPSO WFS
meanstd meanstd meanstd meanstd
F1 1 . 845 × 10 3 9 . 625 × 10 2 2.840 × 10 3 2.568 × 10 3 9.855 × 10 4 4.741 × 10 5 7.061 × 10 8 3.322 × 10 8 +
F2 5.816 × 10 4 6.555 × 10 3 + 4.483 × 10 4 3.599 × 10 3 + 2.191 × 10 4 5.145 × 10 3 + 1.500 × 10 4 4.385 × 10 3 +
F3 1.305 × 10 2 1.950 × 10 1 + 1.191 × 10 2 2.141 × 10 0 + 2.914 × 10 2 9.243 × 10 1 + 2.454 × 10 2 5.224 × 10 1 +
F4 1.104 × 10 2 1.156 × 10 1 + 1.512 × 10 2 1.364 × 10 1 + 1.761 × 10 2 1.916 × 10 1 + 1.447 × 10 2 2.978 × 10 1 +
F5 7.976 × 10 0 3.914 × 10 0 + 8.907 × 10 0 5.858 × 10 0 + 5.087 × 10 0 2.062 × 10 0 + 2.550 × 10 1 5.934 × 10 0 +
F6 3 . 708 × 10 1 1 . 971 × 10 0 4.026 × 10 1 2.350 × 10 0 1.620 × 10 2 5.406 × 10 1 + 2.344 × 10 2 3.747 × 10 1 +
F7 8.525 × 10 1 1.105 × 10 1 + 1.042 × 10 2 8.549 × 10 0 + 1.535 × 10 2 3.818 × 10 1 + 1.350 × 10 2 3.097 × 10 1 +
F8 1.115 × 10 13 1.592 × 10 14 + 5 . 466 × 10 14 5 . 736 × 10 14 1.409 × 10 1 9.247 × 10 0 + 1.769 × 10 3 1.126 × 10 3 +
F9 3.310 × 10 3 3.822 × 10 2 + 3.183 × 10 3 4.904 × 10 2 + 6.542 × 10 3 3.351 × 10 2 + 4.599 × 10 3 6.497 × 10 2 +
F10 1.452 × 10 2 3.227 × 10 1 + 9.613 × 10 1 2.965 × 10 1 + 1.322 × 10 2 6.007 × 10 1 + 3.211 × 10 2 6.943 × 10 1 +
F11 9.557 × 10 5 2.920 × 10 6 + 1.352 × 10 5 7.064 × 10 4 + 7.840 × 10 6 1.328 × 10 7 + 9.802 × 10 7 7.885 × 10 7 +
F12 1.773 × 10 4 4.815 × 10 3 + 1 . 246 × 10 4 5 . 210 × 10 3 5.504 × 10 4 2.297 × 10 5 7.474 × 10 5 8.142 × 10 5 +
F13 2.307 × 10 5 9.825 × 10 4 + 7.247 × 10 3 5.010 × 10 3 3.526 × 10 4 8.101 × 10 4 7.673 × 10 3 7.822 × 10 3
F14 2.897 × 10 3 1.518 × 10 3 7 . 404 × 10 2 5 . 749 × 10 2 8.491 × 10 3 8.313 × 10 3 + 1.553 × 10 5 1.581 × 10 5 +
F15 1.183 × 10 3 2.290 × 10 2 + 1.153 × 10 3 1.836 × 10 2 + 1.359 × 10 3 2.055 × 10 2 + 9.717 × 10 2 2.496 × 10 2 +
F16 1.020 × 10 3 2.020 × 10 2 + 1.044 × 10 3 1.898 × 10 2 + 2.777 × 10 2 1.646 × 10 2 + 3.222 × 10 2 1.068 × 10 2 +
F17 1.577 × 10 5 7.468 × 10 4 6 . 117 × 10 4 1 . 930 × 10 4 6.947 × 10 5 7.499 × 10 5 2.156 × 10 5 1.481 × 10 5
F18 4.249 × 10 3 1.451 × 10 3 2 . 867 × 10 3 1 . 167 × 10 3 9.548 × 10 3 1.393 × 10 4 1.104 × 10 6 1.130 × 10 6 +
F19 8.958 × 10 2 1.703 × 10 2 + 9.078 × 10 2 1.905 × 10 2 + 2.793 × 10 2 1.377 × 10 2 + 3.918 × 10 2 1.084 × 10 2 +
F20 3.157 × 10 2 1.821 × 10 1 + 3.209 × 10 2 3.538 × 10 1 + 3.743 × 10 2 2.345 × 10 1 + 3.332 × 10 2 2.850 × 10 1 +
F21 1.000 × 10 2 1.475 × 10 10 + 1.911 × 10 2 6.439 × 10 2 + 1.021 × 10 2 2.319 × 10 0 + 3.027 × 10 2 8.436 × 10 1 +
F22 5.600 × 10 2 3.596 × 10 1 + 4.731 × 10 2 1.275 × 10 2 + 5.930 × 10 2 2.099 × 10 1 + 5.310 × 10 2 3.988 × 10 1 +
F23 5.082 × 10 2 3.327 × 10 1 + 5.182 × 10 2 3.901 × 10 1 + 6.565 × 10 2 2.180 × 10 1 + 5.791 × 10 2 3.661 × 10 1 +
F24 4.271 × 10 2 1.216 × 10 1 + 3.917 × 10 2 8.595 × 10 0 + 4.330 × 10 2 2.126 × 10 1 + 5.235 × 10 2 3.617 × 10 1 +
F25 3.644 × 10 2 5.810 × 10 2 2 . 529 × 10 2 4 . 991 × 10 1 2.945 × 10 3 9.361 × 10 2 + 2.537 × 10 3 7.018 × 10 2 +
F26 6.768 × 10 2 4.510 × 10 1 + 5.552 × 10 2 2.274 × 10 1 + 6.666 × 10 2 2.153 × 10 1 + 6.188 × 10 2 3.091 × 10 1 +
F27 4.294 × 10 2 2.264 × 10 1 + 3 . 097 × 10 2 2 . 678 × 10 1 5.465 × 10 2 7.722 × 10 1 + 6.325 × 10 2 7.868 × 10 1 +
F28 1.406 × 10 3 2.283 × 10 2 + 1.197 × 10 3 2.116 × 10 2 + 8.682 × 10 2 1.783 × 10 2 + 1.005 × 10 3 1.440 × 10 2 +
F29 4.022 × 10 4 1.594 × 10 4 + 7.428 × 10 3 1.707 × 10 3 + 9.170 × 10 4 1.539 × 10 5 + 6.895 × 10 6 5.630 × 10 6 +
w/t/l 23/3/3 19/2/8 24/5/0 27/0/2
Friedman
Rankings
4.3103 3.4655 5.6552 5.8966
Table 5. Experimental results on CEC2017 benchmark functions with 50 dimensions.
Table 5. Experimental results on CEC2017 benchmark functions with 50 dimensions.
BCGEO EO CBSO RGBSO
Meanstd Meanstd Meanstd Meanstd
F1 1.722 × 10 3 1.606 × 10 3 2.832 × 10 3 2.711 × 10 3 6.145 × 10 3 5.608 × 10 3 + 2.379 × 10 3 3.402 × 10 3
F2 5.215 × 10 4 1.239 × 10 4 2.844 × 10 3 2.216 × 10 3 5 . 507 × 10 1 2 . 370 × 10 1 1.708 × 10 3 3.176 × 10 3
F3 9.947 × 10 1 3.579 × 10 0 8 . 635 × 10 1 4 . 305 × 10 1 1.737 × 10 2 5.016 × 10 1 + 1.448 × 10 2 5.685 × 10 1 +
F4 5 . 332 × 10 1 1 . 020 × 10 1 1.508 × 10 2 2.866 × 10 1 + 3.258 × 10 2 5.261 × 10 1 + 3.648 × 10 2 7.374 × 10 1 +
F5 2 . 543 × 10 3 2 . 338 × 10 3 1.323 × 10 1 2.717 × 10 1 + 5.772 × 10 1 6.903 × 10 0 + 6.180 × 10 1 5.644 × 10 0 +
F6 1.196 × 10 2 1.384 × 10 1 1.932 × 10 2 3.798 × 10 1 + 9.181 × 10 2 1.494 × 10 2 + 1.391 × 10 3 2.702 × 10 2 +
F7 5 . 673 × 10 1 1 . 158 × 10 1 1.549 × 10 2 2.480 × 10 1 + 3.328 × 10 2 4.648 × 10 1 + 3.614 × 10 2 5.549 × 10 1 +
F8 1 . 083 × 10 0 7 . 195 × 10 1 1.856 × 10 2 3.628 × 10 2 + 9.884 × 10 3 1.646 × 10 3 + 1.163 × 10 4 2.228 × 10 3 +
F9 4 . 661 × 10 3 7 . 639 × 10 2 6.178 × 10 3 9.814 × 10 2 + 7.365 × 10 3 8.475 × 10 2 + 7.652 × 10 3 7.801 × 10 2 +
F10 3 . 841 × 10 1 4 . 907 × 10 0 1.287 × 10 2 6.057 × 10 1 + 2.034 × 10 2 4.760 × 10 1 + 2.021 × 10 2 5.242 × 10 1 +
F11 2.012 × 10 6 1.321 × 10 6 8.909 × 10 5 6.633 × 10 5 1.502 × 10 7 9.505 × 10 6 + 3.772 × 10 6 1.665 × 10 6 +
F12 9.020 × 10 3 9.437 × 10 3 7.071 × 10 3 6.386 × 10 3 6.368 × 10 4 3.754 × 10 4 + 7.850 × 10 4 5.173 × 10 4 +
F13 5.227 × 10 4 4.677 × 10 4 5.164 × 10 4 4.412 × 10 4 2.681 × 10 4 1.715 × 10 4 2.592 × 10 4 2.025 × 10 4
F14 1.125 × 10 4 5.999 × 10 3 1.234 × 10 4 7.610 × 10 3 2.760 × 10 4 1.684 × 10 4 + 3.196 × 10 4 1.698 × 10 4 +
F15 3 . 781 × 10 2 1 . 485 × 10 2 1.253 × 10 3 3.849 × 10 2 + 2.182 × 10 3 4.718 × 10 2 + 2.455 × 10 3 5.077 × 10 2 +
F16 2 . 825 × 10 2 1 . 456 × 10 2 1.061 × 10 3 3.141 × 10 2 + 1.607 × 10 3 3.539 × 10 2 + 2.077 × 10 3 3.478 × 10 2 +
F17 1.179 × 10 6 3.223 × 10 5 2.973 × 10 5 1.923 × 10 5 1.720 × 10 5 8.712 × 10 4 1 . 233 × 10 5 7 . 027 × 10 4
F18 1.790 × 10 4 1.023 × 10 4 1.749 × 10 4 1.376 × 10 4 3.859 × 10 5 2.366 × 10 5 + 1.709 × 10 5 6.359 × 10 4 +
F19 2 . 460 × 10 2 1 . 082 × 10 2 8.543 × 10 2 3.131 × 10 2 + 1.287 × 10 3 2.898 × 10 2 + 1.778 × 10 3 3.733 × 10 2 +
F20 2 . 533 × 10 2 1 . 036 × 10 1 3.280 × 10 2 2.814 × 10 1 + 6.313 × 10 2 8.281 × 10 1 + 6.859 × 10 2 8.144 × 10 1 +
F21 2 . 830 × 10 3 2 . 315 × 10 3 6.650 × 10 3 9.778 × 10 2 + 8.048 × 10 3 9.646 × 10 2 + 8.162 × 10 3 8.804 × 10 2 +
F22 4 . 595 × 10 2 1 . 528 × 10 1 5.471 × 10 2 3.438 × 10 1 + 1.110 × 10 3 2.050 × 10 2 + 1.693 × 10 3 2.045 × 10 2 +
F23 5 . 290 × 10 2 9 . 541 × 10 0 6.123 × 10 2 2.705 × 10 1 + 1.073 × 10 3 2.399 × 10 2 + 1.821 × 10 3 1.982 × 10 2 +
F24 5 . 239 × 10 2 4 . 154 × 10 1 5.488 × 10 2 3.619 × 10 1 + 5.686 × 10 2 3.089 × 10 1 + 5.458 × 10 2 4.204 × 10 1 +
F25 1.330 × 10 3 2.403 × 10 2 2.382 × 10 3 4.244 × 10 2 + 9.242 × 10 3 2.068 × 10 3 + 1.124 × 10 4 1.242 × 10 3 +
F26 5 . 198 × 10 2 2 . 168 × 10 1 6.328 × 10 2 5.521 × 10 1 + 1.323 × 10 3 3.804 × 10 2 + 2.873 × 10 3 5.555 × 10 2 +
F27 4 . 588 × 10 2 1 . 146 × 10 3 4.936 × 10 2 2.380 × 10 1 + 5.088 × 10 2 2.250 × 10 1 + 5.011 × 10 2 2.155 × 10 1 +
F28 5 . 589 × 10 2 6 . 016 × 10 1 9.485 × 10 2 3.237 × 10 2 + 2.553 × 10 3 4.503 × 10 2 + 2.701 × 10 3 4.779 × 10 2 +
F29 8 . 389 × 10 5 1 . 330 × 10 5 1.035 × 10 6 2.039 × 10 5 + 1.147 × 10 7 3.525 × 10 6 + 8.910 × 10 6 1.168 × 10 6 +
w/t/l 20/5/4 26/0/3 25/1/3
Friedman
Rankings
2.069 2.6897 5.4138 5.8966
GGSA HGSA GLPSO WFS
meanstd meanstd meanstd meanstd
F1 8.151 × 10 2 1.190 × 10 3 7 . 945 × 10 2 1 . 115 × 10 3 6.138 × 10 6 4.045 × 10 7 1.672 × 10 9 5.857 × 10 8 +
F2 1.357 × 10 5 1.019 × 10 4 + 1.180 × 10 5 9.514 × 10 3 + 7.827 × 10 4 1.101 × 10 4 + 3.396 × 10 4 5.752 × 10 3
F3 1.852 × 10 2 5.426 × 10 1 + 1.958 × 10 2 3.970 × 10 1 + 8.643 × 10 2 2.489 × 10 2 + 4.725 × 10 2 1.192 × 10 2 +
F4 2.268 × 10 2 2.059 × 10 1 + 2.676 × 10 2 2.065 × 10 1 + 3.566 × 10 2 4.186 × 10 1 + 2.754 × 10 2 4.782 × 10 1 +
F5 2.455 × 10 1 4.689 × 10 0 + 2.362 × 10 1 4.394 × 10 0 + 1.472 × 10 1 2.961 × 10 0 + 3.170 × 10 1 8.117 × 10 0 +
F6 6 . 565 × 10 1 2 . 808 × 10 0 7.097 × 10 1 4.037 × 10 0 3.677 × 10 2 8.170 × 10 1 + 4.310 × 10 2 6.070 × 10 1 +
F7 2.322 × 10 2 2.094 × 10 1 + 2.918 × 10 2 1.582 × 10 1 + 3.620 × 10 2 3.855 × 10 1 + 2.727 × 10 2 4.181 × 10 1 +
F8 6.505 × 10 2 4.508 × 10 2 + 1.133 × 10 1 8.013 × 10 1 1.488 × 10 3 1.104 × 10 3 + 7.835 × 10 3 4.195 × 10 3 +
F9 5.856 × 10 3 5.261 × 10 2 + 5.747 × 10 3 5.356 × 10 2 + 1.231 × 10 4 4.412 × 10 2 + 8.582 × 10 3 1.036 × 10 3 +
F10 4.027 × 10 2 8.683 × 10 1 + 1.262 × 10 2 1.352 × 10 1 + 7.270 × 10 2 6.007 × 10 2 + 6.736 × 10 2 1.194 × 10 2 +
F11 1.426 × 10 6 3.676 × 10 5 8 . 335 × 10 5 3 . 748 × 10 5 1.251 × 10 8 3.145 × 10 8 + 3.315 × 10 8 1.775 × 10 8 +
F12 1.333 × 10 4 2.085 × 10 3 + 5 . 693 × 10 2 6 . 358 × 10 2 2.880 × 10 6 1.276 × 10 7 3.384 × 10 6 3.226 × 10 6 +
F13 7.864 × 10 4 3.492 × 10 4 + 2 . 290 × 10 4 1 . 282 × 10 4 2.809 × 10 5 4.382 × 10 5 + 1.115 × 10 5 9.378 × 10 4 +
F14 7.238 × 10 3 2.067 × 10 3 7.845 × 10 3 1.791 × 10 3 6 . 184 × 10 3 6 . 436 × 10 3 9.225 × 10 5 1.021 × 10 6 +
F15 1.759 × 10 3 3.008 × 10 2 + 1.828 × 10 3 3.048 × 10 2 + 2.785 × 10 3 4.031 × 10 2 + 1.793 × 10 3 4.811 × 10 2 +
F16 1.733 × 10 3 3.044 × 10 2 + 1.670 × 10 3 3.095 × 10 2 + 1.505 × 10 3 2.726 × 10 2 + 1.285 × 10 3 2.466 × 10 2 +
F17 8.779 × 10 5 6.773 × 10 5 1.815 × 10 5 6.779 × 10 4 3.868 × 10 6 4.309 × 10 6 + 1.601 × 10 6 9.382 × 10 5 +
F18 1.469 × 10 4 2.796 × 10 3 1 . 423 × 10 4 3 . 336 × 10 3 6.479 × 10 4 3.813 × 10 5 1.954 × 10 6 1.403 × 10 6 +
F19 1.219 × 10 3 2.864 × 10 2 + 1.315 × 10 3 3.107 × 10 2 + 1.313 × 10 3 3.192 × 10 2 + 9.669 × 10 2 2.346 × 10 2 +
F20 4.495 × 10 2 3.068 × 10 1 + 4.561 × 10 2 2.659 × 10 1 + 5.756 × 10 2 2.577 × 10 1 + 4.730 × 10 2 4.939 × 10 1 +
F21 7.729 × 10 3 4.755 × 10 2 + 7.902 × 10 3 5.189 × 10 2 + 1.122 × 10 4 3.842 × 10 3 + 8.180 × 10 3 2.080 × 10 3 +
F22 8.633 × 10 2 9.392 × 10 1 + 1.071 × 10 3 1.964 × 10 2 + 9.861 × 10 2 4.881 × 10 1 + 8.064 × 10 2 6.412 × 10 1 +
F23 8.271 × 10 2 4.575 × 10 1 + 8.866 × 10 2 4.895 × 10 1 + 1.055 × 10 3 4.607 × 10 1 + 8.493 × 10 2 7.058 × 10 1 +
F24 6.558 × 10 2 2.651 × 10 1 + 5.813 × 10 2 1.493 × 10 1 + 9.207 × 10 2 1.121 × 10 2 + 9.038 × 10 2 9.022 × 10 1 +
F25 3.168 × 10 2 1.197 × 10 2 3 . 000 × 10 2 7 . 596 × 10 13 5.958 × 10 3 6.938 × 10 2 + 4.742 × 10 3 5.017 × 10 2 +
F26 1.341 × 10 3 1.647 × 10 2 + 1.401 × 10 3 2.788 × 10 2 + 1.419 × 10 3 1.126 × 10 2 + 1.069 × 10 3 1.120 × 10 2 +
F27 6.278 × 10 2 8.239 × 10 1 + 5.023 × 10 2 2.110 × 10 1 + 1.207 × 10 3 2.199 × 10 2 + 1.260 × 10 3 3.099 × 10 2 +
F28 2.230 × 10 3 2.890 × 10 2 + 1.706 × 10 3 2.706 × 10 2 + 2.037 × 10 3 4.919 × 10 2 + 1.981 × 10 3 3.938 × 10 2 +
F29 3.002 × 10 7 4.668 × 10 6 + 1.340 × 10 6 9.608 × 10 4 + 1.236 × 10 7 6.858 × 10 6 + 1.995 × 10 8 3.754 × 10 7 +
w/t/l 22/1/6 19/1/9 25/2/2 28/0/1
Friedman
Rankings
5.8966 3.5862 6.3103 5.8621
Table 6. Experimental results on CEC2017 benchmark functions with 100 dimensions.
Table 6. Experimental results on CEC2017 benchmark functions with 100 dimensions.
BCGEO EO CBSO RGBSO
Meanstd Meanstd Meanstd Meanstd
F1 4.225 × 10 3 3.153 × 10 3 6.123 × 10 3 8.098 × 10 3 3.526 × 10 6 1.046 × 10 6 + 5.465 × 10 3 6.283 × 10 3
F2 2.616 × 10 5 2.722 × 10 4 5.614 × 10 4 1.004 × 10 4 8 . 793 × 10 3 3 . 177 × 10 3 5.128 × 10 4 3.194 × 10 4
F3 2.454 × 10 2 2.599 × 10 1 2 . 250 × 10 2 4 . 684 × 10 1 2.876 × 10 2 5.196 × 10 1 + 2.407 × 10 2 5.821 × 10 1
F4 2 . 137 × 10 2 3 . 081 × 10 1 4.507 × 10 2 6.283 × 10 1 + 8.253 × 10 2 7.597 × 10 1 + 8.663 × 10 2 8.069 × 10 1 +
F5 3.057 × 10 1 1.396 × 10 1 4.842 × 10 0 3.568 × 10 0 + 6.557 × 10 1 4.422 × 10 0 + 6.500 × 10 1 4.578 × 10 0 +
F6 3.522 × 10 2 3.928 × 10 1 6.247 × 10 2 1.065 × 10 2 + 2.423 × 10 3 3.097 × 10 2 + 3.645 × 10 3 5.085 × 10 2 +
F7 2 . 101 × 10 2 3 . 583 × 10 1 4.190 × 10 2 6.295 × 10 1 + 9.342 × 10 2 9.183 × 10 1 + 9.889 × 10 2 1.006 × 10 2 +
F8 3 . 608 × 10 1 1 . 379 × 10 1 1.009 × 10 4 3.534 × 10 3 + 2.676 × 10 4 2.753 × 10 3 + 2.394 × 10 4 2.259 × 10 3 +
F9 1.248 × 10 4 1.296 × 10 3 1.413 × 10 4 1.441 × 10 3 + 1.576 × 10 4 1.304 × 10 3 + 1.556 × 10 4 1.140 × 10 3 +
F10 2.914 × 10 3 8.104 × 10 2 7 . 473 × 10 2 2 . 280 × 10 2 1.216 × 10 3 1.718 × 10 2 1.297 × 10 3 2.819 × 10 2
F11 6.109 × 10 6 2.857 × 10 6 1.987 × 10 6 9.078 × 10 5 1.112 × 10 8 2.731 × 10 7 + 1.687 × 10 7 6.254 × 10 6 +
F12 5.925 × 10 3 6.931 × 10 3 6.740 × 10 3 4.174 × 10 3 + 3.861 × 10 4 1.208 × 10 4 + 4.117 × 10 4 1.389 × 10 4 +
F13 4.926 × 10 5 8.436 × 10 4 3.187 × 10 5 1.136 × 10 5 2.857 × 10 5 1.121 × 10 5 9 . 207 × 10 4 3 . 070 × 10 4
F14 2.377 × 10 3 3.822 × 10 3 3.534 × 10 3 3.067 × 10 3 + 3.233 × 10 4 1.642 × 10 4 + 3.764 × 10 4 1.784 × 10 4 +
F15 1 . 793 × 10 3 4 . 185 × 10 2 3.311 × 10 3 7.184 × 10 2 + 5.268 × 10 3 8.399 × 10 2 + 5.188 × 10 3 8.145 × 10 2 +
F16 1 . 128 × 10 3 3 . 025 × 10 2 3.169 × 10 3 6.124 × 10 2 + 3.839 × 10 3 5.209 × 10 2 + 3.828 × 10 3 5.856 × 10 2 +
F17 1.888 × 10 6 2.654 × 10 5 6.365 × 10 5 2.866 × 10 5 4.603 × 10 5 1.420 × 10 5 2 . 092 × 10 5 6 . 282 × 10 4
F18 2.641 × 10 3 3.372 × 10 3 2.461 × 10 3 2.185 × 10 3 + 2.676 × 10 6 1.438 × 10 6 + 7.477 × 10 5 2.264 × 10 5 +
F19 1 . 210 × 10 3 2 . 854 × 10 2 2.735 × 10 3 6.335 × 10 2 + 3.619 × 10 3 4.043 × 10 2 + 3.743 × 10 3 6.343 × 10 2 +
F20 3 . 951 × 10 2 2 . 902 × 10 1 5.660 × 10 2 6.790 × 10 1 + 1.590 × 10 3 2.503 × 10 2 + 1.971 × 10 3 2.052 × 10 2 +
F21 1.305 × 10 4 9.778 × 10 2 1.555 × 10 4 1.563 × 10 3 + 1.712 × 10 4 1.577 × 10 3 + 1.724 × 10 4 1.229 × 10 3 +
F22 6 . 770 × 10 2 3 . 144 × 10 1 8.651 × 10 2 5.472 × 10 1 + 2.262 × 10 3 6.163 × 10 2 + 3.205 × 10 3 3.317 × 10 2 +
F23 9 . 631 × 10 2 2 . 115 × 10 1 1.187 × 10 3 6.989 × 10 1 + 2.456 × 10 3 7.656 × 10 2 + 4.002 × 10 3 4.750 × 10 2 +
F24 8.172 × 10 2 4.801 × 10 1 7.833 × 10 2 6.953 × 10 1 8.023 × 10 2 6.034 × 10 1 7 . 458 × 10 2 6 . 228 × 10 1
F25 3.713 × 10 3 5.352 × 10 2 7.041 × 10 3 1.373 × 10 3 + 2.257 × 10 4 5.565 × 10 3 + 2.836 × 10 4 2.398 × 10 3 +
F26 6 . 732 × 10 2 2 . 342 × 10 1 7.451 × 10 2 4.961 × 10 1 + 2.381 × 10 3 8.598 × 10 2 + 4.840 × 10 3 1.516 × 10 3 +
F27 5.827 × 10 2 3.470 × 10 1 5 . 668 × 10 2 3 . 454 × 10 1 6.242 × 10 2 4.049 × 10 1 + 5.705 × 10 2 3.150 × 10 1
F28 1 . 931 × 10 3 2 . 598 × 10 2 3.189 × 10 3 5.669 × 10 2 + 6.382 × 10 3 7.283 × 10 2 + 5.736 × 10 3 6.244 × 10 2 +
F29 9 . 005 × 10 3 4 . 115 × 10 3 1.754 × 10 4 1.304 × 10 4 + 1.233 × 10 7 3.963 × 10 6 + 3.239 × 10 6 9.437 × 10 5 +
w/t/l 20/1/8 24/1/4 21/2/6
Friedman
Rankings
2.5517 2.9655 6.0345 5.6897
GGSA HGSA GLPSO WFS
meanstd meanstd meanstd meanstd
F1 3.908 × 10 3 2.648 × 10 3 3 . 707 × 10 3 3 . 211 × 10 3 9.755 × 10 4 1.848 × 10 5 + 3.904 × 10 9 1.440 × 10 9 +
F2 2.911 × 10 5 1.258 × 10 4 + 2.744 × 10 5 1.552 × 10 4 + 1.492 × 10 5 4.428 × 10 4 1.118 × 10 5 1.208 × 10 4
F3 5.764 × 10 2 1.431 × 10 2 + 2.736 × 10 2 3.846 × 10 1 + 3.081 × 10 2 5.051 × 10 1 + 8.701 × 10 2 1.063 × 10 2 +
F4 6.212 × 10 2 2.684 × 10 1 + 7.287 × 10 2 3.137 × 10 1 + 3.946 × 10 2 6.658 × 10 1 + 5.664 × 10 2 8.519 × 10 1 +
F5 3.717 × 10 1 3.515 × 10 0 + 3.113 × 10 1 2.947 × 10 0 + 1 . 438 × 10 1 3 . 827 × 10 2 2.766 × 10 1 7.590 × 10 0 +
F6 1.685 × 10 2 1.155 × 10 1 1 . 518 × 10 2 8 . 209 × 10 0 7.417 × 10 2 8.550 × 10 1 + 1.191 × 10 3 1.388 × 10 2 +
F7 6.725 × 10 2 4.438 × 10 1 + 7.954 × 10 2 3.085 × 10 1 + 3.766 × 10 2 5.894 × 10 1 + 5.921 × 10 2 9.029 × 10 1 +
F8 7.016 × 10 3 9.191 × 10 2 + 2.081 × 10 3 7.172 × 10 2 + 8.940 × 10 3 3.517 × 10 3 + 1.137 × 10 4 4.462 × 10 3 +
F9 1.238 × 10 4 9.580 × 10 2 1.225 × 10 4 8.714 × 10 2 1 . 119 × 10 4 1 . 167 × 10 3 1.926 × 10 4 1.661 × 10 3 +
F10 1.630 × 10 4 2.509 × 10 3 + 4.394 × 10 3 1.405 × 10 3 + 3.231 × 10 4 1.353 × 10 4 + 4.568 × 10 3 7.797 × 10 2 +
F11 3.893 × 10 6 6.060 × 10 6 1 . 329 × 10 6 4 . 346 × 10 5 3.595 × 10 7 1.746 × 10 7 + 1.296 × 10 9 2.863 × 10 8 +
F12 1.364 × 10 4 2.461 × 10 3 + 3 . 031 × 10 3 2 . 063 × 10 3 2.420 × 10 4 1.928 × 10 4 + 7.821 × 10 6 4.666 × 10 6 +
F13 4.431 × 10 5 1.567 × 10 5 2.037 × 10 5 3.621 × 10 4 3.769 × 10 6 3.642 × 10 6 + 2.035 × 10 6 8.195 × 10 5 +
F14 2.292 × 10 3 6.814 × 10 2 + 8 . 601 × 10 2 6 . 547 × 10 2 5.793 × 10 3 4.997 × 10 3 + 1.915 × 10 6 1.674 × 10 6 +
F15 4.809 × 10 3 4.435 × 10 2 + 4.904 × 10 3 5.010 × 10 2 + 4.085 × 10 3 7.461 × 10 2 + 4.491 × 10 3 5.926 × 10 2 +
F16 3.093 × 10 3 4.370 × 10 2 + 3.203 × 10 3 3.943 × 10 2 + 3.391 × 10 3 4.840 × 10 2 + 2.907 × 10 3 4.913 × 10 2 +
F17 3.684 × 10 5 7.676 × 10 4 2.813 × 10 5 5.077 × 10 4 4.552 × 10 6 4.224 × 10 6 + 2.467 × 10 6 1.219 × 10 6 +
F18 1.813 × 10 3 1.230 × 10 3 1 . 226 × 10 3 9 . 443 × 10 2 5.520 × 10 3 5.474 × 10 3 + 6.476 × 10 6 3.870 × 10 6 +
F19 3.811 × 10 3 4.202 × 10 2 + 3.891 × 10 3 3.827 × 10 2 + 2.877 × 10 3 5.376 × 10 2 + 2.899 × 10 3 4.790 × 10 2 +
F20 8.780 × 10 2 5.272 × 10 1 + 9.193 × 10 2 4.243 × 10 1 + 6.539 × 10 2 5.677 × 10 1 + 8.649 × 10 2 9.716 × 10 1 +
F21 1.678 × 10 4 7.995 × 10 2 + 1.694 × 10 4 8.212 × 10 2 + 1 . 252 × 10 4 1 . 109 × 10 3 2.067 × 10 4 1.341 × 10 3 +
F22 1.854 × 10 3 2.519 × 10 2 + 3.091 × 10 3 2.906 × 10 2 + 8.129 × 10 2 4.525 × 10 1 + 1.500 × 10 3 1.437 × 10 2 +
F23 1.580 × 10 3 1.199 × 10 2 + 1.264 × 10 3 7.487 × 10 1 + 1.375 × 10 3 6.757 × 10 1 + 2.000 × 10 3 1.707 × 10 2 +
F24 1.293 × 10 3 7.217 × 10 1 + 8.390 × 10 2 5.914 × 10 1 + 8.454 × 10 2 5.749 × 10 1 + 1.672 × 10 3 1.093 × 10 2 +
F25 1.131 × 10 3 2.205 × 10 3 5 . 524 × 10 2 1 . 803 × 10 3 8.555 × 10 3 5.981 × 10 2 + 1.096 × 10 4 1.097 × 10 3 +
F26 1.562 × 10 3 1.559 × 10 2 + 1.453 × 10 3 2.107 × 10 2 + 8.547 × 10 2 5.908 × 10 1 + 1.421 × 10 3 1.312 × 10 2 +
F27 9.826 × 10 2 1.003 × 10 2 + 6.247 × 10 2 2.500 × 10 1 + 6.658 × 10 2 4.056 × 10 1 + 2.151 × 10 3 3.566 × 10 2 +
F28 4.809 × 10 3 3.773 × 10 2 + 4.462 × 10 3 3.878 × 10 2 + 3.396 × 10 3 5.700 × 10 2 + 5.322 × 10 3 6.490 × 10 2 +
F29 1.487 × 10 5 1.095 × 10 5 + 9.267 × 10 3 2.152 × 10 3 1.318 × 10 5 9.161 × 10 4 + 2.988 × 10 8 7.818 × 10 7 +
w/t/l 21/3/5 18/6/5 25/0/4 28/0/1
Friedman
Rankings
4.5862 3.7586 4.3448 6.069
Figure 5, Figure 6 and Figure 7 present boxplots illustrating the distribution of optimal solutions for the algorithms on the CEC2017 benchmark with 30, 50, and 100 dimensions. The boxplots include simple multimodal functions F4 and F7, hybrid functions F16 and F19, and composition functions F22 and F23. It is observed that the BCGEO consistently achieves the lowest and shortest graph position, indicating superior competitiveness and stability. Conversely, the original EO does not always show an advantage, particularly at higher dimensions. Specifically, when the dimension reaches 100, the EO’s median or minimum values are sometimes higher than those of its competitors. For instance, on F7, the EO’s median is higher than GLPSO, and on F16, it is higher than both GLPSO and WFS. On F22, both the median and minimum values of the EO are higher than GLPSO. The BCGEO, however, consistently maintains the lowest position and the shortest box shape, indicating that the improvement scheme enhances robustness, particularly in handling high-dimensional problems.
Figure 8, Figure 9 and Figure 10 show the convergence processes of the BCGEO and its opponents on 30, 50, and 100 dimensions. In the figures, the horizontal axis represents the number of function evaluations, and the vertical axis represents the average optimization error of 51 experiments. It can be observed that most of the BCGEO’s adversaries converge to a standstill after spending about one-sixth of the number of evaluations. WFS is a special case, which always maintains a converging trend, but is so slow that it is still unable to find a satisfactory solution after spending the full number of evaluations. On the other hand, for most problems, during an extended period of convergence, the solutions found by the BCGEO are not as good as those found by other algorithms, and may even exhibit a tendency to stagnate early on. However, in the later stages of the search, the BCGEO often exhibits a sudden acceleration in convergence, resulting in better solutions. This indicates that the improved equilibrium pool scheme indeed brings higher population diversity to the BCGEO, aiding in the coverage of the space during high-dimensional optimization. This increases the likelihood of the algorithm escaping the suboptimal region and entering better regions. On the other hand, the steepness of the convergence curve in the final stage suggests that the dynamic resource allocation strategy enhances the efficiency of exploitation, allowing the BCGEO to quickly find the optimal solution within a new region after entering it.

4.3. Real-World Optimization Test

4.3.1. Dynamic Economic Dispatch

The economic dispatch problem, as a core optimization problem in power system operation, aims to minimize the total generation cost by rationally allocating the output of each generating unit while satisfying the constraints of system operation [84,85]. It is mainly divided into two forms: static economic dispatch (SED) and dynamic economic dispatch (DED).
SED is mainly concerned with how to allocate the output of each generator to minimize the total generation cost of the system at a certain moment while satisfying the system load demand and various operational constraints [1,86]. It is a one-time decision-making process based on the current system state, without considering changes in the time series.The model of SED usually includes two major parts, the objective function and constraints. The objective function is mainly the generation cost function, and the constraints include the power balance constraints, generator output power constraints, ramp rate limits, etc. On the basis of static economic dispatch, DED further considers the load changes and generation cost changes in the time series, aiming to optimize the power allocation of generating units in multiple time periods to minimize the system operation cost in the whole dispatch cycle. It usually considers the scheduling plan for each hour in a 24 h period, thus making it 24 times more dimensional than the SED problem [87]. The cost function for the DED problem used in this experiment can be expressed as follows:
M i n i m i z e : F = t = 1 T i = 1 N g R i ( E i , t ) i = 1 , 2 , 3 , , N g t = 1 , 2 , 3 , , T
where
R i ( E i , t ) = a i + b i E i , t + c i E i , t 2 + g i s i n ( h i ( E i l E i , t ) )
Equation (18) expresses the objective function of this problem, where t represents the current time period, and T refers to the total number of time period. N g denotes the total number of generators in the genset. Accordingly, E i , t describes the power output of generator i in the t-th time period. In Equation (19), R ( E ) expresses the cost function, where a i , b i , c i , g i , and h i represent the cost coefficients, respectively, and E i l denotes the lower bound for power output of generator i.
Power balance constraints are expressed as follows:
i = 1 N g E i , t = E t l o a d + E t l o s s
where E t l o a d and E t l o s s are the total load demand and total transmission loss at time t. E t l o s s can be obtained through the loss coefficient B, shown as follows:
E t l o s s = i = 1 N g j = 1 N g E i , t B i , j E j , t j = 1 , 2 , 3 , N g
Generator constraints are expressed as follows:
E i l E i , t E i u
where E i l and E i u are lower and upper bounds of the power that generator i can output.
Ramp rate limits can be expressed as follows:
E i , t E i , t 1 L i u
E i , t 1 E i , t L i l
The ramp rate limit refers to the maximum rate at which a generator’s power output can change in a time period. This limit ensures that the generator does not damage equipment or affect the stability of the grid due to a too rapid change during startup, shutdown, or power regulation. It consists of two types: up ramp rate limits and down ramp rate limits, which are denoted by L u and L l in Equations (23) and (24).
In order to evaluate the fitness value of each particle in these algorithms, the following equations are used as the evaluation function in this experiment:
W = t = 1 T i = 1 N g R i ( E i , t ) + α ( t = 1 T i = 1 N g E i , t E t l o a d ) 2 + β ( t = 1 T i = 1 N g E i , t E m ) 2
E m = E i , t 1 L i l , E i , t < E i , t 1 L i l E i , t 1 + L i u , E i , t > E i , t 1 + L i u E i , t , o t h e r w i s e
The last two terms of Equation (25) are penalty terms, which are used to assign a higher cost to the individuals that do not meet the constraints, instead of rejecting them directly. Alpha and beta are the parameters used to regulate the penalty.
In this DED experiment, there are nine generating units in the genset with a dimension of 216 ( D = 9 × 24 ), the termination condition of the algorithm is D 10 4 function evaluations, and the maximum and minimum output power of each generating unit is shown in Table 7. The experimental results, as shown in Table 8, indicate that the BCGEO can achieve smaller fitness values. Figure 11 presents the convergence and boxplot analysis for the DED problem, where the convergence plot demonstrates that the BCGEO maintains the lowest convergence curve by the end of the search, and the boxplot shows that the BCGEO is not only the lowest in position but also has the shortest shape. These results suggest that the BCGEO outperforms its competitors in finding optimal solutions and exhibits a high degree of stability. It can be inferred that the BCGEO holds promising potential for addressing the DED challenge in power systems, and further theoretical exploration could provide valuable insights for the field of power systems optimization.

4.3.2. Cassini 2: Spacecraft Trajectory Optimization

The spacecraft trajectory optimization problem is a highly specialized and complex problem for optimizing the flight path of a spacecraft from Earth to a target planet [88]. The Cassini 2 problem is a specific instance of optimizing the trajectory from Earth to Saturn, which belongs to the multiple gravity assist deep space maneuver (MGADSM) type. MGADSM is a technology that uses the gravity of planets or other celestial bodies to adjust the orbit of a spacecraft. This approach can significantly reduce the amount of propellant required by a spacecraft, thereby reducing mission cost. During a deep-space exploration mission, a spacecraft flies over one or more planets on a predetermined trajectory, utilizing the gravitational pull of those planets to change its speed and direction. Each time it flies by a planet, the spacecraft gains additional kinetic energy, known as a multi-gravity assist. Through a precisely engineered gravitational boost, spacecraft are capable of complex interplanetary travel. The MGADSM enhances the efficiency of spaceflight and extends the reach of missions to remote celestial bodies, establishing it as an essential technology in contemporary deep-space exploration endeavors.
The goal of Cassini 2 is to design a trajectory that starts from Earth, passes through Venus–Venus–Earth–Jupiter–Saturn, and ends up in an elliptical orbit around Saturn (as depicted in Figure 12). Each trajectory segment is defined by various variables, such as departure time, initial velocity, swing conditions, etc. The objective function is to minimize the total velocity change, including the initial velocity, the velocity change in each trajectory segment, and the final velocity change upon entering Saturn’s orbit. This problem comprises 22 variables, each with specific upper and lower bounds, and is characterized by numerous local optima, posing a considerable challenge for global solution optimization [89].
Table 9 shows the experimental results for the STO problem, and it can be seen that the BCGEO can search for smaller values compared to its rivals. The convergence graph in Figure 13 illustrates that the EO’s convergence nearly stagnates from around the 36,000th evaluation, while the BCGEO maintains a more distinct convergence trend. Furthermore, the boxplot indicates that the BCGEO is positioned lower, which signifies superior search performance. These findings suggest that the BCGEO has promising application potential in the field of deep-space exploration.

5. Discussion

5.1. Parameter Analysis of γ

In the BCGEO, the discard of low-potential particles is accompanied by the generation of an equivalent number of particles near the equilibrium pool. This process, similarly to local search, utilizes a shrinking parameter γ , which allows the radius of the search to decrease iteratively, thereby improving the precision of local exploitation. The analysis of this parameter was conducted using the CEC2017 benchmark, with test values set at 0.9, 0.925, 0.95, 0.975, 0.985, 0.988, and 0.999. Among these, 0.988 was identified as the optimal value in prior research [90,91], and 0.985 is a fine-tuned value based on it. In Table 10, the Friedman ranking results indicate that the best performance occurs at γ = 0.985 , but the Wilcoxon test p-values show that, except for γ = 0.9 , there is no significant difference between γ = 0.985 and the other tested values. Therefore, the BCGEO’s performance is not very sensitive to values of γ between 0.9 and 0.999. Based on the Friedman ranking results, we select γ = 0.985 .

5.2. Population Diversity Analysis

Population diversity refers to the variability among individuals in the population during the iteration of the algorithm [92]. Healthy population diversity ensures that the algorithm is sufficiently exploratory in searching the solution space, thus preventing premature convergence to local optima [93]. In the early stages of the algorithm, higher diversity helps to quickly explore different regions of the solution space, increasing the likelihood of finding a global optimum. However, as the algorithm proceeds, if the diversity is too low, the algorithm may fall into a local optimum, causing the search to stagnate. Therefore, maintaining proper population diversity is critical to the success of the algorithm. In addition, population diversity is also related to the convergence speed of the algorithm. Excessive diversity may cause the algorithm to converge at a slower rate because there is too much variability among individuals to form an effective exchange of information. Conversely, insufficient diversity may cause the algorithm to converge quickly, but it may only converge to a local optimum. Therefore, algorithm designers need to carefully design the population update strategy to achieve a balance between diversity and convergence speed.
Comparisons of population diversity can help analyze the effectiveness of the scheme proposed in the BCGEO. This analysis builds on the use of the CEC 2017 benchmark function with 30 dimensions. The equation for calculating population diversity V is given below.
V = 1 N · i = 1 N ( x i x ¯ ) 2
where x denotes the individual, which is the particle in the BCGEO, and x ¯ denotes the mean value of the individuals.
x ¯ = 1 N · i = 1 N x i
Figure 14 illustrates the population diversity curves for the BCGEO versus the EO on partial functions. It is evident that, at the beginning of the search, the population diversity of both the BCGEO and EO algorithms is comparable. However, as the algorithm progresses, the BCGEO’s diversity curve remains consistently higher than the EO’s, indicating that the BCGEO’s scheme for maintaining diversity is effective. This sustained high diversity helps the algorithm avoid premature sticking to local optima throughout the search process. The difference in diversity suggests that the BCGEO has a stronger ability to maintain broad coverage of the solution space, thus preserving a high level of exploration. Towards the end of the algorithm’s convergence, the BCGEO exhibits a rapid decrease in diversity, aligning with the EO’s level. This shift may signify that the improvements bolstered the algorithm’s local search ability in later stages, enabling it to focus more intensively on refining the optimal solutions identified. In summary, the BCGEO’s improvement schemes facilitate extensive exploration in the early and middle stages of the algorithm, while also enhancing the fine-tuning of optimal solutions in the final stage, showcasing its capability to balance global exploration with local exploitation.

6. Conclusions

In this paper, we introduce a novel algorithm, the BCGEO, which integrates the BCG Matrix decision model to achieve a more effective balance between exploration and exploitation while preserving population diversity. A suite of experiments confirms that the BCGEO outperforms its counterparts in numerical optimization and demonstrates significant potential in addressing real-world optimization needs, including power system optimization. This research offers fresh insights into the theoretical framework of MHAs and offers a promising approach to addressing issues in power systems and related fields.
Despite its merits, the BCGEO has certain limitations. For instance, the parameter determining the number of discarded individuals is set empirically, which presents an opportunity for future research. Future works will concentrate on enhancing the BCG mechanism, aiming to make algorithm parameters adaptively adjustable based on feedback received during the search process. Furthermore, we aim to extend the application of the BCG mechanism to a broader spectrum of MHAs and explore its potential in a wider array of optimization problems within the power systems domain.

Author Contributions

Conceptualization, L.Y. and Z.X.; Resources, Z.X.; Formal analysis, F.Y.; Methodology, L.Y. and Y.L.; Validation, Y.L.; Investigation, L.Y. and F.Y.; Data curation, Z.X.; Writing—original draft, L.Y.; Writing—review and editing, L.Y. and G.T.; Visualization, G.T.; Supervision, L.Y. and Z.X.; Project administration, Z.X. All authors have read and agreed to the published version of the manuscript.

Funding

This research received no external funding.

Data Availability Statement

Data are contained within the article.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Zou, D.; Gong, D. Differential Evolution Based on Migrating Variables for the Combined Heat and Power Dynamic Economic Dispatch. Energy 2022, 238, 121664. [Google Scholar] [CrossRef]
  2. Moustafa, G.; Smaili, I.H.; Almalawi, D.R.; Ginidi, A.R.; Shaheen, A.M.; Elshahed, M.; Mansour, H.S.E. Dwarf Mongoose Optimizer for Optimal Modeling of Solar PV Systems and Parameter Extraction. Electronics 2023, 12, 4990. [Google Scholar] [CrossRef]
  3. Yang, H.; Gao, S.; Lei, Z.; Li, J.; Yu, Y.; Wang, Y. An Improved Spherical Evolution with Enhanced Exploration Capabilities to Address Wind Farm Layout Optimization Problem. Eng. Appl. Artif. Intell. 2023, 123, 106198. [Google Scholar] [CrossRef]
  4. Nssibi, M.; Manita, G.; Korbaa, O. Advances in Nature-Inspired Metaheuristic Optimization for Feature Selection Problem: A Comprehensive Survey. Comput. Sci. Rev. 2023, 49, 100559. [Google Scholar] [CrossRef]
  5. Gogna, A.; Tayal, A. Metaheuristics: Review and Application. J. Exp. Theor. Artif. Intell. 2013, 25, 503–526. [Google Scholar] [CrossRef]
  6. Eiben, A.E.; Smith, J. From Evolutionary Computation to the Evolution of Things. Nature 2015, 521, 476–482. [Google Scholar] [CrossRef]
  7. Abdel-Basset, M.; Abdel-Fatah, L.; Sangaiah, A.K. Metaheuristic Algorithms: A Comprehensive Review. In Computational Intelligence for Multimedia Big Data on the Cloud with Engineering Applications; Elsevier: Amsterdam, The Netherlands, 2018; pp. 185–231. [Google Scholar] [CrossRef]
  8. Xu, Z.; Yang, H.; Li, J.; Zhang, X.; Lu, B.; Gao, S. Comparative Study on Single and Multiple Chaotic Maps Incorporated Grey Wolf Optimization Algorithms. IEEE Access 2021, 9, 77416–77437. [Google Scholar] [CrossRef]
  9. Holland, J.H. Genetic Algorithms. Sci. Am. 1992, 267, 66–73. [Google Scholar] [CrossRef]
  10. Lambora, A.; Gupta, K.; Chopra, K. Genetic Algorithm—A Literature Review. In Proceedings of the 2019 International Conference on Machine Learning, Big Data, Cloud and Parallel Computing (COMITCon), Faridabad, India, 14–16 February 2019; pp. 380–384. [Google Scholar] [CrossRef]
  11. Garud, K.S.; Jayaraj, S.; Lee, M.Y. A Review on Modeling of Solar Photovoltaic Systems Using Artificial Neural Networks, Fuzzy Logic, Genetic Algorithm and Hybrid Models. Int. J. Energy Res. 2021, 45, 6–35. [Google Scholar] [CrossRef]
  12. Xu, Z.; Gao, S.; Yang, H.; Lei, Z. SCJADE: Yet Another State-of-the-Art Differential Evolution Algorithm. IEEJ Trans. Electr. Electron. Eng. 2021, 16, 644–646. [Google Scholar] [CrossRef]
  13. Gao, S.; Wang, K.; Tao, S.; Jin, T.; Dai, H.; Cheng, J. A State-of-the-Art Differential Evolution Algorithm for Parameter Estimation of Solar Photovoltaic Models. Energy Convers. Manag. 2021, 230, 113784. [Google Scholar] [CrossRef]
  14. Zhang, Z.; Zhang, Z.; Lei, Z.; Xiong, R.; Cheng, J.; Gao, S. Surrogate-Assisted Differential Evolution for Wave Energy Converters Optimization. In IEEE Transactions on Emerging Topics in Computational Intelligence; IEEE: Piscataway, NJ, USA, 2024; pp. 1–10. [Google Scholar] [CrossRef]
  15. Jahandideh-Tehrani, M.; Bozorg-Haddad, O.; Loáiciga, H.A. Application of Particle Swarm Optimization to Water Management: An Introduction and Overview. Environ. Monit. Assess. 2020, 192, 281. [Google Scholar] [CrossRef]
  16. Shami, T.M.; El-Saleh, A.A.; Alswaitti, M.; Al-Tashi, Q.; Summakieh, M.A.; Mirjalili, S. Particle Swarm Optimization: A Comprehensive Survey. IEEE Access 2022, 10, 10031–10061. [Google Scholar] [CrossRef]
  17. Niu, S.; Nie, Z.; Liu, J.; Chu, M. An Application Study of Improved Iris Image Localization Based on an Evolutionary Algorithm. Electronics 2023, 12. [Google Scholar] [CrossRef]
  18. Dorigo, M.; Blum, C. Ant Colony Optimization Theory: A Survey. Theor. Comput. Sci. 2005, 344, 243–278. [Google Scholar] [CrossRef]
  19. Dorigo, M.; Birattari, M.; Stutzle, T. Ant Colony Optimization. IEEE Comput. Intell. Mag. 2006, 1, 28–39. [Google Scholar] [CrossRef]
  20. Martens, D.; De Backer, M.; Haesen, R.; Vanthienen, J.; Snoeck, M.; Baesens, B. Classification With Ant Colony Optimization. IEEE Trans. Evol. Comput. 2007, 11, 651–665. [Google Scholar] [CrossRef]
  21. Lnenicka, M.; Komarkova, J. Developing a Government Enterprise Architecture Framework to Support the Requirements of Big and Open Linked Data with the Use of Cloud Computing. Int. J. Inf. Manag. 2019, 46, 124–141. [Google Scholar] [CrossRef]
  22. Xu, Z.; Li, X.; Meng, X.; Liu, Y. A Distributed Brain Storm Optimization for Numerical Optimization and Graph Planarization. IEEE Access 2019, 7, 39770–39781. [Google Scholar] [CrossRef]
  23. Cheng, S.; Wang, X.; Zhang, M.; Lei, X.; Lu, H.; Shi, Y. Solving Multimodal Optimization Problems by a Knowledge-Driven Brain Storm Optimization Algorithm. Appl. Soft Comput. 2024, 150, 111105. [Google Scholar] [CrossRef]
  24. Rashedi, E.; Nezamabadi-pour, H.; Saryazdi, S. GSA: A Gravitational Search Algorithm. Inf. Sci. 2009, 179, 2232–2248. [Google Scholar] [CrossRef]
  25. Rashedi, E.; Rashedi, E.; Nezamabadi-pour, H. A Comprehensive Survey on Gravitational Search Algorithm. Swarm Evol. Comput. 2018, 41, 141–158. [Google Scholar] [CrossRef]
  26. Wang, Y.; Gao, S.; Zhou, M.; Yu, Y. A Multi-Layered Gravitational Search Algorithm for Function Optimization and Real-World Problems. IEEE/CAA J. Autom. Sin. 2021, 8, 94–109. [Google Scholar] [CrossRef]
  27. Sun, Y.; Xue, B.; Zhang, M.; Yen, G.G.; Lv, J. Automatically Designing CNN Architectures Using the Genetic Algorithm for Image Classification. IEEE Trans. Cybern. 2020, 50, 3840–3854. [Google Scholar] [CrossRef] [PubMed]
  28. Karnan, M.; Logheshwari, T. Improved Implementation of Brain MRI Image Segmentation Using Ant Colony System. In Proceedings of the 2010 IEEE International Conference on Computational Intelligence and Computing Research, Coimbatore, India, 28–29 December 2010; pp. 1–4. [Google Scholar] [CrossRef]
  29. Mahalakshmi, S.; Velmurugan, T. Detection of Brain Tumor by Particle Swarm Optimization Using Image Segmentation. Indian J. Sci. Technol. 2015, 8. [Google Scholar] [CrossRef]
  30. Vijay, V.; Kavitha, A.; Rebecca, S.R. Automated Brain Tumor Segmentation and Detection in MRI Using Enhanced Darwinian Particle Swarm Optimization(EDPSO). Procedia Comput. Sci. 2016, 92, 475–480. [Google Scholar] [CrossRef]
  31. Verma, H.; Verma, D.; Tiwari, P.K. A Population Based Hybrid FCM-PSO Algorithm for Clustering Analysis and Segmentation of Brain Image. Expert Syst. Appl. 2021, 167, 114121. [Google Scholar] [CrossRef]
  32. Miikkulainen, R.; Francon, O.; Meyerson, E.; Qiu, X.; Sargent, D.; Canzani, E.; Hodjat, B. From Prediction to Prescription: Evolutionary Optimization of Nonpharmaceutical Interventions in the COVID-19 Pandemic. IEEE Trans. Evol. Comput. 2021, 25, 386–401. [Google Scholar] [CrossRef] [PubMed]
  33. Faramarzi, A.; Heidarinejad, M.; Stephens, B.; Mirjalili, S. Equilibrium Optimizer: A Novel Optimization Algorithm. Knowl.-Based Syst. 2020, 191, 105190. [Google Scholar] [CrossRef]
  34. Warn, A.; Brew, J. Mass balance. Water Res. 1980, 14, 1427–1434. [Google Scholar] [CrossRef]
  35. Fan, Q.; Huang, H.; Yang, K.; Zhang, S.; Yao, L.; Xiong, Q. A Modified Equilibrium Optimizer Using Opposition-Based Learning and Novel Update Rules. Expert Syst. Appl. 2021, 170, 114575. [Google Scholar] [CrossRef]
  36. Houssein, E.H.; Çelik, E.; Mahdy, M.A.; Ghoniem, R.M. Self-Adaptive Equilibrium Optimizer for Solving Global, Combinatorial, Engineering, and Multi-Objective Problems. Expert Syst. Appl. 2022, 195, 116552. [Google Scholar] [CrossRef]
  37. Rabehi, A.; Nail, B.; Helal, H.; Douara, A.; Ziane, A.; Amrani, M.; Akkal, B.; Benamara, Z. Optimal Estimation of Schottky Diode Parameters Using a Novel Optimization Algorithm: Equilibrium Optimizer. Superlattices Microstruct 2020, 146, 106665. [Google Scholar] [CrossRef]
  38. Ndi, F.E.; Perabi, S.N.; Ndjakomo, S.E.; Ondoua Abessolo, G.; Mengounou Mengata, G. Estimation of Single-Diode and Two Diode Solar Cell Parameters by Equilibrium Optimizer Method. Energy Rep. 2021, 7, 4761–4768. [Google Scholar] [CrossRef]
  39. Abdel-Basset, M.; Mohamed, R.; Mirjalili, S.; Chakrabortty, R.K.; Ryan, M.J. Solar Photovoltaic Parameter Estimation Using an Improved Equilibrium Optimizer. Sol. Energy 2020, 209, 694–708. [Google Scholar] [CrossRef]
  40. Wang, J.; Yang, B.; Li, D.; Zeng, C.; Chen, Y.; Guo, Z.; Zhang, X.; Tan, T.; Shu, H.; Yu, T. Photovoltaic Cell Parameter Estimation Based on Improved Equilibrium Optimizer Algorithm. Energy Convers. Manag. 2021, 236, 114051. [Google Scholar] [CrossRef]
  41. Nguyen, T.T.; Nguyen, T.T.; Duong, M.Q. An Improved Equilibrium Optimizer for Optimal Placement of Photovoltaic Systems in Radial Distribution Power Networks. Neural Comput. Appl. 2022, 34, 6119–6148. [Google Scholar] [CrossRef]
  42. Gui, P.; He, F.; Ling, B.W.K.; Zhang, D. United Equilibrium Optimizer for Solving Multimodal Image Registration. Knowl.-Based Syst. 2021, 233, 107552. [Google Scholar] [CrossRef]
  43. Dinkar, S.K.; Deep, K.; Mirjalili, S.; Thapliyal, S. Opposition-Based Laplacian Equilibrium Optimizer with Application in Image Segmentation Using Multilevel Thresholding. Expert Syst. Appl. 2021, 174, 114766. [Google Scholar] [CrossRef]
  44. Abdel-Basset, M.; Chang, V.; Mohamed, R. A Novel Equilibrium Optimization Algorithm for Multi-Thresholding Image Segmentation Problems. Neural Comput. Appl. 2021, 33, 10685–10718. [Google Scholar] [CrossRef]
  45. Doerr, B.; Neumann, F. (Eds.) Theory of Evolutionary Computation: Recent Developments in Discrete Optimization; Natural Computing Series; Springer International Publishing: Cham, Switzerland, 2020. [Google Scholar] [CrossRef]
  46. Salleh, M.N.M.; Hussain, K.; Cheng, S.; Shi, Y.; Muhammad, A.; Ullah, G.; Naseem, R. Exploration and Exploitation Measurement in Swarm-Based Metaheuristic Algorithms: An Empirical Analysis. In Recent Advances on Soft Computing and Data Mining; Ghazali, R., Deris, M.M., Nawi, N.M., Abawajy, J.H., Eds.; Springer International Publishing: Cham, Switzerland, 2018; Volume 700, pp. 24–32. [Google Scholar] [CrossRef]
  47. Chen, S.; Bolufe-Rohler, A.; Montgomery, J.; Hendtlass, T. An Analysis on the Effect of Selection on Exploration in Particle Swarm Optimization and Differential Evolution. In Proceedings of the 2019 IEEE Congress on Evolutionary Computation (CEC), Wellington, New Zealand, 10–13 June 2019; pp. 3037–3044. [Google Scholar] [CrossRef]
  48. Sadollah, A.; Sayyaadi, H.; Yoo, D.G.; Lee, H.M.; Kim, J.H. Mine Blast Harmony Search: A New Hybrid Optimization Method for Improving Exploration and Exploitation Capabilities. Appl. Soft Comput. 2018, 68, 548–564. [Google Scholar] [CrossRef]
  49. Jerebic, J.; Mernik, M.; Liu, S.H.; Ravber, M.; Baketarić, M.; Mernik, L.; Črepinšek, M. A Novel Direct Measure of Exploration and Exploitation Based on Attraction Basins. Expert Syst. Appl. 2021, 167, 114353. [Google Scholar] [CrossRef]
  50. Crepinsek, M.; Mernik, M.; Liu, S.H. Analysis of Exploration and Exploitation in Evolutionary Algorithms by Ancestry Trees. Int. J. Innov. Comput. Appl. 2011, 3, 11. [Google Scholar] [CrossRef]
  51. Morales-Castañeda, B.; Zaldívar, D.; Cuevas, E.; Fausto, F.; Rodríguez, A. A Better Balance in Metaheuristic Algorithms: Does It Exist? Swarm Evol. Comput. 2020, 54, 100671. [Google Scholar] [CrossRef]
  52. Črepinšek, M.; Liu, S.H.; Mernik, M. Exploration and Exploitation in Evolutionary Algorithms: A Survey. ACM Comput. Surv. 2013, 45, 1–33. [Google Scholar] [CrossRef]
  53. Yang, M.; Li, C.; Cai, Z.; Guan, J. Differential Evolution With Auto-Enhanced Population Diversity. IEEE Trans. Cybern. 2015, 45, 302–315. [Google Scholar] [CrossRef]
  54. Cheng, S.; Shi, Y.; Qin, Q.; Zhang, Q.; Bai, R. Population Diversity Maintenance In Brain Storm Optimization Algorithm. J. Artif. Intell. Soft Comput. Res. 2014, 4, 83–97. [Google Scholar] [CrossRef]
  55. Sudholt, D. The Benefits of Population Diversity in Evolutionary Algorithms: A Survey of Rigorous Runtime Analyses. In Theory of Evolutionary Computation; Doerr, B., Neumann, F., Eds.; Springer International Publishing: Cham, Switzerland, 2020; pp. 359–404. [Google Scholar] [CrossRef]
  56. Blackwell, T.M. Particle Swarms and Population Diversity. Soft Comput. 2005, 9, 793–802. [Google Scholar] [CrossRef]
  57. Hambrick, D.C.; MacMILLAN, I.C.; Day, D.L. Strategic Attributes and Performance in the BCG Matrix—A PIMS-Based Analysis of Industrial Product Businesses. Acad. Manag. J. 1982, 25, 510–531. [Google Scholar] [CrossRef]
  58. Hersen, A.; Silva, J.C.G.L.D.; Timofeiczyk Junior, R. A Critical Approach to the Use of the Bcg Matrix: Portfolio Analysis of Brazilian Pulp Marketed in the International Market. Rev. Árvore 2018, 42, e420308. [Google Scholar] [CrossRef]
  59. Chiu, C.C.; Lin, K.S. Rule-Based BCG Matrix for Product Portfolio Analysis. In Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing; Lee, R., Ed.; Springer International Publishing: Cham, Switzerland, 2020; Volume 850, pp. 17–32. [Google Scholar] [CrossRef]
  60. Houssein, E.H.; Dirar, M.; Abualigah, L.; Mohamed, W.M. An Efficient Equilibrium Optimizer with Support Vector Regression for Stock Market Prediction. Neural Comput. Appl. 2022, 34, 3165–3200. [Google Scholar] [CrossRef]
  61. Liu, J.; Li, W.; Li, Y. LWMEO: An Efficient Equilibrium Optimizer for Complex Functions and Engineering Design Problems. Expert Syst. Appl. 2022, 198, 116828. [Google Scholar] [CrossRef]
  62. Minocha, S.; Singh, B. A Novel Equilibrium Optimizer Based on Levy Flight and Iterative Cosine Operator for Engineering Optimization Problems. Expert Syst. 2022, 39, e12843. [Google Scholar] [CrossRef]
  63. Yang, L.; Li, J.; Xiong, R.; Todo, Y.; Gao, S. Adaptive Chaotic Equilibrium Optimiser. Int. J. Bio-Inspired Comput. 2022, 19, 147–157. [Google Scholar] [CrossRef]
  64. Yang, L.; Xu, Z.; Liu, Y.; Tian, G. An Improved Equilibrium Optimizer with a Decreasing Equilibrium Pool. Symmetry 2022, 14, 1227. [Google Scholar] [CrossRef]
  65. Mutandwa, E.; Kanuma, N.T.; Rusatira, E.; Mugenzi, P.; Govere, I.; Foti, R. Analysis of Coffee Export Marketing in Rwanda: Application of the Boston Consulting Group Matrix. Afr. J. Bus. Manag. 2009, 3, 210. [Google Scholar]
  66. Myllylä, Y.; Kaivo-oja, J. Integrating Delphi Methodology to Some Classical Concepts of the Boston Consulting Group Framework: Arctic Maritime Technology BCG Delphi Foresight—A Pilot Study from Finland. Eur. J. Futur. Res. 2015, 3, 2. [Google Scholar] [CrossRef]
  67. Lukovac, V.; Pamučar, D.; Popović, M.; Đorović, B. Portfolio Model for Analyzing Human Resources: An Approach Based on Neuro-Fuzzy Modeling and the Simulated Annealing Algorithm. Expert Syst. Appl. 2017, 90, 318–331. [Google Scholar] [CrossRef]
  68. Mathieu, R.; Gibson, J. A Methodology for Large-Scale R&D Planning Based on Cluster Analysis. IEEE Trans. Eng. Manag. 1993, 40, 283–292. [Google Scholar] [CrossRef]
  69. Cooper, R.G.; Edgett, S.J.; Kleinschmidt, E.J. New Product Portfolio Management: Practices and Performance. J. Prod. Innov. Manag. Int. Publ. Prod. Dev. Manag. Assoc. 1999, 16, 333–351. [Google Scholar] [CrossRef]
  70. Yang, X.; Li, W.; Zhang, P.; Chen, H.; Lai, M.; Zhao, S. The Dynamics and Driving Mechanisms of Rural Revitalization in Western China. Agriculture 2023, 13, 1448. [Google Scholar] [CrossRef]
  71. Lei, Z.; Gao, S.; Zhang, Z.; Yang, H.; Li, H. A Chaotic Local Search-Based Particle Swarm Optimizer for Large-Scale Complex Wind Farm Layout Optimization. IEEE/CAA J. Autom. Sin. 2023, 10, 1168–1180. [Google Scholar] [CrossRef]
  72. Awad, N.H.; Ali, M.Z.; Suganthan, P.N.; Liang, J.J.; Qu, B.Y. Problem Definitions and Evaluation Criteria for the CEC 2017 Special Session and Competition on Single Objective Real-Parameter Numerical Optimization; Technical Report; Nanyang Technological University: Singapore, 2016. [Google Scholar]
  73. Das, S.; Suganthan, P.N. Problem Definitions and Evaluation Criteria for CEC 2011 Competition on Testing Evolutionary Algorithms on Real World Optimization Problems; Technical Report; Jadavpur University; Nanyang Technological University: Kolkata, India, 2010; pp. 341–359. [Google Scholar]
  74. Carrasco, J.; García, S.; Rueda, M.; Das, S.; Herrera, F. Recent Trends in the Use of Statistical Tests for Comparing Swarm and Evolutionary Computing Algorithms: Practical Guidelines and a Critical Review. Swarm Evol. Comput. 2020, 54, 100665. [Google Scholar] [CrossRef]
  75. Hammouche, K.; Diaf, M.; Siarry, P. A Comparative Study of Various Meta-Heuristic Techniques Applied to the Multilevel Thresholding Problem. Eng. Appl. Artif. Intell. 2010, 23, 676–688. [Google Scholar] [CrossRef]
  76. Zhao, S.; Wang, P.; Heidari, A.A.; Chen, H.; Turabieh, H.; Mafarja, M.; Li, C. Multilevel Threshold Image Segmentation with Diffusion Association Slime Mould Algorithm and Renyi’s Entropy for Chronic Obstructive Pulmonary Disease. Comput. Biol. Med. 2021, 134, 104427. [Google Scholar] [CrossRef]
  77. Bandyopadhyay, R.; Kundu, R.; Oliva, D.; Sarkar, R. Segmentation of Brain MRI Using an Altruistic Harris Hawks’ Optimization Algorithm. Knowl.-Based Syst. 2021, 232, 107468. [Google Scholar] [CrossRef]
  78. Yu, Y.; Gao, S.; Cheng, S.; Wang, Y.; Song, S.; Yuan, F. CBSO: A Memetic Brain Storm Optimization with Chaotic Local Search. Memetic Comput. 2017, 10, 353–367. [Google Scholar] [CrossRef]
  79. Cao, Z.; Shi, Y.; Rong, X.; Liu, B.; Du, Z.; Yang, B. Random Grouping Brain Storm Optimization Algorithm with a New Dynamically Changing Step Size. In Proceedings of the International Conference in Swarm Intelligence, Beijing, China, 25–28 June 2015; Springer: Berlin/Heidelberg, Germany, 2015; pp. 357–364. [Google Scholar]
  80. Dowlatshahi, M.B.; Nezamabadi-Pour, H. GGSA: A Grouping Gravitational Search Algorithm for Data Clustering. Eng. Appl. Artif. Intell. 2014, 36, 114–121. [Google Scholar] [CrossRef]
  81. Wang, Y.; Yu, Y.; Gao, S.; Pan, H.; Yang, G. A Hierarchical Gravitational Search Algorithm with an Effective Gravitational Constant. Swarm Evol. Comput. 2019, 46, 118–139. [Google Scholar] [CrossRef]
  82. Lin, A.; Sun, W.; Yu, H.; Wu, G.; Tang, H. Global Genetic Learning Particle Swarm Optimization with Diversity Enhancement by Ring Topology. Swarm Evol. Comput. 2019, 44, 571–583. [Google Scholar] [CrossRef]
  83. Covic, N.; Lacevic, B. Wingsuit Flying Search—A Novel Global Optimization Algorithm. IEEE Access Pract. Innov. Open Solut. 2020, 8, 53883–53900. [Google Scholar] [CrossRef]
  84. Ross, D.; Kim, S. Dynamic Economic Dispatch of Generation. IEEE Trans. Power Appar. Syst. 1980, PAS-99, 2060–2068. [Google Scholar] [CrossRef]
  85. Xia, X.; Elaiw, A. Optimal Dynamic Economic Dispatch of Generation: A Review. Electr. Power Syst. Res. 2010, 80, 975–986. [Google Scholar] [CrossRef]
  86. Zaman, M.F.; Elsayed, S.M.; Ray, T.; Sarker, R.A. Evolutionary Algorithms for Dynamic Economic Dispatch Problems. IEEE Trans. Power Syst. 2016, 31, 1486–1495. [Google Scholar] [CrossRef]
  87. Duan, Y.; Zhao, Y.; Hu, J. An Initialization-Free Distributed Algorithm for Dynamic Economic Dispatch Problems in Microgrid: Modeling, Optimization and Analysis. Sustain. Energy Grids Netw. 2023, 34, 101004. [Google Scholar] [CrossRef]
  88. Vasile, M.; Minisci, E.; Locatelli, M. An Inflationary Differential Evolution Algorithm for Space Trajectory Optimization. IEEE Trans. Evol. Comput. 2011, 15, 267–281. [Google Scholar] [CrossRef]
  89. Zuo, M.; Dai, G.; Peng, L.; Wang, M.; Liu, Z.; Chen, C. A Case Learning-Based Differential Evolution Algorithm for Global Optimization of Interplanetary Trajectory Design. Appl. Soft Comput. 2020, 94, 106451. [Google Scholar] [CrossRef]
  90. Gao, S.; Yu, Y.; Wang, Y.; Wang, J.; Cheng, J.; Zhou, M. Chaotic Local Search-Based Differential Evolution Algorithms for Optimization. IEEE Trans. Syst. Man, Cybern. Syst. 2021, 51, 3954–3967. [Google Scholar] [CrossRef]
  91. Yu, Y.; Zhang, T.; Lei, Z.; Wang, Y.; Yang, H.; Gao, S. A Chaotic Local Search-Based LSHADE with Enhanced Memory Storage Mechanism for Wind Farm Layout Optimization. Appl. Soft Comput. 2023, 141, 110306. [Google Scholar] [CrossRef]
  92. Chen, Q.; Xue, B.; Zhang, M. Preserving Population Diversity Based on Transformed Semantics in Genetic Programming for Symbolic Regression. IEEE Trans. Evol. Comput. 2021, 25, 433–447. [Google Scholar] [CrossRef]
  93. Brindha, S.; Miruna Joe Amali, S. A Robust and Adaptive Fuzzy Logic Based Differential Evolution Algorithm Using Population Diversity Tuning for Multi-Objective Optimization. Eng. Appl. Artif. Intell. 2021, 102, 104240. [Google Scholar] [CrossRef]
Figure 1. BCG Matrix.
Figure 1. BCG Matrix.
Electronics 14 00456 g001
Figure 2. Descriptive process of BCGEO.
Figure 2. Descriptive process of BCGEO.
Electronics 14 00456 g002
Figure 3. Flowchart of BCGEO.
Figure 3. Flowchart of BCGEO.
Electronics 14 00456 g003
Figure 4. Test images and segmented images.
Figure 4. Test images and segmented images.
Electronics 14 00456 g004
Figure 5. Box-and-whisker diagrams of optimization errors on CEC2017 with 30 dimensions.
Figure 5. Box-and-whisker diagrams of optimization errors on CEC2017 with 30 dimensions.
Electronics 14 00456 g005
Figure 6. Box-and-whisker diagrams of optimization errors on CEC2017 with 50 dimensions.
Figure 6. Box-and-whisker diagrams of optimization errors on CEC2017 with 50 dimensions.
Electronics 14 00456 g006
Figure 7. Box-and-whisker diagrams of optimization errors on CEC2017 with 100 dimensions.
Figure 7. Box-and-whisker diagrams of optimization errors on CEC2017 with 100 dimensions.
Electronics 14 00456 g007
Figure 8. Convergence graphs of average optimization errors on CEC2017 with 30 dimensions.
Figure 8. Convergence graphs of average optimization errors on CEC2017 with 30 dimensions.
Electronics 14 00456 g008
Figure 9. Convergence graphs of average optimization errors on CEC2017 with 50 dimensions.
Figure 9. Convergence graphs of average optimization errors on CEC2017 with 50 dimensions.
Electronics 14 00456 g009
Figure 10. Convergence graphs of average optimization errors on CEC2017 with 100 dimensions.
Figure 10. Convergence graphs of average optimization errors on CEC2017 with 100 dimensions.
Electronics 14 00456 g010
Figure 11. Visualization of experimental results for the DED problem.
Figure 11. Visualization of experimental results for the DED problem.
Electronics 14 00456 g011
Figure 12. The trajectory of Cassini 2 from Earth to Saturn.
Figure 12. The trajectory of Cassini 2 from Earth to Saturn.
Electronics 14 00456 g012
Figure 13. Visualization of experimental results for the STO problem.
Figure 13. Visualization of experimental results for the STO problem.
Electronics 14 00456 g013
Figure 14. Comparison of population diversity between BCGEO and EO.
Figure 14. Comparison of population diversity between BCGEO and EO.
Electronics 14 00456 g014
Table 1. Experimental results of effectiveness testing.
Table 1. Experimental results of effectiveness testing.
BCGEOFitness DiscardFitness Improve DiscardOnly Pool ChangeNo Pool ChangeEO
MeanstdMeanstdMeanstdMeanstdMeanstdMeanstd
F1 4.028 × 10 3 4.732 × 10 3 6.079 × 10 3 6.560 × 10 3 5.453 × 10 3 5.075 × 10 3 4.153 × 10 3 4.970 × 10 3 4.019 × 10 3 4.806 × 10 3 3.535 × 10 3 3.996 × 10 3
F2 8.612 × 10 3 3.653 × 10 3 8.711 × 10 3 3.478 × 10 3 9.309 × 10 3 3.923 × 10 3 9.299 × 10 3 4.030 × 10 3 1.185 × 10 4 4.223 × 10 3 5.660 × 10 1 8.386 × 10 1
F3 8.774 × 10 1 6.386 × 10 0 9.334 × 10 1 1.335 × 10 1 9.106 × 10 1 1.060 × 10 1 9.137 × 10 1 1.025 × 10 1 9.251 × 10 1 1.354 × 10 1 7.715 × 10 1 2.398 × 10 1
F4 2.056 × 10 1 5.529 × 10 0 2.024 × 10 1 5.710 × 10 0 1.977 × 10 1 5.425 × 10 0 2.047 × 10 1 6.327 × 10 0 2.102 × 10 1 5.864 × 10 0 6.108 × 10 1 1.766 × 10 1
F5 4.383 × 10 5 4.633 × 10 5 3.439 × 10 5 4.623 × 10 5 5.383 × 10 5 4.559 × 10 5 4.700 × 10 5 6.393 × 10 5 4.526 × 10 5 4.688 × 10 5 5.462 × 10 3 1.602 × 10 2
F6 5.631 × 10 1 7.148 × 10 0 5.623 × 10 1 7.852 × 10 0 5.525 × 10 1 7.619 × 10 0 5.692 × 10 1 9.084 × 10 0 5.560 × 10 1 7.998 × 10 0 8.607 × 10 1 1.773 × 10 1
F7 2.317 × 10 1 6.187 × 10 0 2.205 × 10 1 5.713 × 10 0 2.196 × 10 1 4.661 × 10 0 2.250 × 10 1 5.767 × 10 0 2.099 × 10 1 6.367 × 10 0 6.216 × 10 1 1.442 × 10 1
F8 3.511 × 10 3 1.755 × 10 2 1.229 × 10 2 3.590 × 10 2 8.908 × 10 3 6.362 × 10 2 3.511 × 10 3 1.755 × 10 2 8.908 × 10 3 6.362 × 10 2 5.585 × 10 0 5.919 × 10 0
F9 2.012 × 10 3 4.675 × 10 2 2.074 × 10 3 6.018 × 10 2 2.119 × 10 3 4.143 × 10 2 2.083 × 10 3 4.563 × 10 2 1.964 × 10 3 4.721 × 10 2 3.432 × 10 3 7.442 × 10 2
F10 3.682 × 10 1 2.903 × 10 1 4.535 × 10 1 2.834 × 10 1 5.393 × 10 1 2.203 × 10 1 4.373 × 10 1 2.854 × 10 1 4.962 × 10 1 2.600 × 10 1 4.305 × 10 1 2.958 × 10 1
F11 8.469 × 10 4 4.558 × 10 4 7.528 × 10 4 3.589 × 10 4 8.230 × 10 4 5.120 × 10 4 9.030 × 10 4 4.717 × 10 4 9.215 × 10 4 5.222 × 10 4 8.837 × 10 4 1.270 × 10 5
F12 1.541 × 10 4 1.773 × 10 4 1.989 × 10 4 2.088 × 10 4 2.034 × 10 4 1.976 × 10 4 2.476 × 10 4 1.797 × 10 4 1.959 × 10 4 1.830 × 10 4 2.230 × 10 4 2.061 × 10 4
F13 2.128 × 10 4 1.261 × 10 4 2.295 × 10 4 1.548 × 10 4 2.337 × 10 4 1.527 × 10 4 2.352 × 10 4 1.679 × 10 4 3.458 × 10 4 2.462 × 10 4 7.908 × 10 3 8.610 × 10 3
F14 3.377 × 10 3 5.865 × 10 3 4.619 × 10 3 6.687 × 10 3 4.596 × 10 3 6.502 × 10 3 3.638 × 10 3 4.513 × 10 3 5.440 × 10 3 8.126 × 10 3 6.723 × 10 3 1.015 × 10 4
F15 3.449 × 10 1 3.990 × 10 1 4.813 × 10 1 7.069 × 10 1 4.058 × 10 1 5.003 × 10 1 2.589 × 10 1 1.446 × 10 1 3.614 × 10 1 4.739 × 10 1 6.280 × 10 2 2.601 × 10 2
F16 3.289 × 10 1 1.435 × 10 1 3.109 × 10 1 1.379 × 10 1 3.132 × 10 1 1.090 × 10 1 2.884 × 10 1 5.712 × 10 0 3.183 × 10 1 1.873 × 10 1 2.250 × 10 2 1.478 × 10 2
F17 3.921 × 10 5 1.743 × 10 5 4.092 × 10 5 2.100 × 10 5 4.001 × 10 5 1.802 × 10 5 4.422 × 10 5 1.696 × 10 5 5.126 × 10 5 1.586 × 10 5 1.252 × 10 5 1.048 × 10 5
F18 5.017 × 10 3 6.193 × 10 3 8.250 × 10 3 1.213 × 10 4 5.759 × 10 3 9.558 × 10 3 8.477 × 10 3 1.559 × 10 4 3.830 × 10 3 4.894 × 10 3 6.135 × 10 3 9.934 × 10 3
F19 7.777 × 10 1 5.412 × 10 1 7.832 × 10 1 8.133 × 10 1 6.481 × 10 1 5.729 × 10 1 6.034 × 10 1 5.356 × 10 1 7.663 × 10 1 5.655 × 10 1 2.391 × 10 2 1.543 × 10 2
F20 2.199 × 10 2 5.473 × 10 0 2.202 × 10 2 5.297 × 10 0 2.197 × 10 2 4.339 × 10 0 2.189 × 10 2 5.109 × 10 0 2.196 × 10 2 5.471 × 10 0 2.572 × 10 2 1.750 × 10 1
F21 1.000 × 10 2 2.040 × 10 13 1.000 × 10 2 2.470 × 10 13 1.000 × 10 2 2.046 × 10 13 1.000 × 10 2 2.306 × 10 13 1.000 × 10 2 2.309 × 10 13 1.209 × 10 3 1.693 × 10 3
F22 3.623 × 10 2 9.457 × 10 0 3.612 × 10 2 8.319 × 10 0 3.631 × 10 2 7.859 × 10 0 3.611 × 10 2 8.358 × 10 0 3.577 × 10 2 7.783 × 10 0 4.095 × 10 2 2.177 × 10 1
F23 4.359 × 10 2 7.736 × 10 0 4.348 × 10 2 6.629 × 10 0 4.356 × 10 2 6.002 × 10 0 4.340 × 10 2 5.145 × 10 0 4.315 × 10 2 6.087 × 10 0 4.811 × 10 2 1.929 × 10 1
F24 3.860 × 10 2 1.504 × 10 0 3.858 × 10 2 1.570 × 10 0 3.861 × 10 2 1.431 × 10 0 3.865 × 10 2 9.210 × 10 1 3.857 × 10 2 1.627 × 10 0 3.888 × 10 2 1.203 × 10 1
F25 9.561 × 10 2 1.424 × 10 2 9.454 × 10 2 2.030 × 10 2 9.712 × 10 2 1.444 × 10 2 9.505 × 10 2 1.364 × 10 2 9.254 × 10 2 1.838 × 10 2 1.580 × 10 3 2.792 × 10 2
F26 5.053 × 10 2 8.418 × 10 0 5.084 × 10 2 8.792 × 10 0 5.069 × 10 2 8.208 × 10 0 5.068 × 10 2 7.716 × 10 0 5.083 × 10 2 9.469 × 10 0 5.130 × 10 2 8.095 × 10 0
F27 3.813 × 10 2 4.230 × 10 1 3.830 × 10 2 3.892 × 10 1 3.802 × 10 2 3.978 × 10 1 3.794 × 10 2 3.863 × 10 1 3.658 × 10 2 4.659 × 10 1 3.412 × 10 2 4.823 × 10 1
F28 4.821 × 10 2 3.279 × 10 1 4.914 × 10 2 4.187 × 10 1 4.879 × 10 2 4.166 × 10 1 4.773 × 10 2 3.630 × 10 1 4.967 × 10 2 4.672 × 10 1 6.372 × 10 2 1.416 × 10 2
F29 4.814 × 10 3 2.707 × 10 3 3.807 × 10 3 2.183 × 10 3 5.556 × 10 3 3.536 × 10 3 4.721 × 10 3 2.818 × 10 3 4.529 × 10 3 2.597 × 10 3 5.843 × 10 3 3.528 × 10 3
w/t/l19/4/6 18/5/6 18/5/6 18/5/6 17/4/8 -
Friedman
Rankings
2.8793 3.2241 3.1552 3.5172 3.569 4.6552
Table 7. Parameters of the DED problem.
Table 7. Parameters of the DED problem.
E l [150, 135, 73, 60, 73, 57, 20, 47, 20]
E u [470, 460, 340, 300, 243, 160, 130, 120, 80]
Dimension 9 × 24
Table 8. Result of the DED problem.
Table 8. Result of the DED problem.
Meanstd
BCGEO 1 . 73 × 10 7 1 . 93 × 10 4
EO 1.75 × 10 7 1.71 × 10 5
CBSO 1.86 × 10 7 2.29 × 10 5
RGBSO 1.81 × 10 7 1.20 × 10 5
GGSA 2.51 × 10 7 7.76 × 10 5
HGSA 2.05 × 10 7 1.77 × 10 5
GLPSO 3.58 × 10 7 7.93 × 10 5
WFS 2.49 × 10 7 4.74 × 10 5
Table 9. Result of the STO problem.
Table 9. Result of the STO problem.
Meanstd
BCGEO 1 . 72 × 10 1 3 . 24 × 10 0
EO 1.86 × 10 1 3.67 × 10 0
CBSO 2.71 × 10 1 3.49 × 10 0
RGBSO 3.06 × 10 1 6.44 × 10 0
GGSA 3.91 × 10 1 7.65 × 10 0
HGSA 3.74 × 10 1 5.82 × 10 0
GLPSO 2.38 × 10 1 2.99 × 10 0
WFS 2.65 × 10 1 3.39 × 10 0
Table 10. Statistical results of BCGEO with different γ values.
Table 10. Statistical results of BCGEO with different γ values.
γ 0.90.9250.950.9750.9850.9880.999
Friedman Ranking4.25863.98283.87934.08623.41384.20694.1724
Wilcoxon Test p-value2.49 × 10 2 2.90 × 10 1 6.41 × 10 1 6.35 × 10 2 3.68 × 10 1 4.73 × 10 1
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

Yang, L.; Xu, Z.; Yuan, F.; Liu, Y.; Tian, G. Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch. Electronics 2025, 14, 456. https://doi.org/10.3390/electronics14030456

AMA Style

Yang L, Xu Z, Yuan F, Liu Y, Tian G. Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch. Electronics. 2025; 14(3):456. https://doi.org/10.3390/electronics14030456

Chicago/Turabian Style

Yang, Lin, Zhe Xu, Fenggang Yuan, Yanting Liu, and Guozhong Tian. 2025. "Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch" Electronics 14, no. 3: 456. https://doi.org/10.3390/electronics14030456

APA Style

Yang, L., Xu, Z., Yuan, F., Liu, Y., & Tian, G. (2025). Boston Consulting Group Matrix-Based Equilibrium Optimizer for Numerical Optimization and Dynamic Economic Dispatch. Electronics, 14(3), 456. https://doi.org/10.3390/electronics14030456

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

Article Metrics

Back to TopTop