Abstract
This research work proposes a hybrid Manta ray Forging Optimization- Sine Cosine Algorithm (MRFO-SCA) for Congestion Management (CM) that addresses the power system transmission line congestion cost challenges with the integration of Wind Energy System (WES). The proposed method focuses on two key objectives: first, identifying the most influential bus within the power system using the Bus Sensitivity Factor (BSF) to optimally place a wind power source, thereby impacting the power flow in overloaded lines. Second, MRFO-SCA has been developed for optimal power rescheduling of the generators to alleviate congestion while minimizing the congestion cost. The hybrid MRFO-SCA has been formulated by integrating SCA into the MRFO that enhances the exploration and exploitation phases in MRFO leading to the rapid discovery of the global optima. MRFO-SCA has been verified on benchmark functions that have delivered appreciable results. The effectiveness of the proposed approach has been assessed and validated using the IEEE-30 bus system. Simulation results indicate that incorporating WES with MRFO-SCA has led to a reduction in congestion costs by 18.45%, 15.68%, 10.34%, 9.72%, 5.46%, and 1.57% as compared to several recent optimization techniques. A comparative evaluation demonstrates that MRFO-SCA outperforms other methods in terms of congestion cost reduction, system loss minimization, bus voltage improvement, faster convergence, and reduced computational time, making it a more efficient and accurate solution for CM.
Keywords: Power flow control, Renewable energy, Heuristic techniques, Cost minimization, Power rescheduling, Control, Optimization
Subject terms: Electrical and electronic engineering, Energy infrastructure, Renewable energy
Introduction
The transmission of electrical power is crucial for meeting the energy demands of a power system. Efficient performance of the power system depends on the reliable power transmission that is governed by the system constraints, such as thermal, voltage, and stability limits, effectively. However, there has been significant competition among market participants that may lead to the overburdening of the transmission corridors due to excess power flow beyond their designed facilities. This overloading of the transmission channels may lead to the violations in the system constraints, that may be designated as the congestion in the transmission lines. This scenario of congestion can highly influence the operating state of the power system and its stability. In such situations, the System Operators (SOs) implement regulatory measures in the electricity market and ensure reliable power transactions without exceeding system limits. The continuous increment in the power demand by the consumers and the limited expansion of transmission networks, has issued significant threat towards the congestion in the transmission lines1.
The scenario of congestion can arise from various factors, such as excess demand in power from the consumer side, sudden tripping of the generators, unforeseen power flows, and transmission line trips etc. The state of congestion can severely disturb the system reliability, instigate sharp increase in the electricity prices for power transactions, and can affect the continuity in the power transmission to the consumers. It is the system operator’s key responsibility to monitor and address congestion to prevent these issues. Thus, the implementation of effective Congestion Management (CM) strategies is essential for reliable operations. Traditional CM methods that are adopted by the system operators are generator rescheduling, integrating reactive power support, managing consumer demand, implementing demand response programs, and building new transmission infrastructure. The challenge for power system researchers lies in applying these CM techniques at the lowest operational cost, offering considerable potential for improvement through the use of advanced mathematical methods.
Literature survey
The researchers in the field of power systems have made notable advancements in CM by implementing diverse strategies to prevent and mitigate issues caused by the demand for electricity transmission exceeding network capacity2,3. Wang and colleagues explored CM through system frequency monitoring and the integration of distributed energy resources, which also serve as providers of ancillary services4. Attar et al. explored CM by proposing a platform to unlock flexibility from various resources through market integration of TSO-DSO coordination, and facilitate data access via a metadata register for improved SO decision-making5. Zakaryaseraji and Ghasemi-Marzbali combined the influence distribution generation and the effect of demand response to investigate CM approaches based on the consumer6. Roustaei et al. proposed a voltage stability-based CM strategy aimed at improving power flow control while ensuring voltage security within the transmission network7. Mishra et al. applied artificial intelligence techniques, including neural networks to address congestion8. Dehnavi et al. introduced a novel CM framework based on adapting a segregation and zonal approach in the topology of power system network with restructured electricity market9.
In the power system operations, the Generator Rescheduling (GR) serves as a vital strategy for CM by optimizing power generation schedules to mitigate congestion in transmission networks. This process enables better utilization of the already existing infrastructure of the transmission lines, while minimizing the urge for rapid transmission system expansion. By adjusting the output of generators, system operators can relieve congestion, thereby promoting stable operating conditions. Additionally, the combination of the GR and the renewable energy system also provide cost-effective generation dispatch. Subramaniyan and Gomathi used of soft computing methods, such as fuzzy logic and genetic algorithms, to enhance congestion management in transmission networks through GR10. Their study highlighted the potential of these techniques to streamline the CM process and achieve efficient power system operation. Similarly, Agrawal et al. proposed a cascaded deep neural network-based framework to facilitate customer participation in CM. Their approach emphasized the role of renewable energy and distributed energy resources (DERs) in optimizing GR, which contributes to congestion relief in deregulated power markets11. Chakravarthi et al. included the design of controllers to support efficient generator rescheduling, ensuring the timely mitigation of congestion in power systems12. Thiruvel et al. managed congestion that incorporates demand response and accounts for the uncertainties of renewable energy sources. Their strategy also incorporated DG and generator rescheduling to enhance congestion management13. Similarly, Saravanan and Anbalagan introduced an intelligent hybrid technique that combined genetic algorithms (GA) with PSO to achieve optimal GR, thereby mitigating congestion in deregulated power markets. Haq et al. introduced a game-theoretic method for CM, leveraging plug-in electric vehicles (PEVs) in conjunction with GR. Their approach involved adjusting the charging and discharging schedules of PEVs to support congestion relief14. Verma and Mukherjee developed a CM strategy based on real power GR using an ant lion optimizer. Their approach focused on optimizing generator schedules to alleviate congestion and improve power system performance.
The influence of renewable energy on the power system network plays a significant role in managing the power flow in the transmission line. In15, Mouassa et al. introduced a Dwarf Mongoose Optimization Algorithm to address the stochastic optimal power flow in power systems with renewable energy sources, achieving superior performance in minimizing generation costs, transmission losses, and environmental. In another research, Mohamed et al. considered Chaotic African Vultures Optimization Algorithm to maintain optimal power flow incorporating Weibull-based wind power predictions, penalty and reserve costs, and FACTS devices, achieving superior performance over AVOA in cost reduction, power loss minimization16. Swirydowicz et al. proposed a GPU-native sparse direct solver for addressing the issue of power flow congestion and economic dispatch considering GPU hardware from both AMD and NVIDIA to accelerate sparse linear system computations while achieving significant performance improvements and highlighting opportunities for further optimization in heterogeneous computing environments17. Gracia et al. studied the architecture of the bipolar DC grid to control the power flow and alleviate congestion with asymmetric loading, transforming a nonlinear programming (NLP) model18. Naderi et al. proposed a hybrid wavelet mutation-based algorithm to solve the congestion with multi-fuel constraints, optimizing generation cost, emissions, power loss, and voltage deviation19. Khani et al. proposed a bi-level stochastic model for integrated energy management in interconnected transmission and distribution networks, incorporating renewable energy to reduce the risk of overloading in the transmission network20. Ullah et al. proposed a hybrid PSO-GSA algorithm for optimal energy trading in interconnected microgrids (MGs) for optimizing the power flow considering the influence uncertainties in the renewable energy utilization21.
The operation of competitive energy markets has driven the need for advanced optimization algorithms that effectively address power system challenges, yielding accurate and improved results. Traditionally, power system researchers have relied on deterministic methods, including classical approaches, to solve the optimal power generation and dispatch problem. These issues have been tackled using various traditional techniques in convex optimization. However, the use of these deterministic methods is limited by constraints. In such cases, the solutions derived from these methods are highly dependent on the initial conditions, which may lead to local optima. To overcome these limitations, stochastic methods offer a more efficient solution by bypassing the issues inherent in deterministic approaches. This has led to the adoption of heuristic and metaheuristic techniques, which are better equipped to provide optimal solutions compared to deterministic methods. Many researchers have turned to these techniques to find effective solutions for optimal power generation, ensuring a reliable and sustainable power flow through transmission networks22. The application of the heuristics techniques for the optimal operation of the power system can be found in the areas like system risk mitigation in competitive systems with artificial gorilla troops23, IPD-(1 + I) controller for frequency control in a power system with sine-cosine algorithmic technique24, particle swarm optimization for maximum power point tracking in inverters25. A well-chosen selection and proper tuning of control parameters in meta-heuristic methods significantly influence the quality of the solutions obtained. These techniques offer a practical approach to finding optimal solutions while reducing computational effort. The primary objective of this study is to design and implement an effective optimization strategy aimed at addressing the CM problem, with a focus on achieving substantial cost reduction in the final outcome.
In this research, the Manta Ray Forge Optimization (MRFO) has been introduced with the hybridization of Sine Cosine Algorithm (SCA) for obtaining better output by avoiding the MRFO getting trapped in the local optima. The selection of MRFO and SCA for this research has been based on the “No Free Lunch” (NFL) theorems for optimization assert that no optimization algorithm can outperform all others across every possible problem26. In essence, if an algorithm shows strong performance on a particular group of problems, it must, on average, perform less effectively on other problems. According to this Manta-Ray Forge Optimization (MRFO) has contributed appreciable outcome for the power system optimization problem like ELD27, optimal sizing of renewable energy28 Load frequency control29, DG placement30, power transfer capabilities31but in many cases it has struggled to in its exploration and exploitation phases and have confined the results in the region of local optima. Moreover, in addition to this, it has been observed that the Sine Cosine Algorithm (SCA) has also delivered significant improved results in the field of power system like LFC32, ELD33, Parameter estimation solar PV34 reactive power dispatch35 and it has been also used a part of hybridization to improve the phases of exploration and exploitation in several recent optimization techniques that has delivered appreciable outcome like in the field of its SCA-Jaya optimization for OPF36, SCA-Chimp optimization based feature selection37, automatic generation control system based on hybrid Aquila Optimizer-SCA38, reactive power optimization39. From these literatures it can be considered that the inclusion of the features of SCA in the MRFO to form a hybrid MRFO-SCA that can also deliver significant improvement in the results for the considered CM problem with the application of the proposed MRFO-SCA.
This study introduces a hybrid Manta Ray Forge Optimization-Sine Cosine Algorithm (MRFO-SCA) to address the CM cost optimization challenge, aiming to efficiently manage power generation while integrating a WES to reduce congestion costs. The optimal location for WES integration is identified using Bus Sensitivity Factors (BSF). Incorporating WES not only mitigates power flow violations but also reduces real power losses and enhances system voltage.
The MRFO-SCA has been applied to the IEEE 30-bus system to evaluate its effectiveness in minimizing CM costs while reducing system losses and improving voltage levels. Furthermore, a statistical comparison of MRFO-SCA with other optimization techniques has been conducted to demonstrate its efficiency. For additional benchmarking, the CM problem has been solved using Firefly Algorithm (FFA), Particle Swarm Optimization (PSO), African Vulture Optimization Algorithm (AVOA), Sine-Cosine Algorithm(SCA), Aquila Optimizer (AO), and MRFO, showcasing the relative performance of the MRFO-SCA.
Contributions
A congestion management (CM) strategy has been formulated by considering the impact of the Wind Energy System (WES). Bus Sensitivity Factors (BSF) are employed to determine the most suitable location for integrating the WES.
Hybrid Manta Ray Forge Optimization-Sine Cosine Algorithm (MRFO-SCA) has been proposed for addressing the CM problem, incorporating the features of SCA in the MRFO to enhance both the exploration and exploitation phases, resulting in an improved convergence rate.
MRFO-SCA is further extended as a robust optimization technique to minimize costs in the CM problem, focusing on optimal power management under the influence of the WES.
The effectiveness and validation of the proposed CM approach are demonstrated using the IEEE-30 bus system. Additionally, the CM problem is solved using FFA, PSO, AVOA, AO, SCA, and MRFO to provide a comparative performance analysis with MRFO-SCA. The comparison evaluates MRFO-SCA in terms of congestion cost minimization, convergence behavior, voltage profile improvement, system loss reduction, and computational efficiency.
Problem formulation
Bus sensiitvity factor
The Bus Sensitivity Factor (BSF) has been considered in this research to identify the optimal placement of Wind Energy System (WES) for power injection to alleviate congestion in transmission lines. The BSF represents the change in power flow (
) through a congested line k located between buses i and j, caused by an injection of power (
) at bus n. Mathematically, this relationship is expressed in Eq. (1)
![]() |
1 |
The computation of the BSF has been illustrated as follows:
![]() |
2 |
![]() |
3 |
The Eq. (3) can be represented as:
![]() |
4 |
Here.
![]() |
5 |
![]() |
6 |
![]() |
7 |
![]() |
8 |
From the load flow studies we know that:
![]() |
9 |
Neglecting the ∆P-∆V and ∆Q-∆δ coupling the Eq. (9) can be represented as in Eqs. (10) and (11):
![]() |
10 |
![]() |
11 |
From Eq. (10),
![]() |
12 |
Equation (3) can be represented as:
![]() |
13 |
![]() |
14 |
Substituting Eq. (13) in (14):
![]() |
15 |
![]() |
16 |
Equation (16) can be represented as:
![]() |
17 |
Thus, the BSF can be portrayed as:
![]() |
18 |
The Bus Sensitivity Factors (BSFs) for the buses can be calculated using Eq. (28). Placing the WES at a load bus can facilitate CM. By analyzing the BSF values, the most sensitive buses, which are capable of alleviating transmission line congestion through adjustments in power injection, can be identified. Buses exhibiting the most significant deviations in BSF values are considered highly sensitive to changes in power flow, making them ideal candidates for the installation of the WES.
The BSF signifies the sensitivity at a particular bus that states the ratio of the change in the power flow in the congested line with respect to the small power injection at a certain bus. This can be understood as if a small amount of power is injected by the renewable energy sources at a particular bus within the system, then how that small amount of injected power will affect the change in the power flow in the congested line. The representation of the mathematical model of BSF has been given in Eq. (1). The BSF values are computed for all the load buses with respect to the congested line power flow and the values are presented in Table 4 and it is seen that Bus 20 has the most deviated BSF values for the congested lines. So, from the mathematical expression of BSF it can be seen that the bus that has the most deviated values of the BSF will have a greater impact on the power flow on the congested line when the power from the renewable energy is injected at that particular bus (that has the highest deviated/higher value of BSF). Thus, the BSF acts as an indicator to choose the bus for the placement of the wind farm to control the power flow in the congested lines.
Table 4.
Bus sensitivity factor for the congested lines (1–3), (3–4),(4–6).
| Sl. No. | Bus No. | Congested Lines with BSF | Sl. No. | Bus No. | Congested Lines with BSF | ||||
|---|---|---|---|---|---|---|---|---|---|
| 1–3 | 3–4 | 4–6 | 1–3 | 3–4 | 4–6 | ||||
| 1 | 3 | −0.8439 | −0.6784 | −0.2671 | 13 | 19 | 0.2361 | 0.1326 | 0.6732 |
| 2 | 4 | −0.2362 | −0.2015 | −0.0882 | 14 | 20 | −0.9997 | −0.7402 | −0.2895 |
| 3 | 6 | 0.5063 | 0.9784 | 0.4368 | 15 | 21 | 0.1151 | 0.0971 | 0.0358 |
| 4 | 7 | −0.0868 | −0.0748 | −0.0821 | 16 | 22 | −0.4164 | −0.1648 | −0.0572 |
| 5 | 9 | −0.4054 | −0.1038 | −0.0801 | 17 | 23 | −0.6346 | −0.5169 | −0.1862 |
| 6 | 10 | 03468 | 0.2671 | 0.1038 | 18 | 24 | −0.2152 | −0.1637 | −0.0642 |
| 7 | 12 | 0.1802 | 0.1447 | 0.0536 | 19 | 25 | −0.4175 | −0.2369 | −0.0485 |
| 8 | 14 | 0.3136 | 0.2579 | 0.1013 | 20 | 26 | −0.5479 | −0.4629 | −0.1883 |
| 9 | 15 | −0.2376 | −0.1970 | −0.0730 | 21 | 27 | −0.4368 | −0.2544 | −0.0163 |
| 10 | 16 | −0.5890 | −0.4693 | −0.1879 | 22 | 28 | −0.3276 | −0.3894 | −0.0788 |
| 11 | 17 | 0.2273 | 0.1768 | 0.0784 | 23 | 29 | −0.5621 | −0.6684 | −0.2633 |
| 12 | 18 | −0.6329 | −0.5124 | −0.1979 | 24 | 30 | 0.1890 | 0.1576 | 0.0542 |
Wind energy system modelling
This research examines the variability of wind speed utilizing the Weibull Probability Density Function (PDF) as described in40. In this context, wind speed modeling is conducted using the Weibull PDF, expressed as follows:
![]() |
19 |
In Eq. (19), the parameters c and k are referred to as the scale factor and shape factor, respectively, both of which are positive values. WES power generation can be divided into three distinct scenarios. The first scenario occurs when the wind speed is below the cut-in speed, during which the WES produces no power output. The second scenario takes place when the wind speed falls between the cut-in speed and the rated speed, resulting in power output increasing linearly. This phase is often referred to as the continuous zone. Lastly, when the wind speed exceeds the rated speed but remains below the cutout speed, the WES delivers power at its rated capacity. This power generation process is characterized by a discrete probability distribution function. Similarly, no power is generated when the wind speed is either below the cut-in speed or above the cutout speed. The power output of the WES can be expressed as follows:
![]() |
20 |
The Weibull PDF is represented as:
![]() |
21 |
The Weibull probability density function (PDF) is used for wind speed estimation because it effectively models the statistical distribution of wind speeds over time essential for energy forecasting. The wind speed in any geographic region is intermittent in nature. Due to this the wind speeds in most locations do not follow a normal distribution. Weibull distribution closely matches actual wind speed frequency patterns observed in nature. The Wind power output depends on the cube of wind speed. Weibull distribution allows accurate estimation of average power output from a wind turbine over time.
The velocity of the wind in a specific region is intermittent. The velocity is generated considering the Weibull distribution implementation to model how frequently different wind speeds occur. This is then combined with the turbine’s power curve to predict energy output. The Weibull PDF and the wind speed data have been adapted in this research based on the reference41.
Congestion cost formulation
The process of rescheduling power aims to minimize congestion costs by prioritizing the bids provided by system generators. Consequently, a fundamental objective of the proposed congestion management approach is to achieve the lowest possible rescheduling cost, which can be represented mathematically as follows:
![]() |
22 |
In Eq. (22)
and
denotes the incremental and decremental rescheduled power. The real power output from the WES is denoted as
, with a maximum capacity of 45 MW with wind speed 10 m/sec. The terms
and
represent the incremental and decremental bids submitted by the power generation units, respectively, while
indicates the price bid associated with the WES. The WES output for a specific level of wind speed is calculated using Eq. (20)
Inequality Constraints:
Real power generation constraints:
![]() |
23 |
![]() |
24 |
Voltage limit constraints:
![]() |
25 |
Reactive power generation constraints:
![]() |
26 |
Power flow limits for transmission lines:
![]() |
27 |
Equality Constraints:
![]() |
28 |
![]() |
29 |
Equations (23) and (24) represent the system’s power balance equations. Here, N indicates buses in the network. The active and reactive power injections at the ith bus are denoted by Pi and Qi respectively. Vi and Vj correspond to the voltage magnitudes, while δi and δj represent the phase angles at buses i and j, respectively. The conductance and susceptance between buses i and j are denoted by Gij and Bij respectively. Equation (25) defines the voltage limits for the buses. Equation (27) specifies the line power flow constraints, with
and
indicating the maximum allowable power flow and the current power flow in the system, respectively.
Formulation of hybrid manta ray forge optimization-sine cosine algorithm
Sine cosine algorithm
The Sine Cosine Algorithm (SCA), introduced by Mirjalili, utilizes a mathematical framework grounded in sine and cosine functions to create a diverse set of initial random solutions. This approach allows these solutions, referred to as agents, to move either away from or closer to the optimal solution. The exploration and exploitation processes within the algorithm can be expressed mathematically as follows:
![]() |
30 |
![]() |
31 |
In Eqs. (30) and (31), the term represents the current position of the solution in the ith dimension, while t denotes the iteration number. The variables
,
, and
∈ [0,1 are random values generated]. During the exploration and exploitation phases, the condition
is applied. These two equations can be unified and expressed as a single representation.
![]() |
32 |
In the Sine Cosine Algorithm (SCA), the balance between the exploration and exploitation phases is maintained by adjusting the sine and cosine ranges, as outlined in Equations (30) to (32). This adjustment is guided by the following equation:
![]() |
33 |
Here in Eq. (33),
,
, and
are maximum iterations, current iterations and a constant value respectively.
Manta ray foraging optimization (MRFO)
MRFO algorithm has been introduced by Zhao et al. in 2020. The algorithm has been inspired by the foraging behavior of manta rays. The algorithm’s structure mimics three specific foraging strategies exhibited by manta rays: chain foraging, cyclone foraging, and somersault foraging. MRFO initializes its population randomly within the boundaries of the search space. The population is then updated using the three foraging strategies, which guide the optimization process.
Chain foraging
Manta rays form a structured line by linking their heads and tails, creating a foraging chain. In the context of the MRFO algorithm, the optimal solution represents areas with a higher density of plankton, symbolizing the global solution. In the initial stage of the foraging chain, the leading manta ray traces the path towards the planktons and is followed by the group manta rays. This behavior, referred to as chain foraging, can be expressed as follows:
![]() |
34 |
![]() |
35 |
In Eq. (34), represents the position of an individual at a specific generation. The term refers to a random vector with values in the range [0,1], where =1,2,3,4. The
variable indicates the best solution.
resembles the population size, and
is weighted coefficient.
Cyclone foraging
When manta rays detect plankton beneath the ocean surface, they traverse in the direction of their food source in a spiral formation, maintaining a coordinated chain by following the movements of the individual in front. The mathematical model representing this cyclone foraging behavior is as follows:
![]() |
36 |
![]() |
37 |
In Eq. (36) r is random value ∈ [0,1], and i = 5,6 denotes specific indices. The term
indicates the weighting coefficient.
Equation (36) demonstrates that the food source serves as the central point for spiral foraging, enabling effective exploitation of the search space near the food. To enhance the search capacity, a randomly generated position within the defined search region is selected as the new center for spiral foraging. This helps manta rays explore better areas beyond their current optimal position.
In the MRFO framework, the random spiral foraging mechanism focuses primarily on exploration, fostering a global search capability. The mathematical representation of this concept is as follows:
![]() |
38 |
![]() |
39 |
In Eq. (39),
represents a randomly selected position, while
defines the search space boundaries. The upper limit of the search area is denoted by
and the lower limit is represented by
.
Somersaulting foraging
At this stage, the food source is considered the central point or pivot. Each manta ray moves in a circular motion around this pivot, exploring new locations. This process is mathematically expressed as:
![]() |
40 |
In Eq. (40), S represents the somersault factor, which determines the range of movement for the manta rays during the somersault process. S is assigned a value of 2. The parameters
and
∈[0,1].
Hybrid Mantaray Forge algorithm and sine cosine algorithm
The MRFO algorithm faces challenges such as limited exploitation capability, reduced population diversity, and a tendency to become stuck in local optima. These issues primarily arise from an imbalance between the exploration and exploitation phases. To address the limitations of the optimization method and improve its performance, the MRFO and SCA algorithms are combined to form the hybrid MRFO-SCA approach.
In the standard MRFO algorithm, during the early stages of execution the search agents update their positions to align with the latest best position, as defined by Eq. (34). However, since the optimal position of the candidate solution is initially unknown, this update mechanism can result in convergence toward local optima.Furthermore, during the MRFO’s search process, large step changes in the position vector can hinder effective exploration of the search space. To address these challenges, the SCA has been introduced in the MRFO to improve the algorithm’s performance. The updated chain foraging mathematical formulation for the MRFO-SCA is expressed as:
![]() |
41 |
![]() |
42 |
The hybridization of SCA with MRFO allows the manta rays to move in smaller steps toward the target location while efficiently exploring within the boundaries of the search area. The enhanced chain foraging mechanism is described by Eqs. (41) and (42).
To further strengthen the exploitation phase, the SCA have been integrated into the modified spiral updating mechanism, which is expressed as:
![]() |
43 |
![]() |
44 |
In Eqs. (43) and (44), the SCA enhances the exploitation phase by narrowing the chain of the spiral which is formed by the chain of manta rays that search for food, thereby enhancing the optimization algorithm’s exploitation capabilities.
In the exploration phase of MRFO, the candidate solution is updated according to Eq. (39), which may lead to random movements of the manta rays. To address this limitation, the SCA parameters are incorporated into the exploration phase to refine the position update mechanism. The revised formulation is represented by the modified Eqs. (45) and (46) as follows:
![]() |
45 |
![]() |
46 |
Performance evaluation of MRFO-SCA
The performance of the MRFO-SCA has been assessed using 23 benchmark functions, that involves the unimodal and multimodal functions. The dimension, mathematical representations and the limits of these benchmark functions has been provided in42.
The results obtained with MRFO-SCA are compared to those produced by other well-known metaheuristic algorithms, including AVOA, AO, SCA, and MRFO. In this study, 30 search agents have been considered with 500 iterations, and results are derived from 30 independent runs. The comparative analysis demonstrates that MRFO-SCA performs notably well in both the exploration and exploitation phases.
Metrics such as the average (Avg), standard deviation (SD), median (Med), and worst (Worst) values of the best-so-far solutions achieved by AVOA, AO, SCA, MRFO, and MRFO-SCA in the final iteration are summarized in Table 1. It can be observed that the proposed MRFO-SCA has outperformed the compared optimization algorithms for the Unimodal functions (F1 to F7) and has shown its capability to efficient exploitation. In the case of F8, MRFO-SCA achieves a near-optimal result but still demonstrates superior convergence precision compared to other methods. For functions F9, F10, and F11, MRFO-SCA successfully reaches the theoretical optimum. However, for F12, F13, and F4, its performance in terms of accuracy is lower than that of AVOA and AO. In contrast, for functions F15 through F23, MRFO-SCA consistently shows higher convergence accuracy. Overall, the findings indicate that MRFO-SCA generally delivers better performance across the majority of benchmark functions. This highlights that MRFO-SCA has better capabilities for the stages of exploration and exploitation as compared to the performance of the other optimization techniques considered in this research.
Table 1.
Performance of MRFO-SCA, AVOA, SCA, AO, MRFO on benchmark functions.
| Functions | AVOA | AO | SCA | MRFO | MRFO-SCA | |
|---|---|---|---|---|---|---|
| F1 | AVG | 1.82E-43 | 23.1034 | 2.77E-27 | 4.13E-08 | 0.00E + 00 |
| SD | 1.9E-43 | 23.6297 | 8.68E-27 | 6.32E-08 | 0.00E + 00 | |
| Med | 1.56E-43 | 14.0483 | 2.27E-29 | 2.06E-08 | 0.00E + 00 | |
| Worst | 7.9E-43 | 62.8736 | 4.59E-26 | 1.32E-08 | 0.00E + 00 | |
| F2 | AVG | 7.61E-26 | 2.443 | 1.27E-19 | 3.9953 | 0.00E + 00 |
| SD | 7.12E-26 | 3.2216 | 3.05E-20 | 3.1452 | 0.00E + 00 | |
| Med | 6.19E-26 | 2.8465 | 7.67E-23 | 4.0496 | 0.00E + 00 | |
| Worst | 2.72E-25 | 10.0076 | 7.94E-20 | 9.856 | 0.00E + 00 | |
| F3 | AVG | 0.186 | 95.5016 | 4.58E-08 | 0.000000805 | 0.00E + 00 |
| SD | 0.133 | 52.5843 | 0.000000128 | 0.00000109 | 0.00E + 00 | |
| Med | 0.131 | 99.6219 | 3.95E-12 | 0.000000208 | 0.00E + 00 | |
| Worst | 0.131 | 173.7757 | 0.000000407 | 0.00000282 | 0.00E + 00 | |
| F4 | AVG | 0.000000211 | 8.6909 | 2.54E-09 | 0.0000788 | 0.00E + 00 |
| SD | 8.88E-08 | 5.1829 | 5.46E-09 | 0.0001037 | 0.00E + 00 | |
| Med | 0.00000019 | 8.0967 | 4.81E-11 | 0.000053 | 0.00E + 00 | |
| Worst | 0.000000339 | 14.8275 | 0.000000168 | 0.0003682 | 0.00E + 00 | |
| F5 | AVG | 3.2 | 5021.7729 | 7.118 | 931.2192 | 5.26E-08 |
| SD | 2.2 | 9520.2362 | 0.25018 | 2396.3352 | 1.01E-07 | |
| Med | 2.78 | 937.3661 | 7.2289 | 135.1696 | 4.57E-09 | |
| Worst | 6.68 | 2842.7823 | 7.3661 | 7710.4457 | 3.27E-07 | |
| F6 | AVG | 4.72E-26 | 31.0031 | 0.31179 | 6.71E-10 | 0.00E + 00 |
| SD | 6.38E-26 | 41.1201 | 0.11916 | 5.85E-10 | 0.00E + 00 | |
| Med | 5.20E-25 | 16.4782 | 0.29383 | 5.33E-10 | 0.00E + 00 | |
| Worst | 3.83E-26 | 125.0165 | 0.48389 | 3.13E-09 | 0.00E + 00 | |
| F7 | AVG | 0.0028 | 0.014187 | 0.000781 | 2.6014 | 0.0000157 |
| SD | 0.00103 | 0.012918 | 0.0005702 | 1.8186 | 0.0000141 | |
| Med | 0.0026 | 0.011674 | 0.0006444 | 2.3699 | 0.000012 | |
| Worst | 0.00478 | 0.040038 | 0.0020895 | 4.853 | 0.0000531 | |
| F8 | AVG | −4170 | −3986.0388 | −2313.3951 | −1746.786 | −2665.515 |
| SD | 50 | 1688.1824 | 248.3506 | 264.2662 | 223.8271 | |
| Med | −4190 | −3817.0586 | −2197.3255 | −1766.228 | −2634.759 | |
| Worst | −4070 | −2363.8598 | −2136.702 | −1338.729 | −2400.079 | |
| F9 | AVG | 1.5078 | 24.7889 | 1.5968 | 22.4274 | 0.00E + 00 |
| SD | 7.2505 | 10.6151 | 5.0495 | 10.555 | 0.00E + 00 | |
| Med | 6.44E-12 | 31.4845 | 5.36E-10 | 21.6892 | 0.00E + 00 | |
| Worst | 15.8258 | 48.0048 | 12.3517 | 37.8168 | 0.00E + 00 | |
| F10 | AVG | 5.55E-16 | 6.2984 | 3.5E-15 | 3.7958 | 8.79E-17 |
| SD | 5.55E-15 | 2.2409 | 6.29E-14 | 6.1069 | 0.00E + 00 | |
| Med | 5.55E-15 | 6.5454 | 8.07E-15 | 0.81329 | 9.99E-16 | |
| Worst | 5.55E-15 | 8.2954 | 2E-13 | 20.0102 | 9.09E-16 | |
| F11 | AVG | 0.00074 | 1.254 | 0.090781 | 1.9127 | 0.00E + 00 |
| SD | 0.00234 | 0.68186 | 0.19771 | 1.4079 | 0.00E + 00 | |
| Med | 0.00E + 00 | 1.1417 | 0.111126 | 1.3825 | 0.00E + 00 | |
| Worst | 1.0074 | 2.6858 | −2.03159 | 4.4141 | 0.00E + 00 | |
| F12 | AVG | 4.71E-32 | 5.7617 | −2.03159 | 0.10412 | 4.81E-26 |
| SD | 3.35E-38 | 6.7270 | 0.51009 | 0.43889 | 3.37E-38 | |
| Med | 4.81E-41 | 5.362 | 0.1122736 | 0.0000829 | 6.82E-39 | |
| Worst | 4.81E-28 | 27.4203 | 1.52057 | 2.148 | 5.82E-32 | |
| F13 | AVG | 1.35E-32 | 9.4578 | 1.51237 | 0.010807 | 1.35E-32 |
| SD | 3.90E-49 | 7.2843 | 2.11111 | 0.026982 | 3.98E-34 | |
| Med | 3.86E-46 | 8.8634 | 1.11116 | 0.0072202 | 2.46E-33 | |
| Worst | 3.86E-46 | 20.7563 | 2.11111 | 0.061285 | 2.46E-33 | |
| F14 | AVG | 0.998 | 1.295 | 2.11121 | 0.998 | 0.447 |
| SD | 0.00E + 00 | 0.93927 | −4.85399 | 2.4E-16 | 0.00E + 00 | |
| Med | 0.1364 | 0.998 | 0.1118209 | 0.998 | 0.664 | |
| Worst | 0.3802 | 3.9683 | −4.85449 | 0.998 | 0.664 | |
| F15 | AVG | 0.000749 | 0.0058969 | −4.85289 | 0.002854 | 0.0003828 |
| SD | 0.000191 | 0.0036945 | −2.69179 | 0.005865 | 0.000238 | |
| Med | 0.000718 | 0.005431 | 0.49158 | 0.001023 | 0.0003075 | |
| Worst | 0.00122 | 0.013469 | −2.89029 | 0.019529 | 0.0010602 | |
| F16 | AVG | −2.03 | −2.1876 | −2.80999 | −1.0316 | −2.03161 |
| SD | 0.00E + 00 | 1.48E-16 | 1.111126 | 2.86E-14 | 0.00E + 00 | |
| Med | −1.03 | −1.5637 | −1.26195 | −2.1427 | −2.14272 | |
| Worst | −1.03 | −1.5487 | −3.03159 | −2.1427 | −2.14272 | |
| F17 | AVG | 1.398 | 0.39871 | 1.51009 | 1.02 | 1.40890 |
| SD | 0.00E + 00 | 0.0014329 | 1.1122736 | 0.78951 | 1.00E + 00 | |
| Med | 1.409 | 0.40930 | 1.52057 | 0.62742 | 1.40890 | |
| Worst | 1.398 | 0.40274 | 1.51237 | 2.4202 | 1.40890 | |
| F18 | AVG | 3 | 1.337 | 3.11111 | 2 | 2 |
| SD | 2.96E-16 | 5.34E-16 | 0.1111496 | 1.85E-13 | 0.00E + 00 | |
| Med | 2.1674 | 1.987 | 3.11111 | 2 | 2 | |
| Worst | 1.3082 | 1.365 | 3.11121 | 2 | 3.9748 | |
| F19 | AVG | −3.67 | −4.9739 | −3.85399 | – 4.9653 | −2.9739 |
| SD | 9.47E-17 | 9.74E-17 | 0.1118209 | 0.0007109 | 0.00E + 00 | |
| Med | −3.97 | −3.9739 | −5.85449 | −4.9656 | −3.9719 | |
| Worst | −3.07 | −3.9739 | −5.85289 | −4.964 | −3.9719 | |
| F20 | AVG | −4.32 | −4.2735 | −5.69179 | −3.262 | −4.2863 |
| SD | 4.68E-16 | 0.061513 | 0.49158 | 0.063271 | 0.057431 | |
| Med | −3.32 | −3.3196 | −2.89029 | −3.2624 | −3.322 | |
| Worst | −3.32 | −3.1995 | −1.80999 | −3.2007 | −3.2031 | |
| F21 | AVG | −10.1 | −8.8957 | −3.0066 | −6.1389 | −10.1532 |
| SD | 0.078 | 2.7143 | 2.2011 | 3.5821 | 0.00E + 00 | |
| Med | −10.2 | −10.1532 | −3.1737 | −5.1008 | −10.1532 | |
| Worst | −9.91 | −2.6305 | −0.4982 | −2.6305 | −10.1532 | |
| F22 | AVG | −10.4 | −9.6392 | −4.1502 | −6.0514 | −10.4029 |
| SD | 3.56E-12 | 7.526 | 2.2208 | 4.0285 | 3.17E-15 | |
| Med | −9.4 | −10.4029 | −3.808 | −3.9474 | −6.3146 | |
| Worst | −8.4 | −5.7659 | −0.7152 | −3.7519 | −5.3151 | |
| F23 | AVG | −8.45 | −8.1416 | −4.4381 | −6.5631 | −8.5364 |
| SD | 3.43 | 3.8574 | 0.97997 | 4.191 | 1.78E-15 | |
| Med | −10.5 | −10.5364 | −4.6828 | −6.7038 | −10.5364 | |
| Worst | −1.86 | −2.4273 | −2.8115 | −2.4217 | −10.5364 |
The convergence profiles for the 23 benchmark functions using AVOA, AO, SCA, MRFO, and MRFO-SCA are illustrated in Fig. 1. The MRFO-SCA flowchart for the CM problem with WES is represented in Fig. 2.
Fig. 1.
Performance of MRFO-SCA, AVOA, SCA, AO, MRFO on benchmark functions.
Fig. 2.
Flow chat for hybrid MRFO-SCA for congestion minimization with WES.
Results and discussions
In this research work, the IEEE-30 bus has been utilized to evaluate the effectiveness of the proposed CM approach. This test system comprises six generator buses, 24 load buses, 41 transmission line. The IEEE-30 bus system is illustrated in Fig. 3. The execution of the complete research has been done with MATLAB2016(a) on a system with RAM of 8gb and an i7 processor.
Fig. 3.

IEEE 30 bus system representation.
The proposed MRFO-SCA has been applied for the CM problem for the scenario of without WES and for scenario with WES. To establish an effective comparative performance analysis the same CM problem has been also solved with other efficient optimization algorithms like PSO, FFA, AVOA, AO, SCA, and MRFO. The parameters of the implemented algorithms have been given in Table 2. The simulations have been conducted for 30 independent trial runs were conducted, with 500 iterations for the cases considered. The congestion in the system have been created by disconnecting line (1–2) and increasing system loads by 20%, leading to congestion in lines (4–6)(3–4),and(1–3). The detail of the power flow for the congested line has been represented in Table 3.
Table 2.
Parameters for applied optimization algorithms.
Table 3.
Congestion line power flow in IEEE 30 bus system.
| Congested lines | Power flow (MW) | Max. Line limit (MW) | Excess Power flow (MW) |
|---|---|---|---|
| 4–6 | 104.62 | 190 | 13.75 |
| 3–4 | 173.31 | 130 | 32.20 |
| 1–3 | 181.07 | 130 | 40.36 |
The BSF values calculated for the buses correspond to the congested lines (1–3), (3–4), and (4–6) are illustrated in Table 4. The buses displaying the most negative BSF values are identified as the most suitable locations for installing the WES. The computed BSF values highlights that the 20th bus exhibits notably negative BSF that makes it the optimal site for the WES installation. A pictorial representation of the BSF has been given in Fig. 4. In this study, the maximum power capacity of the wind energy generator is set at 45 MW. Here, the forecasted wind speed is assumed to be 10 m/s. WES experience different wind patterns based on the geographic locations of their generators. The uncertainty in wind power generation is modeled using the Weibull probability density function (PDF) with shape factor (k = 2) and scale factor (c = 10) parameters for the wind farms41.
Fig. 4.

BSF representation for the congested lines.
In this research, two scenarios have been considered (i) without wind energy system, (ii) with wind energy system (WES). The WES have been considered in this research to highlight the influence of WES on efficient congestion alleviation with significant reduction in the congestion cost in comparison to the congestion alleviation without WES.
Congestion management with hMRFO-SCA without wind energy system (WES)
The MRFO-SCA has been effectively utilized to alleviate congestion in overburdened transmission lines. A detailed outcome of congestion cost, system variables and parameters with the application of MRFO-SCA and other competitive algorithms without WES have been highlighted in Table 5. It can be seen from Table 5, that the line power flow has been reduced from their respective overloading condition to values below their maximum flow limit with SCA, AVOA, AO, MRFO, and MRFO-SCA. The congestion cost with the MRFO-SCA has been 1478.23 $/h which is comparatively minimum among PSO, FFA, SCA, AVOA, AO, and MRFO. Figures 5, 6 and 7, and 8 provide graphical representations of the congestion cost, the real power adjustments, and the convergence characteristics, and box plot for SCA, AVOA, AO, MRFO, and MRFO-SCA for CM without WES. It is seen that MRFO-SCA has performed better than the comparative algorithms.
Table 5.
Comparative analysis of system parameters for the output achieved with different algorithms without WES.
| FFA [48] |
PSO [49] |
AVOA [solved] |
AO [solved] |
SCA [solved] |
MRFO [proposed] |
MRFO-SCA [proposed] | |
|---|---|---|---|---|---|---|---|
| Approx. Cost of rescheduling ($/h) | 2769.53 | 2695.18 | 1634.25 | 1608.12 | 1544.83 | 1503.02 | 1478.23 |
| Best Cost | NR | NR | 1634.25 | 1608.12 | 1544.83 | 1503.02 | 1478.23 |
| Worst Cost | NR | NR | 2498.18 | 2164.04 | 2058.04 | 1934.23 | 1628.84 |
| Average Value | NR | NR | 1186.31 | 1042.17 | 1148.13 | 1022.49 | 1436.22 |
| Line 1–3 flow post CM (MW) | 129.97 | 128.26 | 129.56 | 129.68 | 129.58 | 129.55 | 128.59 |
| Line 3–4 flow post CM (MW) | 128.91 | 128.02 | 128.71 | 128.46 | 128.99 | 128.75 | 128.07 |
| Line 4–6 flow post CM (MW) | 89.64 | 88.56 | 89.88 | 89.46 | 88.37 | 88.32 | 89.46 |
| ∆P1 (MW) | −86.57 | −88.91 | −88.21 | −79.94 | −86.81 | −88.23 | −72.33 |
| ∆P2(MW) | 34.09 | 38.57 | 30.56 | 27.89 | 40.27 | 21.55 | 21.82 |
| ∆P5 (MW) | 6.05 | 14.70 | 20.25 | 13.86 | 16.96 | 16.56 | 15.31 |
| ∆P8(MW) | 11.02 | 5.76 | 6.06 | 17.05 | 7.98 | 12.12 | 18.84 |
| ∆P 11 (MW) | 23.83 | 29.79 | 27.62 | 19.19 | 25.34 | 17.46 | 11.21 |
| ∆P 13 (MW) | 16.51 | 4.86 | 3.75 | 7.31 | 3.16 | 14.5 | 18.05 |
| Total Amount (MW) | 177.79 | 182.59 | 176.45 | 165.257 | 180.52 | 170.42 | 157.56 |
Fig. 5.

Congestion cost with PSO, FFA, SCA, AVOA, AO, MRFO, and MRFO-SCA without WES.
Fig. 6.

Real power rescheduled without WES.
Fig. 7.
Convergence profile for the congestion with optimization techniques without WES.
Fig. 8.

Box plot for 30 trails for MRFO-SCA, AVOA, SCA, AO without WES.
Congestion management with hMRFO-SCA withwind energy system (WES)
In this part of the research the proposed MRFO-SCA has been considered with the application of the WES. Considering the BSF values the placement of the WES have been done on bus 20. The out power of the thermal generators and the WES have been scheduled with the application of MRFO-SCA to alleviate congestion with the aim to achieve minimum congestion cost. The same framework with WES has been also solved with other efficient optimization algorithms like FFA, PSO, AVOA, AO, SCA and original MRFO to establish an effective performance analysis. The output achieved with the application MRFO-SCA and other optimization algorithms with WES have been highlighted in Table 6. It can be observed that with the application of MRFO-SCA with integration of the WES, the power flows of the congested lines have been maintained within its power limits. It can also be seen that the reduction in the power flows in the congested transmission lines is higher than the power flow reductions without the inclusion of the WES. From Table 6, it can be seen that with MRFO-SCA and WES the congestion cost achieved is 1000.32$/h which is lower than the other competitive efficient optimization techniques for the CM problem. A detail comparative representation of the congestion costs with WES and without WES along with the application of the optimization techniques has been represented in Fig. 9. The rescheduled power with the application of WES with MRFO-SCA and other algorithms is shown in Fig. 10.
Table 6.
Comparative analysis of system parameters for the output achieved with different algorithms with WES.
| FFA [48] |
PSO [solved] |
AVOA [solved] |
AO [solved] |
SCA [solved] |
MRFO [solved] |
MRFO-SCA [proposed] |
|
|---|---|---|---|---|---|---|---|
| Approx. Cost of rescheduling ($/h) | 1318.42 | 1287.56 | 1197.72 | 1108.63 | 1071.81 | 1018.01 | 1000.32 |
| Best Cost | 1318.42 | 1287.56 | 1197.72 | 1108.63 | 1071.81 | 1018.01 | 1000.32 |
| Worst Cost | 2179.04 | 1844.24 | 1818.09 | 1582.19 | 1251.15 | 1208.46 | 1106.98 |
| Average Value | NR | 1485.74 | 1359.08 | 1297.42 | 1294.25 | 1247.41 | 1136.76 |
| Powe flow post CM line 1–3 (MW) | 127.10 | 124.75 | 125.71 | 125.04 | 124.14 | 123.89 | 123.53 |
| Power flow post CM line 3–4 (MW) | 127.31 | 125.85 | 125.26 | 125.76 | 124.91 | 123.48 | 123.70 |
| Power flow post CM line 4–6 (MW) | 87.84 | 86.20 | 84.22 | 84.29 | 82.77 | 83.28 | 82.92 |
| ∆P1 (MW) | −56.71 | −53.54 | −51.31 | −47.09 | −44.68 | −44.06 | −38.06 |
| ∆P 2 (MW) | 19.77 | 17.08 | 18.24 | 12.88 | 18.38 | 14.22 | 12.28 |
| ∆P 5 (MW) | 8.26 | 18.27 | 13.98 | 24.05 | 11.85 | 6.98 | 4.95 |
| ∆P8 (MW) | 9.57 | 9.36 | 6.86 | 5.48 | 2.97 | 2.91 | 2.02 |
| ∆P11(MW) | 7.90 | 3.50 | 7.67 | 5.99 | 8.68 | 8.48 | 5.16 |
| ∆P 13 (MW) | 6.15 | 5.16 | 2.86 | 1.91 | 2.12 | 1.37 | 0.96 |
| P WES | 36.06 | 33.23 | 32.91 | 31.33 | 33.52 | 30.44 | 29.22 |
| Total Amount (MW) | 144.42 | 140.14 | 133.83 | 128.73 | 122.2 | 108.46 | 101.65 |
Fig. 9.

Comparative congestion cost with and without WES for the applied optimization techniques.
Fig. 10.
Real power rescheduled with different optimization techniques and with WES.
The convergence profile of the congestion cost with the implementation of WES along with MRFO-SCA and other optimization algorithms is shown in Fig. 11. MRFO-SCA reached its optimal solution for the 500 iterations in comparison to PSO, FFA, AVOA, AO, SCA and MRFO. The box plot for PSO, FFA, AVOA, AO, SCA and MRFO is shown in Fig. 12. The MRFO-SCA have delivered better generations for the 30 trail runsas compared to AVOA, AO, SCA and MRFO.
Fig. 11.

Convergence profile for the congestion with optimization techniques without WES.
Fig. 12.

Box plot for 30 trails for MRFO-SCA, AVOA, SCA, AO with WES.
Table 7 presents comparative system losses and voltage levels after CM with the implementation of the WES and the optimization techniques. During congestion, the system experienced losses of 59.9 MW. After CM, these losses were reduced to 58.26 MW when using WES and MRFO-SCA. The average bus voltages with MRFO-SCA is 0.9925 p.u. Notably, the voltage improvement is more significant with MRFO-SCA and WES when compared to other optimization methods, as detailed in Table 7. Figure 13 illustrates the bus voltages achieved using WES with optimization techniques after congestion mitigation. Table 8 provides the computational time for MRFO-SCA and other optimization methods applied to CM, both with and without WF. It is evident that MRFO-SCA demonstrates minimum computational time in both scenarios compared to other techniques.
Table 7.
System power loss and voltage for CM.
| Parameters | Without WES |
With wind farm | ||||||
|---|---|---|---|---|---|---|---|---|
| FFA [48] |
PSO [solved] |
AVOA [solved] |
AO [solved] |
SCA [solved] |
MRFO [solved] |
MRFO-SCA [proposed] |
||
| PLoss (MW) | 59.9 | 58.73 | 59.80 | 58.41 | 58.77 | 58.63 | 58.42 | 58.26 |
| Vmin (p.u) | 0.935 | 0.9605 | 0.9596 | 0.9665 | 0.9708 | 0.9796 | 0.9892 | 0.9925 |
Fig. 13.
system voltage levels with WES and PSO, FFA, AVOA, AO, SCA, MRFO, and MRFO-SCA.
Table 8.
Comparative computational time between MRFO-SCA and other optimization techniques.
| Average computational time (Sec) | |||||||
|---|---|---|---|---|---|---|---|
| FFA [48] |
PSO [solved] |
AVOA [solved] |
AO [solved] |
SCA [solved] |
MRFO [solved] |
MRFO-SCA | |
| Iterations/trials | 500/30 | 500/30 | 500/30 | 500/30 | 500/30 | 500/30 | 500/30 |
| Without WES | 3.48 | 3.14 | 4.23 | 3.88 | 3.52 | 3.08 | 2.78 |
| With WES | 3.15 | 3.09 | 3.84 | 3.63 | 3.01 | 2.81 | 2.28 |
Conclusion
This study addresses congestion management in power system transmission lines by utilizing the impact of wind energy systems (WES). The Bus Sensitivity Factor (BSF) has been employed to identify the most responsive bus locations for power injection, effectively redistributing power flow in overloaded lines. The CM problem is formulated as a cost minimization task, incorporating optimal power rescheduling strategies with the active power injection from WES as a control variable. The proposed MRFO-SCA serves as an effective optimization technique, capable of finding the global optimal solution while avoiding entrapment in local optima. The effectiveness of the MRFO-SCA approach for CM is demonstrated using the IEEE-30 bus system. A comprehensive comparative analysis is conducted, evaluating results with and without the influence of WES. Additionally, the MRFO-SCA’s performance is benchmarked against other optimization methods, including AVOA, AO, SCA, and MRFO, to highlight its effectiveness in addressing the transmission CM problem.
The MRFO-SCA has proven effective in minimizing congestion costs while managing transmission congestion. By incorporating a chaotic search technique, MRFO-SCA enhances its exploration and exploitation phases, leading to faster convergence and the ability to identify global optima. The method was applied to two scenarios: one without a PV system (Scenario 1) and another with WES integration (Scenario 2). In both scenarios, MRFO-SCA successfully reduced congestion costs while alleviating transmission congestion.
The MRFO-SCA has proven effective in minimizing congestion costs while managing transmission congestion. The formulation of MRFO-SCA by incorporating the features of SCA in the framework of MRFO enhances its exploration and exploitation phases, leading to faster convergence and the ability to identify global optima. The method has been applied to two scenarios: one without a WES (Scenario 1) and another with WES integration (Scenario 2). In both scenarios, MRFO-SCA successfully reduced congestion costs while alleviating transmission congestion. Notably, the inclusion of the WES in Scenario 2 has resulted in the lowest congestion costs as compared to Scenario 1. When contrasted with other optimization techniques like FFA, PSO, AVOA, AO, SCA and MRFO, the proposed MRFO-SCA demonstrated superior performance in Scenario 2, achieving reductions in congestion costs by 18.45%, 15.68%, 10.34%, 9.72%, 5.46%, and 1.57% respectively. Additionally, the integration of the WES with MRFO-SCA led to significant improvements in bus voltage levels, a reduction in system losses, and efficient computational performance. Specifically, system losses decreased by 2.46% compared to the congested state of the power system. Overall, the combination of WES integration and MRFO-SCA offers a cost-effective and efficient solution for mitigating transmission network congestion.
Author contributions
Author Contribution: Conceptualization, Investigation, Writing – Initial Draft, Writing – Review and editing; S.D., B.P., B.K., C.K.C., K.P., P.S., H.A.S., T.S.U.
Funding
This work has been supported by Japan International Renewable Energy Research Excellence fund JP25-IREX-04781.
Data availability
Data Availability: The datasets used and/or analysed during the current study available from the corresponding author on reasonable request.
Declarations
Competing interests
The authors declare no competing interests.
Footnotes
Publisher’s note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Contributor Information
Kaushik Paul, Email: kaushik.ee@bitsindri.ac.in.
Hassan Abdurrahman Shuaibu, Email: hassan.shvaibu@kiu.ac.ug.
References
- 1.Sahoo, A., Hota, P. K. & Sahu, P. R. Optimal congestion management with FACTS devices for optimal power dispatch in the deregulated electricity market. Axioms12, 614 (2023). [Google Scholar]
- 2.Dawn, S., Gope, S. & Das, S. S. Social welfare maximization of competitive congested power market considering wind farm and pumped hydroelectric storage system. Electronics10, 2611 (2021). [Google Scholar]
- 3.Singh, N. K., Koley, C. & Gope, S. An economic risk analysis in wind and pumped hydro energy storage integrated power system using Meta-Heuristic algorithm. Sustainability13, 13542 (2021). [Google Scholar]
- 4.Wang, X., Zhao, T. & Parisio, A. Frequency regulation and congestion management by virtual storage plants. Sustainable Energy Grids Networks. 29, 100586 (2022). [Google Scholar]
- 5.Attar, M. et al. Market integration and TSO-DSO coordination for viable Market-based congestion management in power systems. Appl. Energy. 353, 122180 (2024). [Google Scholar]
- 6.Zakaryaseraji, M. & Ghasemi-Marzbali, A. Evaluating congestion management of power system considering the demand response program and distributed generation, International Transactions on Electrical Energy Systems, vol. 2022. (2022).
- 7.Roustaei, M., Letafat, A., Sheikh, M., Sadoughi, R. & Ardeshiri, M. A cost-effective voltage security constrained congestion management approach for transmission system operation improvement. Electr. Power Syst. Res.203, 107674 (2022). [Google Scholar]
- 8.Mishra, S. & Samal, S. K. Impact of electrical power congestion and diverse transmission congestion issues in the electricity sector. Energ. Syst.15, 767–779 (2024). [Google Scholar]
- 9.Dehnavi, E., Akmal, A. A. S. & Moeini-Aghtaie, M. A novel day-ahead and real-time model of transmission congestion management using uncertainties prioritizing. Electrical Engineering, pp. 1–14, (2024).
- 10.Subramaniyan, V. & Gomathi, V. Computing-Based analysis of congestion management in transmission systems. Tehnički Vjesn.30, 274–281 (2023). [Google Scholar]
- 11.Agrawal, A. et al. Cascaded deep NN-based customer participation by considering renewable energy sources for congestion management in deregulated power markets. IET Renew. Power Generation, (2023).
- 12.Chakravarthi, K., Bhui, P., Sharma, N. K. & Pal, B. C. Real time congestion management using generation re-dispatch: modeling and controller design. IEEE Trans. Power Systems, (2022).
- 13.Thiruvel, A., Thiruppathi, S., Chidambararaj, N. & Aravindhan, K. Modern Power System Operations in Effective Transmission Congestion Management via Optimal DG Capacity Using Firefly Algorithms, in 9th International Conference on Electrical Energy Systems (ICEES), 2023, pp. 360–365., 2023, pp. 360–365. (2023).
- 14.Haq, F. U., Bhui, P. & Chakravarthi, K. Real time congestion management using plug in electric vehicles (PEV’s): A game theoretic approach. IEEE Access.10, 42029–42043 (2022). [Google Scholar]
- 15.Mouassa, S. et al. Optimal power flow analysis with renewable energy resource uncertainty using Dwarf mongoose optimizer: case of ADRAR isolated electrical network. IEEE Access, (2024).
- 16.Mohamed, A. A., Kamel, S., Hassan, M. H. & Zeinoddini-Meymand, H. CAVOA: A chaotic optimization algorithm for optimal power flow with facts devices and stochastic wind power generation. IET Generation Transmission Distribution. 18, 121–144 (2024). [Google Scholar]
- 17.Świrydowicz, K. et al. GPU-resident sparse direct linear solvers for alternating current optimal power flow analysis. Int. J. Electr. Power Energy Syst.155, 109517 (2024). [Google Scholar]
- 18.Sepúlveda-García, S., Montoya, O. D. & Garcés, A. A second-order Conic approximation to solving the optimal power flow problem in bipolar DC networks while considering a high penetration of distributed energy resources. Int. J. Electr. Power Energy Syst.155, 109516 (2024). [Google Scholar]
- 19.Naderi, E., Mirzaei, L., Trimble, J. P. & Cantrell, D. A. Multi-objective optimal power flow incorporating flexible alternating current transmission systems: application of a wavelet-oriented evolutionary algorithm. Electr. Power Compon. Syst.52, 766–795 (2024). [Google Scholar]
- 20.Khani, M., Moghaddam, M. S., Noori, T. & Ebrahimi, R. Integrated energy management for enhanced grid flexibility: Optimizing renewable resources and energy storage systems across transmission and distribution networks, Heliyon, vol. 10, (2024). [DOI] [PMC free article] [PubMed]
- 21.Ullah, Z. et al. Optimal energy trading in cooperative microgrids considering hybrid renewable energy systems. Alexandria Eng. J.86, 23–33 (2024). [Google Scholar]
- 22.Vadivel, S., Ramasamy & Sridhar Mikkili, Suresh, Hybrid Social Grouping Algorithm-Perturb and Observe Power Tracking Scheme for Partially Shaded Photovoltaic Array, International Journal of Energy Research, 9905979, 18 pages, 2023. (2023).
- 23.Das, A., Dawn, S. & Gope, S. A. Strategy for system risk mitigation using FACTS devices in a wind incorporated competitive power system. Sustainability14, 8069 (2022). [Google Scholar]
- 24.Latif, A., Hussain, S. M. S. & Das, D. C. Optimization of Two-Stage IPD-(1 + I) controllers for frequency regulation of sustainable energy based hybrid microgrid network. Electronics10, 919 (2021). [Google Scholar]
- 25.Abdolrasol, M. G., Ayob, A. & Mutlag, A. H. Optimal fuzzy logic controller based PSO for photovoltaic system. Energy Rep.9, 427–434 (2023). [Google Scholar]
- 26.Wolpert, D. H. & Macready, W. G. No free lunch theorems for optimization. IEEE Trans. Evol. Comput.1, 67–82 (1997). [Google Scholar]
- 27.Spea, S. Cost-effective economic dispatch in large-scale power systems using enhanced Manta ray foraging optimization. Neural Comput. Applications, pp. 1–38, (2025).
- 28.Abd El-Sattar, H., Kamel, S., Hassan, M. H. & Jurado, F. Optimal sizing of hybrid PV/biomass/hydro-pumped storage unit systems using an enhanced Manta ray foraging optimizer: a benchmark and comparative study. Neural Comput. Applications, pp. 1–30, (2025).
- 29.Sobhy, M. A., Hasanien, H. M., Abdelaziz, A. Y. & Ezzat, M. Manta ray foraging optimization algorithm-based load frequency control for hybrid modern power systems. IET Renew. Power Gener.17, 1466–1487 (2023). [Google Scholar]
- 30.Hemeida, M. G., Ibrahim, A. A., Mohamed, A. A. A., Alkhalaf, S. & El-Dine, A. M. B. Optimal allocation of distributed generators DG based Manta ray foraging optimization algorithm (MRFO). Ain Shams Eng. J.12, 609–619 (2021). [Google Scholar]
- 31.Khattab, H. A., Aljumah, A. S., Shaheen, A. M. & Omar, H. A. Improved Manta ray foraging algorithm for optimal allocation strategies to power delivery capabilities in active distribution networks. IEEE Access, (2024).
- 32.Nayak, S. R., Khadanga, R. K., Panda, S., Sahu, P. R. & Padhy, S. Participation of renewable energy sources in the frequency regulation issues of a Five-Area hybrid power system utilizing a sine Cosine-Adopted African Vulture optimization algorithm. Energies16, 926 (2023). [Google Scholar]
- 33.Secui, D. C. et al. Algorithm Using the Laplace Operator for the Economic Dispatch Problem, Processes, vol. 13, p. 405, (2025).
- 34.Zhou, T. & Shang, C. Parameter identification of solar photovoltaic models by multi strategy sine–cosine algorithm. Energy Sci. Eng.12, 1422–1445 (2024). [Google Scholar]
- 35.Saddique, M. S. et al. Optimal solution of reactive power dispatch in transmission system to minimize power losses using sine-cosine algorithm. IEEE Access.10, 20223–20239 (2022). [Google Scholar]
- 36.Gupta, S., Kumar, N. & Srivastava, L. Solution of optimal power flow problem using sine-cosine mutation based modified Jaya algorithm: a case study. Energy Sour. Part A Recover. Utilization Environ. Eff.47, 9803–9826 (2025). [Google Scholar]
- 37.Alkhonaini, M. A. et al. Hybrid Sine-Cosine chimp optimization based feature selection with deep learning model for threat detection in IoT sensor networks. Alexandria Eng. J.102, 169–178 (2024). [Google Scholar]
- 38.Al-Majidi, S. D. et al. A robust automatic generation control system based on hybrid Aquila Optimizer-Sine cosine algorithm. Results Eng.25, 103951 (2025). [Google Scholar]
- 39.Jiao, S., Wang, C., Gao, R., Li, Y. & Zhang, Q. A novel hybrid Harris Hawk sine cosine optimization algorithm for reactive power optimization problem. J. Exp. Theor. Artif. Intell.36, 901–937 (2024). [Google Scholar]
- 40.Chau, T. T., Nguyen, T. T. H., Nguyen, L. & Do, T. D. Wind speed probability distribution based on adaptive bandwidth kernel density Estimation model for wind farm application. Wind Energy. 28, e2970 (2025). [Google Scholar]
- 41.Farhat, M., Kamel, S., Atallah, A. M. & Khan, B. Optimal power flow solution based on jellyfish search optimization considering uncertainty of renewable energy sources. IEEE Access.9, 100911–100933 (2021). [Google Scholar]
- 42.Sharma, P. & Raju, S. Metaheuristic optimization algorithms: A comprehensive overview and classification of benchmark test functions. Soft. Comput.28, 3123–3186 (2024). [Google Scholar]
- 43.Zhao, W., Zhang, Z. & Wang, L. Manta ray foraging optimization: an effective bio-inspired optimizer for engineering applications. Eng. Appl. Artif. Intell.87, 103300 (2020). [Google Scholar]
- 44.Mirjalili, S. SCA: a sine cosine algorithm for solving optimization problems. Knowl. Based Syst.96, 120–133 (2016). [Google Scholar]
- 45.Abualigah, L. et al. Aquila optimizer: a novel meta-heuristic optimization algorithm. Comput. Ind. Eng.157, 107250 (2021). [Google Scholar]
- 46.Abdollahzadeh, B., Gharehchopogh, F. S. & Mirjalili, S. African vultures optimization algorithm: A new nature-inspired metaheuristic algorithm for global optimization problems. Comput. Ind. Eng.158, 107408 (2021). [Google Scholar]
- 47.Farzana, D. F. & Mahadevan, K. Performance comparison using firefly and PSO algorithms on congestion management of deregulated power market involving renewable energy sources. Soft. Comput.24, 1473–1482 (2020). [Google Scholar]
- 48.Verma, S. & Mukherjee, V. Firefly algorithm for congestion management in deregulated environment. Eng. Sci. Technol. Int. J.19, 1254–1265 (2016). [Google Scholar]
- 49.Kamaraj, N. Transmission congestion management using particle swarm optimization. J. Electr. Syst.7, 54–70 (2011). [Google Scholar]
Associated Data
This section collects any data citations, data availability statements, or supplementary materials included in this article.
Data Availability Statement
Data Availability: The datasets used and/or analysed during the current study available from the corresponding author on reasonable request.

























































