Local Exploitation Capability Research Articles

An improved prairie dog optimization algorithm integrating multiple strategies and its application

Aiming at the problems in prairie dog optimization (PDO), such as uneven population distribution at initialization, slow convergence, imbalance between global exploration and local exploitation, and the tendency to get trapped in the local optimum, this study proposes an Improved prairie dog optimisation algorithm integrating multiple strategies (IMSPDO). Firstly, the population is initialized using spatial pyramid matching (SPM) chaotic mapping combined with improved random opposition-based learning (IROL) to solve the problems of uneven distribution and poor diversity of the population. Secondly, the prey escapes energy formula mentioned in the harris hawks optimization (HHO) is introduced to achieve the smooth transition between the exploration phase and the exploitation phase, balancing the algorithm’s global exploration capability and local exploitation capability. Additionally, the idea of the particle swarm optimization (PSO) is applied to enhance the global optimization capability of the algorithm. Finally, the ideas of simulated annealing (SA), polynomial mutation and Cauchy mutation are also introduced to improve the ability that individuals to jump out of the local optimum. The performance of the improved algorithm is verified on a set of 21 classical benchmark functions and 8 CEC2020 test functions. The proposed IMSPDO is also evaluated against original PDO, and six other commonly used algorithms. The result of the Wilcoxon rank-sum test shows that there is a significant difference between the selected algorithms and IMSPDO. Furthermore, 3 engineering examples are used to further test the superiority of IMSPDO in dealing with real-world problems.

An enhanced salp swarm algorithm with chaotic mapping and dynamic learning for optimizing purge process of proton exchange membrane fuel cell systems

Swarm intelligence algorithm is now a research focus for the energy optimization of fuel cell systems to improve hydrogen utilization efficiency. However, conventional algorithms exhibit poor robustness and low execution efficiency since complex constraints are involved in the fuel cell cathode purge process. Given that, this paper innovatively introduces chaotic mapping and dynamic learning mechanisms into the Salp swarm algorithm to enhance the algorithm's global search and local exploitation capabilities under complex constraints. First, we developed a three-stage nonlinear cathode purge model to describe the different water transfer behaviors in the three purging stages. Then, an optimizing function is created under the complex staged constraints to accurately reveal the energy consumption mechanism. Finally, the enhanced Salp swarm algorithm enables the rapid and accurate determination of the three-stage dynamic purge flows based on minimizing energy consumption. Compared with the fixed flow purge scheme, we found that energy consumption is reduced by 3.6 %–8.2 % under various constraints. The enhanced Salp swarm algorithm proposed in this work demonstrates an outstanding performance in the energy consumption optimization of fuel cell systems.

A double-layer Q-learning driven memetic algorithm for integrated scheduling of procurement, production and maintenance with distributed resources

The existing research on integrated production scheduling typically focuses on activities related to both production and post-production (e.g., operation and maintenance), with limited consideration for simultaneously integrating pre-production activities (e.g., raw material procurement). However, achieving the equilibrium between the manufacturer and the demander for intelligent manufacturing systems requires the optimal scheduling solution that integrates both pre-production and post-production activities. Inspired by this, we investigate a novel integrated scheduling problem that concurrently considers raw material procurement, production scheduling and equipment maintenance (abbreviated as SIPPM). A mixed-integer linear programming model is developed to simultaneously minimize the total costs for the manufacturer and the demander. Furthermore, a double-layer Q-learning driven memetic algorithm (DQMA) is proposed to solve the SIPPM. In DQMA, a well-tailored three-layer hybrid encoding method is presented for chromosome representation. The global search of DQMA employs three crossover and three mutation operators. Moreover, a knowledge-based local search operator with six methods, guided by an effective double-layer Q-learning structure, is devised to enhance local exploitation capabilities. The superiority of DQMA is verified through comparison with three popular multi-objective optimization algorithms on 108 newly established benchmark instances. The proposed integrated scheduling mode is proven to be more effective than two separated scheduling modes without considering raw material procurement.

A Multi-strategy Improved Grasshopper Optimization Algorithm for Solving Global Optimization and Engineering Problems

This paper presents a multi-strategy improved grasshopper optimization algorithm (MSIGOA), which aims to address the shortcomings of the grasshopper optimization algorithm (GOA), including its slow convergence, vulnerability to trapping into local optima, and low accuracy. Firstly, to improve the uniformity of the population distribution in the search space, the MSIGOA uses circle mapping for the population initialization. A nonlinear decreasing coefficient is utilized instead of an original linear decreasing coefficient to improve the local exploitation and global exploration capabilities. Then, the modified golden sine mechanism is added during the position update stage to change the single position update mode of GOA and enhance the local exploitation capability. The greedy strategy is added to greedily select the new and old positions of the individual to retain a better position and increase the speed of convergence. Finally, the quasi-reflection-based learning mechanism is utilized to construct new populations to improve population multiplicity and the capability to escape from the local optima. This paper verifies the efficacy of MSIGOA by comparing it with other advanced algorithms on six engineering design problems, CEC2017 test functions, and 12 classical benchmark functions. The experimental results show that MSIGOA performs better than the original GOA and other compared algorithms and has stronger comprehensive optimization capabilities.

A novel data-driven IBA-ELM model for SOH/SOC estimation of lithium-ion batteries

Lithium-ion batteries (Libs) have become the best power source for electric vehicles due to their high energy density and long cycle life. The state estimation is directly related to the safe and efficient use of Libs. In our previous research, a Bat Algorithm-Extreme Learning Machine (BA-ELM) model was constructed and promising results were achieved for state of health (SOH) estimation. To increase the engineering application value of BA-ELM for SOH/state of charge (SOC) estimation, optimization mechanism of improving the global exploration and local exploitation capabilities of the model was studied. First, three improved methods including a conversion mechanism of Artificial Bee Colony algorithm employing bees and scout bees, a mechanism for adaptive adjustment of the search frequency of bats according to the Euclidean distance difference, and an adaptive inertia weight coefficient method were proposed to construct a novel Improved Bat Algorithm (IBA)-ELM model. Second, a battery life degradation test platform was built to obtain the degradation dataset for Libs. The variation rules of nine battery variables and cycles were revealed. Four high-quality SOH-related features were extracted. Thus, the SOH estimation performance of six models was evaluated. Third, a Libs charge–discharge dataset under driving conditions was collected and processed. Four models were trained based on 72,048 samples from four conditions. Further, SOC estimation tests were conducted on 35,071 samples from completely different conditions. The results show that the root mean square error (RMSE) and mean absolute error (MAE) of SOH estimation by IBA-ELM decreased by 21.93 % and 23.79 %, respectively, compared to those by BA-ELM. The RMSE and MAE of SOC estimation decreased by more than 10 %. Error, radar, and violin plots demonstrate that the IBA-ELM could accurately estimate SOH/SOC in larger scale datasets, simultaneously exhibiting better generalization performance.

Adaptive projection plane and reference point strategy for multi-objective particle swarm optimization

Achieving a balance between convergence and diversity and their mutual enhancement is a complex task in the process of algorithm improvement. This is crucial because it is directly related to the effectiveness of the algorithm in obtaining accurate and uniformly distributed Pareto frontiers. Although significant progress has been made in particle swarm algorithms, exploring new approaches is necessary. In this paper, we construct a projection plane (projection line in 2D) based on the extreme values of the non-dominated solutions, select a set of uniform reference points on the projection plane, and then project the non-dominated solutions onto the constructed projection plane to form projection points. The reference points and projection points on the projection plane are thus utilized to guide the updating of the population as well as the maintenance of the external archive, a strategy that enhances the algorithm's global exploration and local exploitation capabilities. Secondly, we aggregate the target values of particles into a single scalar value and combine the idea of particle fusion to design a scheme for the particle selection of individual optimal particles. This paper further improves the algorithm's overall performance by using the information between populations to select individual optimal particles. Lastly, it is evaluated against a number of multi-objective algorithms that are currently in use and perform well on 22 test problems. The findings demonstrate that the algorithm this paper proposes performs better when solving multi-objective problems.

Modified snake optimizer based multi-level thresholding for color image segmentation of agricultural diseases

Image segmentation is crucial for early identification and diagnosis of crop diseases in agriculture. It helps identify disease areas and characteristics, laying the groundwork for disease diagnosis and treatment. However, color image thresholding segmentation method faces challenges in finding the optimal threshold as the number of thresholds increases, which affects segmentation quality. In this paper, a modified snake optimizer (MSO) is proposed to address the color image thresholding segmentation problem using Kapur’s entropy as the objective function. MSO incorporates a dynamic adaptive parameter adjustment method. The improved global position update formula introduces guidance from the optimal individual and disturbance from random individuals, effectively achieving a balance between global and local search capabilities. A dynamic parameter adjustment method is added to accelerate convergence speed during snake movement to food. Lévy flight is introduced to the Flight mode to help the algorithm escape local extremums. A balancing strategy is implemented in the Mating mode, incorporating guidance from the optimal individual and information exchange between sub-populations, enabling balanced exploration and local exploitation capabilities. The hill-climbing jump operation for the optimal individual is added to help the algorithm overcome local stagnation. The proposed MSO is evaluated on CEC 2017 test functions and color test images, and the obtained results are compared with other segmentation methods and other intelligent optimization algorithms. The results demonstrate that MSO exhibits stable and excellent performance in both complex global optimization problems and color image thresholding segmentation problems. Finally, MSO is applied to segment rice disease images, and the results reveal significantly better segmentation performance compared to other algorithms. MSO shows great potential in solving the thresholding segmentation problem for agricultural disease images, thereby assisting in the accurate identification, diagnosis, and treatment of agricultural diseases and insect pests.

Particle Swarm Optimization Algorithm Using Velocity Pausing and Adaptive Strategy

Particle swarm optimization (PSO) as a swarm intelligence-based optimization algorithm has been widely applied to solve various real-world optimization problems. However, traditional PSO algorithms encounter issues such as premature convergence and an imbalance between global exploration and local exploitation capabilities when dealing with complex optimization tasks. To address these shortcomings, an enhanced PSO algorithm incorporating velocity pausing and adaptive strategies is proposed. By leveraging the search characteristics of velocity pausing and the terminal replacement mechanism, the problem of premature convergence inherent in standard PSO algorithms is mitigated. The algorithm further refines and controls the search space of the particle swarm through time-varying inertia coefficients, symmetric cooperative swarms concepts, and adaptive strategies, balancing global search and local exploitation. The performance of VASPSO was validated on 29 standard functions from Cec2017, comparing it against five PSO variants and seven swarm intelligence algorithms. Experimental results demonstrate that VASPSO exhibits considerable competitiveness when compared with 12 algorithms. The relevant code can be found on our project homepage.

New PID parameter tuning based on improved dung beetle optimization algorithm

AbstractIn this paper, a proportional‐integral‐derivative (PID) controller parameter optimization method based on the improved dung beetle optimization (IDBO) algorithm is proposed, which improves the balance between the global exploration and local exploitation capabilities of the dung beetle optimization (DBO) and significantly enhances the convergence speed and optimization accuracy. Initially, the dung beetle population is initialized using piecewise linear chaotic map (PWLCM) chaotic mapping in order to increase its variety and the DBO algorithm's capacity for global exploration. Furthermore, adaptive weighting in the DBO algorithm is now balanced between the capabilities of local exploitation and global exploration with the addition of adaptive weights. After that, in order to improve the DBO algorithm's capacity for local exploitation, a triangle wandering strategy is included during the dung beetle reproductive phase. Finally, using both Lévy flying wandering and greedy strategy (GS) together make it easier to take advantage of opportunities in both local and global areas. The outcomes of the traditional benchmark function test demonstrate a significant improvement in both convergence speed and optimization accuracy when the particle swarm optimization (PSO), DBO, grey wolf optimization (GWO), and sparrow search algorithm (SSA) algorithms are compared. The performance index function incorporates an overshooting penalty term to prevent the overshooting phenomenon in the control system. Simulation experiments are carried out for the DC motor control system, and the time domain performance, frequency domain performance, and robustness performance of the closed‐loop control system with ZN‐PID, Lambda‐PID, PSO‐PID, and IDBO‐PID rectified PID controller parameters are comparatively analyzed, which verifies the validity and practicability of the IDBO algorithm.

Deep learning-driven interval uncertainty propagation for aeronautical structures

Interval Uncertainty Propagation (IUP) holds significant importance in quantifying uncertainties in structural outputs when confronted with interval input parameters. In the aviation field, the precise determination of probability models for input parameters of aeronautical structures entails substantial costs in both time and finances. As an alternative, the use of interval variables to describe input parameter uncertainty becomes a pragmatic approach. The complex task of solving the IUP for aeronautical structures, particularly in scenarios marked by pronounced nonlinearity and multiple outputs, necessitates innovative methodologies. This study introduces an efficient deep learning-driven approach to address the challenges associated with IUP. The proposed approach combines the Deep Neural Network (DNN) with intelligent optimization algorithms for dealing with the IUP in aeronautical structures. An inventive extremal value-oriented weighting technique is presented, assigning varying weights to different training samples within the loss function, thereby enhancing the computational accuracy of the DNN in predicting extremal values of structural outputs. Moreover, an adaptive framework is established to strategically balance the global exploration and local exploitation capabilities of the DNN, resulting in a predictive model that is both robust and accurate. To illustrate the effectiveness of the developed approach, various applications are explored, including a high-dimensional numerical example and two aeronautical structures. The obtained results highlight the high computational accuracy and efficiency achieved by the proposed approach, showcasing its potential for addressing complex IUP challenges in aeronautical engineering.

Classification feature selection and dimensionality reduction based on logical binary sine-cosine function arithmetic optimization algorithm

Arithmetic optimization algorithm (AOA) is a meta-heuristic algorithm inspired by mathematical operations. AOA has been diffusely used for optimization issues on continuous domains, but few scholars have studied discrete optimization problems. In this paper, we proposed Binary AOA (BAOA) based on two strategies to handle the feature selection problem. The first strategy used S-shaped and V-shaped shift functions to map continuous variables to discrete variables. The second strategy was to combine four logical operations (AND, OR, XOR, XNOR) on the basis of the transfer function, and constructed a parameter model based on the sine and cosine function. An enhanced logic binary sine–cosine function arithmetic optimization algorithm (LBSCAOA) was proposed to realize the position update of variables. Its purpose was to improve the algorithm's global search capabilities and local exploitation capabilities. In the simulation experiments, 20 datasets were selected to testify the capability of the proposed algorithm. Since KNN had the advantages of easy understanding and low training time complexity, this classifier was selected for evaluation. The performance of the improved algorithm was comprehensively evaluated by comparing the average classification accuracy, the average number of selected features, the average fitness value and the average running time. Simulation results showed LBSCAOA with V-Shaped “V4” stood out among many improved algorithms. On the other hand, LBSCAOA with V-Shaped “V4” was used as a representative to compare with other typical feature selection algorithms to verify its competitivenes.

Distribution Network Reconfiguration Based on an Improved Arithmetic Optimization Algorithm

Aiming to address the defects of the arithmetic optimization algorithm (AOA), such as easy fall into local optimums and slow convergence speed during the search process, an improved arithmetic optimization algorithm (IAOA) is proposed and applied to the study of distribution network reconfiguration. Firstly, a reconfiguration model is established to reduce network loss, and a cosine control factor is introduced to reconfigure the math optimization accelerated (MOA) function to coordinate the algorithm’s global exploration and local exploitation capabilities. Subsequently, a reverse differential evolution strategy is introduced to improve the overall diversity of the population and Weibull mutation is performed on the better-adapted individuals generated in each iteration to ensure the quality of the optimal individuals generated in each iteration and strengthen the algorithm’s ability to approach the optimal solution. The performance of the improved algorithm is also tested using eight basis functions. Finally, simulation analysis is carried out by taking the IEEE33 and IEEE69 node systems and a real power distribution system as examples; the results show that the proposed algorithm can help to reconfigure the system quickly, and the system node voltages and network losses were significantly improved after the reconfiguration.

MCHIAO: a modified coronavirus herd immunity-Aquila optimization algorithm based on chaotic behavior for solving engineering problems

This paper proposes a hybrid Modified Coronavirus Herd Immunity Aquila Optimization Algorithm (MCHIAO) that compiles the Enhanced Coronavirus Herd Immunity Optimizer (ECHIO) algorithm and Aquila Optimizer (AO). As one of the competitive human-based optimization algorithms, the Coronavirus Herd Immunity Optimizer (CHIO) exceeds some other biological-inspired algorithms. Compared to other optimization algorithms, CHIO showed good results. However, CHIO gets confined to local optima, and the accuracy of large-scale global optimization problems is decreased. On the other hand, although AO has significant local exploitation capabilities, its global exploration capabilities are insufficient. Subsequently, a novel metaheuristic optimizer, Modified Coronavirus Herd Immunity Aquila Optimizer (MCHIAO), is presented to overcome these restrictions and adapt it to solve feature selection challenges. In this paper, MCHIAO is proposed with three main enhancements to overcome these issues and reach higher optimal results which are cases categorizing, enhancing the new genes’ value equation using the chaotic system as inspired by the chaotic behavior of the coronavirus and generating a new formula to switch between expanded and narrowed exploitation. MCHIAO demonstrates it’s worth contra ten well-known state-of-the-art optimization algorithms (GOA, MFO, MPA, GWO, HHO, SSA, WOA, IAO, NOA, NGO) in addition to AO and CHIO. Friedman average rank and Wilcoxon statistical analysis (p-value) are conducted on all state-of-the-art algorithms testing 23 benchmark functions. Wilcoxon test and Friedman are conducted as well on the 29 CEC2017 functions. Moreover, some statistical tests are conducted on the 10 CEC2019 benchmark functions. Six real-world problems are used to validate the proposed MCHIAO against the same twelve state-of-the-art algorithms. On classical functions, including 24 unimodal and 44 multimodal functions, respectively, the exploitative and explorative behavior of the hybrid algorithm MCHIAO is evaluated. The statistical significance of the proposed technique for all functions is demonstrated by the p-values calculated using the Wilcoxon rank-sum test, as these p-values are found to be less than 0.05.

Advancing Slim-Hole Drilling Accuracy: A C-I-WOA-CNN Approach for Temperature-Compensated Pressure Measurements.

This paper presents a novel method to improve drill pressure measurement accuracy in slim-hole drilling within the petroleum industry, a sector often plagued by extreme conditions that compromise data integrity. We introduce a temperature compensation model based on a Chaotic-Initiated Adaptive Whale Optimization Algorithm (C-I-WOA) for optimizing Convolutional Neural Networks (CNNs), dubbed the C-I-WOA-CNN model. This approach enhances the Whale Optimization Algorithm (WOA) initialization through chaotic mapping, boosts the population diversity, and features an adaptive weight recalibration mechanism for an improved global search and local optimization. Our results reveal that the C-I-WOA-CNN model significantly outperforms traditional CNNs in its convergence speed, global searching, and local exploitation capabilities, reducing the average absolute percentage error in pressure parameter predictions from 1.9089% to 0.86504%, thereby providing a dependable solution for correcting temperature-induced measurement errors in downhole settings.

Multiple strategies based Grey Wolf Optimizer for feature selection in performance evaluation of open-ended funds

The methods for selecting the features in evaluating fund performance rely heavily on traditional statistics, which can potentially lead to excessive data dimensions in a multi-dimensional context. Grey Wolf Optimizer (GWO), a swarm intelligence optimization algorithm with its simple structure and few parameters, is widely used in feature selection. However, the algorithm suffers from local optimality and the imbalance in exploration and exploitation. This paper proposes a Multi-Strategy Grey Wolf Optimizer (MSGWO) to address the limitations, and identify the relevant features for evaluating fund performance. Random Opposition-based Learning is applied to enhance population quality during the initialization phase. Moreover, the convergence factor is nonlinearized to coordinate the global exploration and local exploitation capabilities. Finally, a two-stage hybrid mutation operator is applied to modify the updating mechanism, so as to increase population diversity and balance the exploration and exploitation abilities of GWO. The proposed algorithm is compared against 6 related algorithms and verified by the Wilcoxon signed-rank test on 12 quarterly datasets (2020-2022) of Chinese open-ended funds. The results inform that MSGWO reduces the feature size as well as the classification error rate.

Research on Solving Flexible Job Shop Scheduling Problem Based on Improved GWO Algorithm SS-GWO

As an important branch of production scheduling, the flexible job shop scheduling problem (FJSP) is a typical NP-hard problem. Researchers have adopted many intelligent algorithms to solve the FJSP problem, nonetheless, the task of dynamically adapting its essential parameters during the computational process is a significant challenge, resulting in the solution efficiency and quality failing to meet the production requirements. To this end, this paper proposes an adaptive gray wolf fast optimization algorithm (SS-GWO), which adopts the gray wolf algorithm (GWO) as the basic optimization method, and the algorithm adaptively selects the global search or local search according to the degree of agglomeration of individuals. Firstly, a non-linear convergence factor strategy is employed to control the global exploration and local exploitation capabilities of the algorithm at different stages. This enhances optimization precision and accelerates convergence speed, achieving a dynamic balance between the two. Secondly, the spiral search mechanism of Whale Optimization Algorithm is used in GWO to improve the exploration capability of Gray Wolf Optimization Algorithm. Finally, the effectiveness of SS-GWO model is verified by comparison experiments. The comparison demonstrates the superiority of SS-GWO over the other five state-of-the-art algorithms in solving the 22 classical benchmark test functions. SS-GWO is applied to solve FJSP by means of the standard test function bandimarte calculus. The optimal solution and performance of SS-GWO for solving FJSP are compared with other algorithms. The experimental results show that the SS-GWO algorithm has good optimization performance, and the maximum completion time is reduced by 19% and 37% compared with that of IGWO and GWO, respectively, and the proposed SS-GWO algorithm achieves a better solution effect on flexible job shop scheduling instances, which can satisfy the actual production scheduling needs.

A novel binary genetic differential evolution optimization algorithm for wind layout problems

<abstract><p>This paper addresses the increasingly critical issue of environmental optimization in the context of rapid economic development, with a focus on wind farm layout optimization. As the demand for sustainable resource management, climate change mitigation, and biodiversity conservation rises, so does the complexity of managing environmental impacts and promoting sustainable practices. Wind farm layout optimization, a vital subset of environmental optimization, involves the strategic placement of wind turbines to maximize energy production and minimize environmental impacts. Traditional methods, such as heuristic approaches, gradient-based optimization, and rule-based strategies, have been employed to tackle these challenges. However, they often face limitations in exploring the solution space efficiently and avoiding local optima. To advance the field, this study introduces LSHADE-SPAGA, a novel algorithm that combines a binary genetic operator with the LSHADE differential evolution algorithm, effectively balancing global exploration and local exploitation capabilities. This hybrid approach is designed to navigate the complexities of wind farm layout optimization, considering factors like wind patterns, terrain, and land use constraints. Extensive testing, including 156 instances across different wind scenarios and layout constraints, demonstrates LSHADE-SPAGA's superiority over seven state-of-the-art algorithms in both the ability of jumping out of the local optima and solution quality.</p></abstract>

A hybrid butterfly algorithm in the optimal economic operation of microgrids.

With the increasing capacity of renewable energy generators, microgrid (MG) systems have experienced rapid development, and the optimal economic operation is one of the most important and challenging issues in the MG field. To reduce the overall generation cost of microgrids, a hybrid butterfly algorithm (HBOA) is proposed to address the optimal economic operation problem in MG systems. This algorithm uses adaptive switching thresholds to balance the global exploration capability and local exploitation capability of the algorithm. It introduces a diversity learning mechanism to enhance information exchange among populations to improve the algorithm's accuracy and proposes an elite-guided guidance strategy to accelerate the convergence speed of the algorithm. Numerical simulation experiments on 10 standard test functions validate that the HBOA algorithm has higher optimization accuracy and faster convergence speed. Simulation experiments are conducted on two operation modes of microgrids: Islanded and grid-connected, and compared with other algorithms. In islanded and grid-connected modes, HBOA can reduce operating costs by up to 11.7% and 17.7%, respectively. The experimental results confirm the applicability and superiority of the proposed algorithm for solving the optimal economic operation problem in microgrids.

Solving energy-efficient lock group co-scheduling problem with ship lift and approach channel using a collaborative adaptive multi-objective algorithm

There is growing interest in the lock group co-scheduling research because of serious capacity imbalance between two dams at Three Gorges-Gezhou Dams Hub (TGDH). However, most current studies ignore the impact of ship lift and approach channel on navigation efficiency, and the energy consumption from vessels on ecological environment. Encouraged by this, we investigate an energy-efficient lock group co-scheduling problem at the TGDH with the consideration of ship lift as well as approach channel. A new multi-objective model for the problem is proposed, aiming to simultaneously optimize the average area utilization of all locks, average tardiness of vessels and total energy consumption of vessels. A collaborative adaptive multi-objective algorithm (CAMOA) is well-designed to solve the studied problem. The CAMOA makes use of a well-tailored two-layer encoding scheme and a three-stage group-shift decoding approach to represent and decode each solution. Next, an adaptive adjustment search strategy based on step control factor is periodically triggered to reinforce local exploitation capability, where a novel fuzzy correlation entropy analysis is coupled to evaluate the neighborhood solutions. Extensive simulation experiments are implemented according to the real-world data from the TGDH. The statistical results demonstrate that the proposed CAMOA is efficient and reliable in solving the studied problem. This work is very significant for TGDH to improve the passing efficiency and reduce the energy consumption.

Integrating renewable energy and V2G uncertainty into optimal power flow: A gradient bald eagle search optimization algorithm with local escaping operator

AbstractHere, a new approach is proposed for solving the optimal power flow (OPF) problem in transmission networks using a Gradient Bald Eagle Search Algorithm (GBES) with a Local Escaping Operator (LEO). The method takes into account uncertainty of the renewable energy sources (wind energy and photovoltaic systems) and Vehicle‐to‐Grid (V2G) in the stochastic OPF problem. To improve the efficiency of the proposed technique and enhance its local exploitation capability, the LEO method's selection features are utilized. Monte Carlo methods are employed to estimate the generation costs of the renewable sources and PEVs and study their feasibility. The uncertainty of the renewable sources and PEVs is represented by Weibull, lognormal, and normal probability distribution functions (PDFs). The GBES approach is experimentally compared with well‐known meta‐heuristics using twenty‐three different test functions, and the results indicate its superiority over BES and other recently developed algorithms. Furthermore, the proposed method's effectiveness is evaluated using IEEE 30‐bus test system under various scenarios, and the simulation results demonstrate that it can effectively address OPF issues considering renewable energy sources and V2G, providing superior optimal solutions compared to other algorithms.