Next Article in Journal
New Uses for Coal Mines as Potential Power Generators and Storage Sites
Previous Article in Journal
Approach for Calculating and Analyzing Carbon Emissions and Sinks of Villages: A Case Study in Northern China
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Multi Criteria Frameworks Using New Meta-Heuristic Optimization Techniques for Solving Multi-Objective Optimal Power Flow Problems

Department of Electric Power Systems, Faculty of Energy, National University of Science and Technology Politehnica Bucharest, 060042 Bucharest, Romania
*
Author to whom correspondence should be addressed.
Energies 2024, 17(9), 2209; https://doi.org/10.3390/en17092209
Submission received: 4 April 2024 / Revised: 25 April 2024 / Accepted: 2 May 2024 / Published: 4 May 2024
(This article belongs to the Section F1: Electrical Power System)

Abstract

:
This article develops two metaheuristics optimization techniques, Grey Wolf Optimizer (GWO) and Harris Hawks Optimization (HHO), to handle multi-objective optimal power flow (MOOPF) issues. Multi Objective GWO (MOGWO) and Multi Objective HHO (MOHHO) are the names of the developed techniques. By combining these optimization techniques with Pareto techniques, the non-dominated solution set can be obtained. These developed approaches are characterized by simplicity and have few control parameters. Fuel cost, emissions, real power losses, and voltage deviation were the four objective functions considered. The theories used to determine the best compromise solution and organize the Pareto front options are the fuzzy membership equation and the crowding distance approach, respectively. To validate and evaluate the performance of the presented techniques, two standard IEEE bus systems—30-bus and 57-bus power systems—were proposed. Bi, Tri, and Quad objective functions with 21 case studies are the types of objective functions and the scenarios that were applied in this paper. As compared to the results of the most recent optimization techniques documented in the literature, the comparative analysis results for the proposed methodologies demonstrated the superiority and robustness of MOGWO and MOHHO.

1. Introduction

The main goal of power flow (PF) is to analyze the power system to obtain the voltage of all buses, losses at transmission lines, and the reactive power that has been injected on lines that satisfy the operation conditions. The optimization problem of optimal power flow (OPF) is large-scale, mixed-integer, extremely constrained, nonlinear, and nonconvex [1]. Therefore, OPF is researched to optimize a specific objective while keeping to equality and inequality constraints. Four objective functions were considered: fuel cost (FC), emission (E), active power losses (APL), and voltage deviation (VD). The variables that can be adjusted to attain optimal objective functions include tap changer settings on transformers, real power output of generation units, voltage magnitude at PV bus, and reactive power injected by compensation sources. The formulation of the OPF problem was introduced by Dommel and Tinney [2]. Gauss Seidel (GS) [3], Newton Raphson (NR) [4], and fast decoupled (FD) [5] are the most popular numerical methods that have been proposed to solve PF equations.
There are two types of optimization algorithm that have been applied to solve OPF problems: traditional and metaheuristic optimization techniques. In traditional techniques, several methods have been performed to solve OPF problems, such as ε-constraint methods [6], linear and nonlinear programming [7], interior point method [8], and quadratic programming [9]. The drawbacks of these methods are multiple local minimum points, requirement of heavy computational cost, and slowness in convergence. Recently, metaheuristic optimization techniques were widely applied to solve large-scale problems in fields such as computer science, engineering, and business. The main aim of these optimization methods is to solve global optimization problems. Lately, many research papers have been published on applications of meta-heuristic optimization methods such as the salp swarm algorithm (SSA) [10], the black widow optimization (BWO) [11], the manta ray foraging optimization (MRFO) [12], Henry gas solubility optimization (HGSO) [13], etc. In power systems, metaheuristic optimization algorithms were proposed to solve OPF problems such as Modified Artificial Bee Colony (MABC) [14], Spatio-temporal distribution (STD) [15], differential evolution (DE) [16], enhanced Particle Swarm optimization (EPSO) and Ant Lion optimization (ALO) [17], improved differential evolution (IDE) [18,19], Harris Hawks Optimization (HHO) [20,21], and Grey Wolf Optimizer (GWO) [22]. The previous methods dealt with the problems of single-objective optimal power flow (SOOPF).
In multi-objective optimization, many metaheuristic optimization methods have been applied to solve MOOPF problems to provide a well-distributed Pareto solution set and offer a wide range of these solutions to decision-makers. For example, DE has been improved to solve SOOPF and integrated with Pareto concept optimization (PCO) to solve MOOPF, named MOIDEA [23]. SMA has been proposed to solve SOOPF, and this algorithm has been developed to solve MOOPF with the considered case study of ISGHV [24,25]. Refs. [26,27] solves single and multi-objective OPF problems by combining the HGS with PCO using FMF and CD strategies to extract BCS and arrange the non-dominated solutions (NDSs). An improved decomposition-based method to solve MOOPF problems [23]. Bee colony algorithms (BCA) have been improved to solve multi-objective dynamic OPF problems based on PCO [28]. The authors in [29] employed AMTPG-Jaya to solve MOOPF problems. HSA was applied to solve MOOPF problems [30]. TLBO was combined with a quasi-opposition approach to enhance the quality and convergence characteristics of solutions [31]. MOIICA was applied to solve MOOPF problems in the IEEE 30-bus [32]. In [33], M2OBA was proposed to solve MOOPF by considering fuel cost (FC), active power loss (APL), and emission (E) in the IEEE 30-bus test system. In [34], MOEA-based decomposition (MOEA/D) was proposed to handle MOOPF. The objective functions (OFs) that were proposed are FC, VD, E, and APL, with seven cases studied on the IEEE 30 bus test system. Huy et al. [35] introduced MOSGA to solve MOOPF problems on IEEE 30-bus and 57-bus systems by considering three objective functions, which are FC, E, and APL. Yuan et al. [36] proposed ISPEA2 to solve MOOPF problems on IEEE 30-bus and 57-bus systems with two objective functions, FC and E. Three power system—IEEE 30-bus, IEEE 118-bus, and Indian Utility System 62-bus—were proposed to solve OPF problem using LISA Strategy-II algorithm with combined traditional thermal power generators, solar power coupled, and stochastic wind [37].
The aim is to use hybridization of algorithms to achieve a balance between the exploration and exploitation phases of the research in the whole area. Many articles hybridize the GWO with other algorithms. For example, Meng et al. [38] hybridized a hybrid algorithm based on crisscross search and the Grey Wolf Optimizer (CS-GWO) to solve OPF problems in the IEEE 30-bus system and the IEEE 118-bus system. In [39], Grey Wolf Optimizer and cuckoo search (GWOCS) were presented. Qin et al. [40] presented a new hybrid optimization method called HDGWO. Also, several articles have proposed hybridizing the HHO with other algorithms. Birogul [41] combined Harris Hawks Optimization (HHO) with differential evolution (DE) to solve OPF problems on an IEEE 30-bus test system. Dhawale et al. [42] presented a chaotic with Harris Hawks Optimization (CHHO) for solving engineering optimization problems.
In this article, OPF was applied to two IEEE standards, the IEEE 30-bus test system and the IEEE 57-bus test system, to achieve optimal objective functions while satisfying the constraints. Two metaheuristic optimization algorithms, Grey Wolf Optimizer (GWO) [43] and Harris Hawks Optimization (HHO) [44], were developed into multi-objective optimization methods to solve MOOPF problems. Pareto optimization [45] was integrated with the proposed algorithms (GWO and HHO) to establish the developed approaches (MOGWO and MOHHO). Fuzzy membership function (FMF) and crowding distance (CD) strategies [46] are the theories used to extract BCS and reduce and arrange the NDSs from Pareto front solutions.
This paper’s main novelty represents the use of new metaheuristic optimization techniques created by integrating analyzed algorithms (GWO and HHO) with Pareto concept optimization and using the characteristics of fuzzy membership function and crowding distance to generate a set of non-dominated solutions and draw the Pareto front that illustrates a good distribution. Therefore, creating new optimization techniques is vital, considering the massive expansion of electrical power systems. In addition, the increase in the number of OFs that can be solved simultaneously will lead to more complex and computational efforts to achieve the optimal Pareto front. These reasons lead to a need to explore new meta-heuristics optimization techniques capable of solving MOOPF problems and providing a set of non-dominated solutions and therefore good distribution of the Pareto front in power systems. This study is dedicated to overcoming challenges on original algorithms (GWO and HHO) by solving the multiple objective OPF problems.
In this work, the authors proved the ability of the developed approaches, MOGWO and MOHHO, to solve MOOPF problems. First, the control variables must be set to achieve the best multiple objective functions (FC, E, APL, and VD) simultaneously and find the optimal NDSs. Then, the authors used FNF to find BCS from NDS set. Finally, the CD is the strategy that was applied to select the best solutions in optimal NDSs. This strategy shows the distribution of optimal NDSs around an NDS. The developed approaches featured the ability for convergence speed, exploration, and exploitation. The main contributions can be summed up as follows:
  • The authors used two popular meta-heuristic optimization techniques, GWO and HHO, to address MOOPF problems and achieve technical, environmental, and economic benefits of power systems.
  • The method used to identify non-dominated Pareto front solutions is called Pareto concept optimization (PCO).
  • FMF is used to extract BCS, and the CD mechanism is used to choose the best solutions from all non-dominated Pareto front solutions.
  • With 21 case studies, two standard power systems—the IEEE 30-bus and the IEEE 57-bus—were used for multiple objective functions, including Bi, Triple, Quad, and Quinta.
  • The developed approaches, MOGWO and MOHHO, provided the best compromise solutions. These solutions were compared with other recent optimization techniques documented in the literature.
This paper is arranged as follows: The mathematical model of MOOPF is introduced in Section 2. Section 3 describes the multi-objective of the developed approaches. The numerical results, simulation, and discussion of developed approaches are demonstrated in Section 4. The last section of this article is the conclusion.

2. The Mathematical Formula of OPF Problem

The main goal of solving MOOPF problems is to find the optimal objective functions (OFs) by setting control variables that satisfy the operational constraints (state variables). This goal in multiple OFs is achieved by finding non-dominated solutions and selecting the best compromise solution (BCS) for multiple OFs. The control variables include the parameters that are controlled by operators, such as the active power of generators, the voltage magnitude at the PV bus, the tap changer setting, and reactive compensator sources. The state variables involve the parameters that must not be violated, such as active power at the slack bus, reactive power at the PV bus, voltage magnitude at the PQ bus, and apparent power at transmission lines. The mathematical model of MOOPF is as follows:
Optimize F a , b = F 1 ( a , b ) , F 2 ( a , b ) , , F N o b j ( a , b ) subjected   to G a , b = 0   H a , b 0
where F represent OFs will be minimized, G and H are the equality and inequality constraints, respectively, a is the state variables (dependent variables), and b is the control variables (independent variables).

2.1. The State Variables

The set of variables known as “state variables” describes any unique state of the system. The mathematical model of state variables a is as follows:
a = P g 1 , V l 1 , , V L n p q , Q g 1 , , Q g n p v , S l 1 , , S l n l
where P g 1 is the active power output of the swing generator; V l is the magnitude of voltage at PQ buses; Q g is the reactive power output of PV bus (generators bus); and S l is the MVA loading at transmission line; n p v , n p q , and n l are the numbers of PV bus, PQ bus, and transmission lines, respectively.

2.2. The Control Variables

The formula of control variables u can be expressed as follows:
b = P g 2 , , P g p v , V g 1 , , V g p v , T 1 , , T n t , Q c 1 , , Q c n c
V G is the voltage magnitude at PV buses (generators bus). T is the tap changer of transformers. Q c is the source VAR compensator (MVAr). n t denotes capacitor shunt and n c is the numbers of tap setting regulating.

2.3. The Constraints

There are two constraints in the OPF problem, equality and inequality constraints.

2.3.1. Equality Constraints

These constraints refer to the physical structure of the system (power balance equations):
P gi P di V i j = 1 n b V j g i j cos ( θ i j ) + b i j sin ( θ i j ) = 0 i n Q gi + Q ci Q di V i j = 1 N B V j g i j sin ( θ i j ) + b i j cos ( θ i j ) = 0 i n
n B is the number of buses, P D and Q D are the real and reactive power output of load demand, respectively. g i j and b i j are the conductance and susceptance, respectively. θ i j is the difference in voltage angles.

2.3.2. Inequality Constraints

The operating limit of the equipment is the inequality constraint. The inequality constraints involve generators, transformers, shunt compensators, and security. The expression formula for these constraints is as follows:
  • Generator:
P gi min P gi P gi max i = 1 , 2 , , n g Q gi min Q gi Q gi max i = 1 , 2 , , n g V gi min V gi V gi max i = 1 , 2 , , n g
  • Transformer:
T j min T j T j max j = 1 , 2 , , N T
  • Shunt capacitor:
Q c i min Q c i Q c i max i = 1 , 2 , , n C
  • Security:
V li min V li V li max i = 1 , 2 , , n l S l i S l i max i = 1 , 2 , , n n l

2.4. Objective Functions (OFs)

In this paper, four objective functions (OFs) were minimized: fuel cost (FC), active power losses (APL), emission (E), and voltage deviation (VD).

2.4.1. Fuel Cost (FC) [$/h]

It can be expressed in the formula of this objective function as follows [47]:
F C = i = 1 N G f i ( P G i ) = i = 1 N G a i P G i 2 + b i P G i + c i [ $ / h ]
a i ,   b i , and c i denote the coefficients of fuel cost on generation units.

2.4.2. Active Power Losses (APLs) [MW]

APLs represent the second OFs in this work and can be described as follows [47]:
  F l o s s = k = 1 N n l G i   V i 2 + V j 2 2 V i V j cos δ i , j [ MV ]
G i is the transfer conductance.

2.4.3. Emission (E) [ton/h]

The third OF of this work is to minimize the emission of fossil fuels by thermal generation units such as N O x and S O 2 . This objective function is stated as follows [18]:
F e m = i = 1 N G 10 2 α i + β i P G i + γ i P G i 2 + ζ i exp λ i P G i [ ton / h ]
α i , β i , γ i , ζ i , and λ i refer to the coefficients of emission.

2.4.4. Voltage Deviation (VD) [p.u.]

The criterion to evaluate the voltage quality, security, and service indexes of any system is voltage deviation (VD). The main goal of this OF is to optimize VD of all PQ buses to 1.0 [p.u.]. It can be described by the mathematical formula as follows [48]:
F V D = i = 1 N P Q V i 1.0 [ p . u . ]
The equation above is related to SOOPF. In this paper, the developed approaches are related to MOOPF. It can be expressed in MOOPF as follows:
F m ( a , b ) = i = 1 n o b j ω i F i ( a , b ) = ω 1 F 1 + ω 2 F 2 + + ω m F m i = 1 , 2 , , n o b j
F is individual OFs, n o b j the number of OFs, and ω denotes the weight coefficient. The sum of ω is equal to 1.

3. Multi-Objective Meta-Heuristic Optimization Techniques

The proposed algorithms (GWO and HHO) are population iterative methods inspired by the cooperative behavior of gray wolves and Harris hawks. The proposed algorithms are effective in solving nonlinear, non-convex, and complex optimization problems. These algorithms are simple and do not need a lot of control parameters. It can be summarized as follows:

3.1. Grey Wolf Optimizer (GWO)

The social behavior of the gray wolf is the inspiration for a new optimization technique called GWO. As illustrated in Figure 1, Grey Wolf is classified into four groups according to leadership: alpha (α), beta (β), delta (δ), and omega (ω). The fitness of alpha gray represents the best fitness of all fitness. Beta (β) and delta (δ) will provide the second and third level of fitness. The remainder of the fitness can be represented by omega. The main procedures can be characterized as below:

3.1.1. Encircling

It can describe the mechanism of encircle as follows:
V = C W p ( t ) W ( t ) W ( t + 1 ) = W p ( t ) B V B = 2 b r 1 b , C = 2 r 2
W and W p represent the location of a grey wolf and prey, respectively. V and X denote the coefficient vectors. r 1 and r 2 are random vectors ranging from [0–1]. b is the linear decrease between [2–0] over the iterations.

3.1.2. Hunting

The formula of this process can be expressed as follows:
V α = C 1 W α W , V β = C 2 W β W , V δ = C 3 W δ W W 1 = W α B 1 V α , W 2 = W β B 2 V β , W 3 = W δ B 3 V δ W ( t + 1 ) = W 1 + W 2 + W 3 3

3.1.3. Attacking

The attack process represents the last action of the GWO algorithm. This process will be performed when the prey has stopped moving. The mathematical formula of this process can be represented by gradually decreasing b from [2–0].

3.1.4. Searching

The above process includes the exploration of the GWO algorithm. The wolves begin this process by searching for their prey based on where α, β, and δ wolves are located. There will be an attack by the convergence. The prey hunt is determined by the value of B . If the value of B is more than 1, it needs to look for another prey. The flowchart of the GWO algorithm is illustrated in Figure 2.

3.2. Harris Hawks Optimizer (HHO)

This optimization technique was based on population. HHO was proposed by Heidari et al. [44]. The phases that are presented in this algorithm are exploration and exploitation. It can be described as follows:

3.2.1. Exploration

The exploration phase can be described as follows:
Y ( t + 1 ) = Y r n d ( t ) r 1 Y r n d ( t ) 2 r 2 Y ( t ) k 0.5 Y r a b ( t ) Y m ( t ) r 3 L B + r 4 U B L B k < 0.5 Y m ( t ) = 1 N h i = 1 N h Y i ( t )
where Y , Y r n d , Y r a b , and Y m are the position vectors of hawks, random, rabbit, and average. UB and LB denote the upper and lower bounds of variables. N is the number of hawks.

3.2.2. Transformation

This process represents the transformation from exploration to exploitation. The formula of this process can be described as follows:
E = 2 E 0 1 t max ( T )
E 0 and E are the initial state and escaping energy, T is the number of iterations.

3.2.3. Exploitation

According to the probability of escaping and its energy for the prey, four different scenarios were implemented. Attacks can be classified as either soft or hard besieges. The hard besiege is implemented if (r < 0.5) then (| ε | < 0.5), while the soft besiege occurs when (r ≥ 0.5) when (| ε | ≥ 0.5). The following are the stages of exploitation:
1.
Soft besiege
The mathematical model of this phase can be expressed as follows:
Y ( t + 1 ) = Δ Y ( t ) e J Y r a b ( t ) Y ( t ) Δ Y ( t ) = Y r a b ( t ) Y ( t ) J = 2 ( 1 r 5 )
J is the power of jumping for a rabbit during escaping.
2.
Hard besiege
The update on the prey position is as follows:
Y ( t + 1 ) = Y r a b ( t ) E Δ Y ( t )
3.
Soft besiege with progressive rapid dives
A soft besiege will be executed by the hawks in preparation for increasingly rapid dives. This process will be executed when |e| ≥ 0.5 and r < 0.5. This process can be formulated as follows:
X = Y r a b ( t ) E J Δ Y r a b ( t ) Y ( t )
Diving hawks are represented by the levy flight function (LF):
Z = X + S × L F ( d )
d is the dimension of the problem and S is a random vector by size, 1 × d . LF can be expressed as follows:
L F ( x ) = 0.01 × ω × β ν 1 σ , β = Γ 1 + β × sin π β 2 Γ 1 + β 2 × β × 2 β 1 2
The update on the hawks position is as follows:
Y ( t + 1 ) = X i f   F ( X ) < F ( Y ( t ) ) Z i f   F ( Z ) < F ( Y ( t ) )
4.
Hard besiege with progressive rapid dives:
The condition to achieve this phase is when| ε | < 0.5 and r < 0.5. This phase can be described as follows:
X = Y r a b ( t ) E J Δ Y r a b ( t ) Y m ( t ) Z = X + S × L F ( d ) Y ( t + 1 ) = X i f   F ( X ) < F ( Y ( t ) ) Z i f   F ( Z ) < F ( Y ( t ) )
Figure 3 illustrates the flowchart of HHO.

3.3. Pareto Concept Optimization (PCO)

3.3.1. Pareto Concept (PC)

The most popular method to obtain non-dominated solutions (NDSs) is the Pareto concept (PC). The equation used to prove the dominance of solution ×1 over solution ×2 is the following:
i 1 , 2 , , n : f i x 1 f i x 2 j 1 , 2 , , n : f j x 1 f j x 2

3.3.2. The Best Compromise Solution (BCS)

The calculation of BCS is the main objective for decision making. FMF is the technique used to find BCS [49]. The steps of this technique can be summarized as follows:
-
Determine the boundary of all objective functions ( F i min and F i max ).
-
Calculate the membership function u i for each objective as follows:
u i k = 1 F i F i min F i max F i F i max F i min F i min < F i < F i max 0 F i F i max
where F i min and F i max is the min. and max. values of NDSs. This equation represents the indicator for satisfaction for each OF to determine OFs in the range [1–0].
-
To calculate the corresponding FMF of the non-dominated solutions (NDSs), it is as follows:
u k = i = 1 N o b j u i k k = 1 M i = 1 N o b j u i k
where u i k is to the FMF of each NDS. u k is BCS, M is the number of Pareto solutions. Finally, the maximum membership function ( u k ) is the best compromise solution (BCS). Figure 4 represents the fuzzy membership function.

3.3.3. Crowding Distance (CD)

The method used to choose the best solutions from among all the non-dominated Pareto front solutions is called the crowding distance, or CD. The following equations were used to calculate the crowding distance:
Δ i = j = 1 N o b j d j i Δ f j
Δ f j = f j max f j min , j [ 1 , N o b j ]
d j i = f j i + 1 f j i 1
where N o b j denotes to the number of OFs, f i max and f i min are the max. and min. values obtained for OFs, f i i + 1 and f i i 1 are the values for the jth OF for i + 1 and i − 1. A lower CD value indicates a greater distributed set of solutions inside a given area. Since this parameter is determined in the objective spaces of multi-objective problems (MOPs), all NDSs must be categorized according to the values of one of the OFs. Calculating these parameters for every non-dominant solution is necessary. CD is calculated for all NDSs of all iteration. The solutions that have the highest CD values must be determined. Thus, NDSs from the non-dominated Pareto front (NDPF) are reduced and arranged using the CD technique. CD values represent the average distance between two neighboring NDSs. First, the fitness value of each OF should be calculated. These fitness values will be sorted in ascending order to determine the fitness with the infinite value. The corresponding diagonal length will be assigned to the remaining intermediate solutions. It can be represented by the diagonal length of the cuboid in Figure 5.

3.4. Multi-Objective Grey Wolf Optimizer (MOGWO)

In this article, GWO was developed into MOGWO to solve MOOPF problems. Figure 6 represents the flowchart of MOGWO. These critical phases are the two primary MOGWO operations (hunting and encircling), as was previously explained. GWO addresses the population in each generation of the evolutionary process. The new population W(t + 1) is the product of the encircling and hunting. Furthermore, a comparison will be made between W and W(t + 1). The Pareto dominance theory must be considered when comparing GWO to MOGWO. The following is a summary of the MOGWO phases:
Step 1: Initialization of system data (Max_ite, Max_pop, NDSs, control variables, etc. …).
Step 2: Compute the power flow of each GWO agent.
Step 3: Evaluate the weight factor of OFs of each GWO agent.
Step 4: Calculate W α , W β and W δ
Step 5: Sort NDSs according to the weight factor of OFs of each population and save them in the repository.
Step 6: The position of search agent is updated via (15) and recalculate steps 3, 4, and 6.
Step 7: Integrate NDSs repositories of steps 5 and 6.
Step 8: Check the criteria (number of iterations or number of NDSs), if satisfied, go to step 9. Otherwise, return to step 3.
Step 9: Determine BCS from the NDSs.

3.5. Multi-Objective Harris Hawks Optimization (MOHHO)

Multi objective Harris Hawks Optimization (MOHHO) is the second approach that was applied for solving MOOPF problems (two or more OFs) and to optimize simultaneously. In Figure 7, the MOHHO flowchart is shown. It is important to archive NDSs to generate the Pareto front sets. This archive is updated, and NDSs are removed with every iteration. Therefore, whenever the number of members in the Pareto archive exceeds the Pareto archive’s size, NDSs with the lowest CD values among the Pareto archive members are deleted. Because MOHHO uses long-distance solutions and focuses on near-optimal solutions, it has a lot of potential for use in the design space. Furthermore, by employing soft besiege, hard besiege, soft besiege with progressive rapid dives, and hard besiege with progressive rapid dives, respectively, the abilities of exploitation and exploration for the developed approach were improved. Generally, MOHHO begins with exploitation and progresses to exploration. However, in the first iteration, these motions function as a heuristic. The ability of the MOHHO to focus on the best NDSs while exploring a wide range of design space might be interpreted as this development. The steps below represent a summary of the main phases of MOHHO:
Step 1: Create the system data initial parameters.
Step 2: Create a random population matrix of HHO.
Step 3: Evaluate the weight factor of (OFs) of each population vector.
Step 4: Sort NDSs and save them in the HHO repository.
Step 5: Calculate the rabbit energy (E0).
Step 6: Update the energy rabbit using (17).
Step 7: Update the position of HHO agent and recalculate steps 3 and 4.
Step 8: Sort NDSs and save them in the HHO repository.
Step 9: Combine all NDSs (step 4 and 8) to find new NDSs.
Step 10: Check the criteria (number of iterations or number of NDSs), if satisfied, go to step 11. Otherwise, return to step 3.
Step 12: Determine the BCS from the NDSs.

4. Application of Metaheuristics Optimization Techniques to Solve MOOPF Problems

To demonstrate the robustness and effectiveness of the developed approaches (MOGWO and MOHHO) to solve the MOOPF problem in power systems, two bus test systems were proposed, namely IEEE 30-bus and IEEE 57-bus power systems. The characteristics of these systems are listed in Table 1. Twenty-one case studies were applied, as shown in Table 2.

4.1. IEEE 30-Bus

The details of IEEE 30-bus data are given in [50]. The coefficients of cost and emission of generators are given in Table A1. A single-line diagram of this system is shown in Figure A1. Ten case studies were applied to solve the MOOPF problem in this test bus system (five of Bi, four of Tri, and one of Quad objective functions) and are shown in Table 2. The control variables of this system are 24 items (5 for the active power output of generation units, 6 for voltage magnitude at the PV bus, 4 for tap changer setting, and 9 for shunt VAR compensation). The MATLAB program stops when one of the conditions is satisfied: the number of iterations or the number of NDSs equals 500. The population size is 500 items.

4.1.1. Bi-Objective OPF on IEEE 30-Bus

The main aim of applying Bi objective functions (OFs) is to optimize two OFs simultaneously and select BCS from NDSs. To prove the efficiency of the developed approaches (MOGWO and MOHHO) in Bi OFs, five case studies were proposed.
  • Case #1: Minimization of FC and E simultaneously
In the first case, FC and total E were minimized simultaneously using MOGWO and MOHHO. For the proposed methods, the best compromise solutions (BCS) of FC and E are as follows:
  • FC: 832.82 [$/h] and 826.785 [$/h] for MOGWO and MOHHO, respectively.
  • E: 0.2455 [ton/h] and 0.2553 [ton/h] for MOGWO and MOHHO, respectively.
These results illustrated that the optimal results obtained by MOHHO are not dominated by the optimal results obtained by MOGWO, and vice versa. The Pareto front non-dominated solutions (PFNDSs) produced by MOGWO have a better distribution than the solutions produced by MOHHO, as shown in Figure 8a.
  • Case #2: Minimization of FC and APL simultaneously
In the second case, FC and APL were considered OFs and minimized simultaneously using MOGWO and MOHHO. BCS of FC and APL for these approaches are as follows:
  • FC: 825.91 [$/h] and 824.6 2 [$/h] for MOGWO and MOHHO, respectively.
  • APL: 5.527 [MW] and 5.727 [MW] for MOGWO and MOHHO, respectively.
These results illustrated that the optimal results obtained by MOHHO are not dominated by the optimal results obtained by MOGWO, and vice versa. However, as Figure 8b illustrates, PFNDSs obtained by MOGWO have a better distribution than results obtained by MOHHO.
  • Case #3: Minimization of FC and VD simultaneously
In this article, FC and VD employing MOGWO and MOHHO represent the third case of Bi OFs that were optimized. The BCS of FC and VD for these methods are as follows:
  • FC: 801.39 [$/h] and 801.3053 [$/h] for MOGWO and MOHHO, respectively.
  • VD: 0.3457 [MW] and 0.3321 [MW] for MOGWO and MOHHO, respectively.
MOGWO dominated the optimal results obtained by MOHHO in terms of dominance. Figure 8c displays PFNDSs for this case that were obtained using MOGWO and MOHHO.
  • Case #4: Minimization of E and VD simultaneously
Using MOGWO and MOHHO, the fourth case in this work minimizes E and VD simultaneously. The BCS of E and VD are as folows:
  • E: 0.2068 [ton/h] and 0.2086 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.1403 [p.u.] and 0.2553 [p.u.] for MOGWO and MOHHO, respectively.
The results obtained by MOGWO are dominated by the results produced by MOHHO. Figure 8d displays the PFNDS for this case.
  • Case #5: Minimization of APL and VD simultaneously
APL and VD represent the OFs that were minimized simultaneously using MOGWO and MOHHO. The BCS of APL and VD for the proposed approaches are as follows:
  • APL: 3.7347 [MW] and 4.6037 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.1557 [p.u.] and 0.2517 [p.u.] for MOGWO and MOHHO, respectively.
The results obtained by MOGWO are dominated by the results produced by MOHHO. Figure 8e displays the PFNDS for this case. It can be observed from Figure 8a–e that the PFNDSs obtained by MOGWO have a better distribution than the PFNDSs obtained by MOHHO for Cases 1–5. The voltage profiles (VP) of the Bi OFs obtained for cases 1–5 are displayed in Figure 9a–e. VD is very important in OPF problems because the results obtained by developed approaches are effective in cases where the VD is OFs (3, 4, and 5) and infeasible in cases where the VD is not OFs (1 and 2), as shown in Figure 9a–e. In Table 3, BCS and the optimal control variables (OCV) of Bi OFs for Cases 1–5 that were obtained by MOHHO and MOGWO are presented.

4.1.2. Triple-Objective OPF on IEEE 30-Bus

In this type, three OFs were optimized simultaneously to obtain BCS from NDSs. Four case studies were suggested. It can be summarized as below:
  • Case #6: Optimization of FC, E, and APL simultaneously
In the first case of this type, FC, E, and APL are minimized simultaneously using MOGWO and MOHHO to find PFNDSs. The BCS of FC, E, and APL for the proposed approaches are the following:
  • FC: 873.07 [$/h], and 868.13 [$/h], for MOGWO and MOHHO, respectively.
  • E: 0.2200 [ton/h] and 0.2272 [ton/h] for MOGWO and MOHHO, respectively.
  • APL: 4.332 [MW] and 4.551 [MW] for MOGWO and MOHHO, respectively.
Figure 10a illustrates the PFNDSs that MOHHO and MOGWO that are obtained in this case.
  • Case #7: Minimization of FC, E, and VD simultaneously
In the seventh case of this paper, FC, E, and VD are optimized simultaneously using MOGWO and MOHHO to achieve PFNDSs. BCS of FC, E, and VD for the proposed approaches are as follows:
  • FC: 832.56 [$/h] and 835.2 [$/h], for MOGWO and MOHHO, respectively.
  • E: 0.2531 [ton/h] and 0.2553 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.1584 [p.u.] and 0.2184 [p.u.] for MOGWO and MOHHO, respectively.
The MOGWO results were superior to the MOHHO results in terms of optimal results. Figure 10b illustrates the PFNDSs that MOHHO and MOGWO were able to obtain for this case.
  • Case #8: Minimization of FC, APL, VD simultaneously
The third case of triple OFs is a minimization of FC, APL, and VD simultaneously using MOGWO and MOHHO to achieve PFNDSs. BCS of FC, APL, and VD for MOGWO and MOHHO are the following:
  • FC: 824.6131 [$/h] and 822.197 [$/h] for MOGWO and MOHHO, respectively.
  • APL: 6.5035 [MW] and 6.8626 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.1733 [p.u.] and 0.2709 [p.u.] for MOGWO and MOHHO, respectively.
Figure 10c displays the PFNDSs for this case that were obtained by MOGWO and MOHHO.
  • Case #9: Minimization of APL, E, and VD
APL, E, and VD are the OFs that were minimized simultaneously to achieve PFNDSs using MOGWO and MOHHO. BCS of APL, E, and VD for the proposed approaches are as follows:
  • APL: 3.5429 [MW] and 4.9524 [MW] for MOGWO and MOHHO, respectively.
  • E: 0.2063 [ton/h] and 0.2167 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.1733 [p.u.] and 0.2132 [p.u.] for MOGWO and MOHHO, respectively.
The MOGWO results were superior to the MOHHO results. The PFNDSs for this case that were obtained by MOHHO and MOGWO are displayed in Figure 10d. Table 4 presents the optimal result of the OFs and the best control variables of the Triple as determined by the proposed approaches.

4.1.3. Quad Objective OPF on IEEE 30-Bus

The last type of OFs in this article is the Quad OFs, as shown in Table 2. One case study of Quad OFs is the case that was suggested to solve MOOPF.
  • Case #10: Minimization of FC, E, APL, and VD simultaneously
FC, APL, E, and VD are the OFs that were minimized in this case using the proposed approaches to achieve PFNDSs. BCS of FC, APL, E, and VD for MOGWO and MOHHO are the following:
  • FC: 836.5049 [$/h] and 863.4444 [$/h] for MOGWO and MOHHO, respectively.
  • APL: 5.9222 [MW] and 5.2679 [MW] for MOGWO and MOHHO, respectively.
  • E: 0.2460 [ton/h] and 0.2320 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.2264 [p.u.] and 0.7258 [p.u.] for MOGWO and MOHHO, respectively.
It can be observed from Figure 11a–d that PFNDSs obtained by MOGWO have a better distribution than PFNDSs obtained by MOHHO for all Cases (6–9). Figure 11a–e shows the VP of the Triple and Quad OFs obtained by MOGWO and MOHHO for cases (6–10). The results obtained by the developed approaches are effective in cases where the VD is OFs (7–10) and infeasible in cases where the VD is not OFs (Case #6), as shown in Figure 11a–d. Table 5 presents the best result for OFs and the optimal control variables (OCVs) of the Triple and Quad OFs for Cases (6–10) as determined by MOGWO and MOHHO. For Cases 1, 2, 3, and 6, Table 4 and Table 6 compare the BCS of MOGWO and MOHHO with other newly optimization techniques. In terms of BCS results, it is evident that the developed approaches give a better result than other optimization methods.

4.2. IEEE 57-Bus Power System

The second standard for evaluating the performance of MOGWO and MOHHO is the IEEE 57-bus system. Table 1 lists the characteristics of this system. Total demand of this system is 1250.8 MW [74]. Figure A2 represents the single-line diagram. This system has 33 control variables. The cost and emission coefficients are illustrated in Table A2. The MATLAB program stops when one of the following conditions is satisfied: the number of iterations equals 100 or the number of NDSs equals 500. The population size is 100 items. BCS and OCVs were obtained by MOGWO and MOHHO and are reported in Table 7, Table 8 and Table 9. Table 10 and Table 11 compare the BCS of MOGWO and MOHHO with other optimization algorithms for Cases (11, 12, and 17). In terms of BCS results, it is evident that MOGWO and MOHHO are superior to several methods.

4.2.1. Bi OFs OPF

Two OFs were minimized simultaneously to obtain BCS from NDSs. FMF is the strategy used to find BCS. CD is the approach employed to arrange NDSs in PFNDSs. To illustrate the effectiveness and superiority of the developed techniques MOGWO and MOHHO to solve Bi OFs OPF, six cases were proposed. The summary of these cases is as follows:
  • Case #11: Optimization of FC and E.
The first case of this type on this system is to find the minimization of FC and E simultaneously using MOGWO and MOHHO. BCS of FC and E for the proposed approaches are the following:
  • FC: 42,219.67 [$/h] and 42,408.02 [$/h] for MOGWO and MOHHO, respectively.
  • E: 1.0953 [ton/h] and 1.1013 [ton/h] for MOGWO and MOHHO, respectively.
These results show that MOGWO dominated MOHHO in terms of BCS. Figure 12a displays PFNDSs for this case that were produced by MOGWO and MOHHO.
  • Case #12: Minimization of FC and APL
FC and APL were considered as OFs and minimized using MOGWO and MOHHO. BCS of FC and APL for MOGWO and MOHHO are as follows:
  • FC: 41,871.94 [$/h] and 41,994.52 [$/h] for MOGWO and MOHHO, respectively.
  • APL: 12.53 [MW] and 11.62 [MW] for MOGWO and MOHHO, respectively.
Figure 12b displays the PFNDSs obtained by the proposed approaches.
  • Case #13: Minimization of E and APL
The third case of Bi OFs on the IEEE 57-bus test is to optimize E and APL by using MOGWO and MOHHO. The BCS of E and APL for MOGWO and MOHHO are the following:
  • E: 0.9990 [ton/h] and 1.0384 [ton/h] for MOGWO and MOHHO, respectively.
  • APL: 12.137 [MW] and 10.820 [MW] for MOGWO and MOHHO, respectively.
PFNDSs obtained by MOGWO and MOHHO for this case are shown in Figure 12c.
  • Case #14: Minimization of FC and VD
In this case, The OFs that were minimized using MOGWO and MOHHO are FC and VD. BCS of FC and VD for MOGWO and MOHHO are as follows:
  • FC: 41,823.485 [$/h] and 41,985.63 [$/h] for MOGWO and MOHHO, respectively.
  • VD: 0.7091 [p.u.] and 0.7565 [p.u.] for MOGWO and MOHHO, respectively.
PFNDSs obtained by MOGWO and MOHHO for this case are presented in Figure 12d. BCS obtained by MOHHO were dominated by MOGWO.
  • Case #15: Minimization of APL and VD
The OFs that were simultaneously optimized using MOGWO and MOHHO are represented by APL and VD. BCS of VD and APL for the proposed techniques are as follows:
  • APL: 11.6969 [MW] and 14.0954 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.7277 [p.u.] and 0.7146 [p.u.] for MOGWO and MOHHO, respectively.
The PFNDSs for this case that were obtained by MOHHO and MOGWO are displayed in Figure 12e.
  • Case #16: Minimization of E and VD
The last case of Bi OFs OPF on an IEEE 57-bus system is the minimization of E and VD simultaneously using MOGWO and MOHHO. The BCS of E and VD for the proposed techniques are the following:
  • E: 0.9844 [ton/h] and 1.498 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.7599 [p.u.] and 0.6564 [p.u.] for MOGWO and MOHHO, respectively.
PFNDSs obtained by the proposed techniques MOGWO and MOHHO for this case are shown in Figure 12f. The BCS and OFs for Bi OFs on the IEEE 57 bus system obtained by MOGWO and MOHHO for Cases (11–16) are illustrated in Table 7 and Table 8. From Figure 12a–f, it can be observed that the PFNDSs obtained by MOGWO are better distributed than the PFNDSs obtained by MOHHO. Figure 13a–f shows the VD of the Bi OFs on the IEEE 57-bus system obtained by MOGWO and MOHHO for Cases (11–16). This figure proves that the solutions obtained by MOGWO and MOHHO are effective in cases 14–16 (when VD is OFs) and infeasible in cases 11–13 (when VD is not OFs), as shown in Figure 8a–e.

4.2.2. Triple OFs OPF on IEEE 57-Bus

To obtain the BCS from NDSs in the non-dominated set, three OFs were given consideration simultaneously. Four case studies were suggested. BCS and the OCV for Triple OFs on this system obtained by MOGWO and MOHHO are illustrated in Table 8. It can be summarized as follows:
  • Case #17: Minimization of FC, E, and APL
This case combined FC, E, and APL to optimize simultaneously using MOGWO and MOHHO to obtain the PFNDSs. The BCS of FC, E, and APL for the proposed techniques are as follows:
  • FC: 42,277.003 [$/h] and 42,399.26 [$/h] for MOGWO and MOHHO, respectively.
  • E: 1.1338 [ton/h] and 1.1087 [ton/h] for MOGWO and MOHHO, respectively.
  • APL: 11.2276 [MW] and 11.7439 [MW] for MOGWO and MOHHO, respectively.
Figure 14a displays PFNDSs for this case that were obtained using MOGWO and MOHHO.
  • Case #18: Minimization of FC, E, and VD
In the eighteenth case, in order to achieve PFNDSs, the FC, E, and VD were considered as OFs and minimized simultaneously using MOGWO and MOHHO. BCS of FC, E, and VD for the proposed techniques are the following:
  • FC: 42,590.707 [$/h] and 43,225.917 [$/h] for MOGWO and MOHHO, respectively.
  • E: 1.0970 [ton/h] and 1.1802 [ton/h] for MOGWO and MOHHO, respectively.
  • VD: 0.7818 [p.u.] and 0.7284 [p.u.] for MOGWO and MOHHO, respectively.
Figure 14b displays the PFNDSs that MOHHO and MOGWO obtained for this Case.
  • Case #19: Minimization of FC, APL, and VD
The nineteenth case of this paper is a minimization of FC, APL, and VD simultaneously using MOGWO and MOHHO to achieve the PFNDSs. BCS of FC, APL, and VD for the proposed techniques are as follows:
  • FC: 42,648 [$/h] and 42,854 [$/h] for MOGWO and MOHHO, respectively.
  • APL: 11.972 [MW] and 13.370 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.7886 [p.u.] and 0.7087 [p.u.] for MOGWO and MOHHO, respectively.
Figure 14c displays PFNDSs that MOHHO and MOGWO were able to obtain for this case.
  • Case #20: Minimization of E, APL, and VD
The twentieth case of this paper is the simultaneous minimization of E, APL, and VD using MOGWO and MOHHO to achieve the PFNDSs. The BCS of E, APL, and VD of the proposed techniques are the following:
  • E: 1.0323 [ton/h] and 1.0053 [ton/h] for MOGWO and MOHHO, respectively.
  • APL: 13.2255 [MW] and 13.7882 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.7711 [p.u.] and 0.7294 [p.u.] for MOGWO and MOHHO, respectively.
Figure 14d displays PFNDSs for this case that were obtained by MOGWO and MOHHO.

4.2.3. Quad Objective OPF on IEEE 57-Bus

The last type of OFs in this paper represents the Quad OFs on the IEEE 57-bus, as shown in Table 2. In one case study, Quad OFs were suggested to solve MOOPF of this type. It can be summarized as follows:
  • Case #21: Minimization of FC, E, APL, and VD voltage deviation
The OFs that were simultaneously optimized using MOGWO and MOHHO to produce the PFNDSs are FC, APL, E, and VD. The BCS of the proposed techniques for FC, APL, E, and VD are as follows:
  • FC: 42,876.63 [$/h] and 42,241.61 [$/h] for MOGWO and MOHHO, respectively.
  • E: 1.0801 [ton/h] and 1.2809 [ton/h] for MOGWO and MOHHO, respectively.
  • APL: 11.8224 [MW] and 16.2366 [MW] for MOGWO and MOHHO, respectively.
  • VD: 0.8300 [p.u.] and 0.8384 [p.u.] for MOGWO and MOHHO, respectively.
The best result and OCV for Tri and Quad OFs on this system obtained by MOGWO and MOHHO for Cases (17–21) are illustrated in Table 6 and Table 7. From Figure 14a–d, it can be observed that the PFNDSs obtained by MOGWO are better distributed than the PFNDSs obtained by MOHHO. Using the developed techniques MOGWO and MOHHO, Figure 15a–e shows the voltage magnitude values of the Triple and Quad OFs for Cases (17–21). As seen in Figure 15a–e, this figure demonstrates that the solutions found by MOGWO and MOHHO are effective in cases 18–21 (when VD is OFs) and infeasible in case 17 (where VD is not OFs).

4.3. Discussion

Due to the poor convergence to the Pareto front solutions of other multi-objective methods, these algorithms tend to converge to a local optimum, while the developed approaches, MOGWO and MOHHO, maintain well-distributed and good convergence characteristics. It is worth mentioning, it is more difficult to obtain the optimal solution for all objective functions to solve multi-objective optimizing problems, based on the “no free lunch” theorem which states “none of the meta-heuristics algorithms can be talented to resolve all optimization problems” [74]. From the analysis of the results presented in Table 5, Table 6, Table 10 and Table 11, it appears that the developed approaches, MOGWO and MOHHO, have very good results in relation to other methods presented in the literature, for different test cases.

4.4. Performance Comparison

The performance of the developed approaches, MOGWO and MOHHO, to solve MOOPF problems in power systems is presented in this subsection. The developed approaches MOGWO and MOHHO were performed in MOOPF to obtain well-distribution and BCS in PFNDSs. Two challenges faced by the researchers to solve MOOPF problems are to achieve both well-distribution and the global optimum of PFNDSs. In another sense, it should be achieving the balance between coverage and convergence that confirms the superiority and efficiency of the developed approaches. Based on the “no-free lunch” theorem (NFL), the optimal solution of whole problems cannot be achieved by one metaheuristic algorithm [74]. Therefore, no metaheuristic algorithm is superior to the other algorithms on all sides (convergence and coverage). In other words, it is more difficult to select the best algorithm to solve MOOPF problems and find the best solutions to whole problems, as shown in Table 5, Table 6, Table 10 and Table 11. The performance of the developed approaches MOGWO and MOHHO is high, and the numerical results are high-quality in MOOPF. The competition is very good in terms of computational times with other methods. Based on a high-quality random search, the numerical results of the conflicting OFs provide trade-off solutions for each OF. In PFNDSs, the well-distribution and high efficiency of the developed approaches MOGWO and MOHHO are provided.

5. Conclusions

In this study, the authors developed two popular meta-heuristic optimization techniques, Grey Wolf Optimizer (GWO) and Harris Hawks Optimization (HHO), to solve MOOPF problems. These techniques were named Multi-Objective GWO (MOGWO) and Multi-Objective HHO (MOHHO). Various conflicting objectives were optimized simultaneously, such as fuel cost, actual power losses, emission, and voltage deviation of all buses. Pareto concept optimization is the method that is integrated with the proposed algorithms to find Pareto front non-dominated solutions (PFNDSs). Fuzzy membership function (FMF) and crowding distance (CD) are the methods used to extract the best compromise solution (BCS) and arrange and improve the Pareto front solutions, respectively. The developed techniques MOGWO and MOHHO were proposed to find BCS of multiple conflicting OFs (Bi, Tri, Quad). Two different power systems—the IEEE 30-bus power system and the IEEE 57-bus power system, with 21 cases of various objective functions—were used to verify the performance of the proposed techniques, MOGWO and MOHHO. The best compromise solutions obtained by MOGWO and MOHHO confirmed the efficiency of the developed approaches in providing well-distributed Pareto-front non-dominated solutions. The best compromise solutions produced by the developed approaches were compared with other optimization techniques to show the effectiveness and superiority of the MOGWO and MOHHO approaches. The developed approaches provide a favorable performance and competitive optimizer to solve MOOPF problems in power systems. The conclusion from the simulation results can be summarized briefly as follows:
  • The proposed approaches (MOGWO and MOHHO) demonstrate efficient performance to solve MOOPF problems when applied to two standard power systems, IEEE 30-bus and IEEE 57-bus.
  • Compared with other new metaheuristic optimization techniques, the proposed approaches confirmed the superiority of these approaches to solve MOOPF problems.
  • The proposed approaches provide good distribution on the Pareto front and more balance for multiple objective OPF.
  • The standard power systems that were proposed, IEEE 30-bus and IEEE 57-bus, provide high performance in solving MOOPF problems.
Due to the limited number of pages, more improvements cannot be made to cover different OPF problems.
  • This study is limited to addressing conventional power systems, such as IEEE 30-bus and IEEE 57-bus, and may not necessarily be applied to other systems.
  • The comparison is unfair because it does not include all algorithms; maybe other algorithms not listed in this paper have the best results.
  • Some parameters may affect the final results when applied to other systems.
Future research can employ the proposed methods MOGWO and MOHHO to solve MOOPF problems with more complex power systems and control variables such as IEEE 118-bus and IEEE 300-bus systems. The techniques that were developed can also be employed to address more problems with optimization with such sizing to include FACTS devices, distributed generation, and renewable energy sources in power systems, as well as economic dispatch and optimal location.

Author Contributions

Conceptualization, M.A.-K. and V.D.; methodology, M.A.-K.; software, M.A.-K.; validation, M.A.-K., V.D. and M.E.; formal analysis, M.A.-K.; investigation, M.A.-K. and V.D.; data curation, M.A.-K.; writing—original draft preparation, M.A.-K.; writing—review and editing, V.D. and M.E.; visualization, M.A.-K. and V.D.; supervision, V.D. and M.E.; project administration, M.E.; funding acquisition, V.D. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by a grant of the Ministry of Research, Innovation and Digitalization, project number PNRR-C9-I8-760090/23.05.2023, code CF 30/14.11.2022.

Data Availability Statement

The data supporting the reported results are available in the manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

OPFOptimal power flow
MOOPFMulti-objective optimal power flow
OFsObjective functions
GWOGrey Wolf Optimizer
HHOHarris Hawks Optimization
MOGWOMulti Objective Grey Wolf Optimizer
MOHHOMulti Objective Harris Hawks Optimization
FCFuel costs
APLActive power losses
EEmission
VDVoltage deviation
BCSBest compromise solution
FMFFuzzy membership function
NDSsnon-dominated solutions
PCPareto concept
CDCrowding distance
PFNDSsPareto front non-dominated solutions
OCVoptimal control variables
NFLNo free lunch theorem

Appendix A

Table A1. The coefficients of cost and emission for IEEE 30 bus.
Table A1. The coefficients of cost and emission for IEEE 30 bus.
Coefficient
G1G2G5G8G11G13
Fuel cost
a0000000
b21.7513.2533
c0.003750.01750.06250.008340.0250.025
Emission
α4.0912.5434.2585.3264.2586.131
β−5.554−6.047−5.094−3.55−5.094−5.555
γ6.495.6384.5863.384.5865.151
ζ2.00 × 10−45.00 × 10−41.00 × 10−62.00 × 10−31.00 × 10−61.00 × 10−5
λ2.8573.338286.67
Figure A1. The single line diagram of IEEE 30 bus system.
Figure A1. The single line diagram of IEEE 30 bus system.
Energies 17 02209 g0a1
Figure A2. The single line diagram of IEEE 57 bus system.
Figure A2. The single line diagram of IEEE 57 bus system.
Energies 17 02209 g0a2
Table A2. The coefficients of cost and emission of generators for IEEE 57-bus.
Table A2. The coefficients of cost and emission of generators for IEEE 57-bus.
Coefficient
G1G2G3G6G8G9G12
Fuel cost
a0000000
b21.753211.753.25
c0.003750.01750.0250.003750.06250.01950.00834
Emission
α4.0912.5436.1313.4914.2582.7545.326
β−5.554−6.047−5.555−5.754−5.094−5.847−3.555
γ6.495.6385.1516.394.5865.2383.38
ζ2.0 × 10−45.0 × 10−41.0 × 10−53.0 × 10−41.0 × 10−64.0 × 10−42.0 × 10−3
λ2.857 × 10−13.33 × 10−16.67 × 10−12.66 × 10−18.0 × 10−12.88 × 10−12.0 × 10−1

References

  1. Ghasemi, M.; Ghavidel, S.; Akbari, E.; Vahed, A.A. Solving non-linear, non-smooth and non-convex optimal power flow problems using chaotic invasive weed optimization algorithms based on chaos. Energy 2014, 73, 340–353. [Google Scholar] [CrossRef]
  2. Carpentier, J. Contribution to the economic dispatch problem. Bull. Soc. Fr. Electr. 1962, 3, 431–447. [Google Scholar]
  3. Al Ameri, A.; Nichita, C.; Dakyo, B. An efficient algorithm for power load flow solutions by schur complement and threshold technique. Int. J. Adv. Res. Electr. Electron. Instrum. Eng. 2014, 3, 11062–11069. [Google Scholar]
  4. Syai’in, M.; Soeprijanto, A. Improved algorithm of Newton Raphson power flow using GCC limit based on neural network. Int. J. Electr. Comput. Sci. 2012, 12, 7–12. [Google Scholar]
  5. Singhal, K. Comparison between load flow analysis methods in power system using MATLAB. Int. J. Sci. Eng. Res. 2014, 5, 1412–1419. [Google Scholar]
  6. Salgado, R.; Schiochet, A.; Barboza, L. Multi-objective optimal power flow solutions through a parameterized model. In Proceedings of the Eighth World Energy System Conference, Valahia, Romania, 1–3 July 2010. [Google Scholar]
  7. Habibollahzadeh, H.; Luo, G.; Semlyen, A. Hydrothermal optimal power flow based on a combined linear and nonlinear programming methodology. IEEE Trans. Power Syst. 1989, 4, 530–537. [Google Scholar] [CrossRef]
  8. Momoh, J.; Zhu, J. Improved interior point method for OPF problems. IEEE Trans. Power Syst. 1999, 14, 1114–1120. [Google Scholar] [CrossRef]
  9. Aoki, K.; Nishikori, A.; Yokoyama, R. Constrained load flow using recursive quadratic programming. IEEE Trans. Power Syst. 1987, 2, 8–16. [Google Scholar] [CrossRef]
  10. Mirjalili, S.; Gandomi, A.; Mirjalili, S.; Saremi, S.; Faris, H.; Mirjalili, S. Salp Swarm Algorithm: A bio-inspired optimizer for engineering design problems. Adv. Eng. Softw. 2017, 114, 163–191. [Google Scholar] [CrossRef]
  11. Hayyolalam, V.; Kazem, A. Black widow optimization algorithm: A novel meta-heuristic approach for solving engineering optimization problems. Eng. Appl. Artif. Intell. 2020, 87, 103249. [Google Scholar] [CrossRef]
  12. Zhao, W.; Zhang, Z.; Wang, L. Manta ray foraging optimization: An effective bio-inspired optimizer for engineering applications. Eng. Appl. Artif. Intell. 2020, 87, 103300. [Google Scholar] [CrossRef]
  13. Hashim, F.; Houssein, E.; Mabrouk, M.; Al-Atabany, W.; Mirjalili, S. Henry gas solubility optimization: A novel physics-based algorithm. Futur. Gener. Comput. Syst. 2019, 101, 646–667. [Google Scholar] [CrossRef]
  14. Al-kaabi, M.; Al-Bahrani, L. Modified Artificial Bee Colony Optimization Technique with Different Objective Function of Constraints Optimal Power Flow. Int. J. Intell. Eng. Syst. 2020, 13, 378–388. [Google Scholar] [CrossRef]
  15. Dai, H.; Huang, G.; Zeng, H. Multi-objective optimal dispatch strategy for power systems with Spatio-temporal distribution of air pollutants. Sustain. Cities Soc. 2023, 98, 104801. [Google Scholar] [CrossRef]
  16. Al-Bahrani, L.; Al-kaabi, M.; Al-saadi, M.; Dumbrava, V. Optimal power flow based on differential evolution optimization technique. U.P.B. Sci. Bull. Ser. C 2020, 82, 378–388. [Google Scholar]
  17. Ali, A.; Altahir, A.; Alwash, S.; Al-Kaabi, M. Multi-objective optimal dispatch strategy for power systems with Spatio-temporal distribution of air pollutants. Investigation Study of Injecting Numerous DGs in IEEE 69–bus Radial Networks Using Enhanced PSO and Ant Lion Optimization Algorithms. In Proceedings of the 2023 3rd International Conference on Electrical Machines and Drives (ICEMD), Tahran, Iran, 20–21 December 2023; pp. 1–7. [Google Scholar]
  18. Al-Bahrani, L.; Al-Kaabi, M.; Al-Hasheme, J. Solving Optimal Power Flow Problem Using Improved Differential Evolution Algorithm. Int. J. Electr. Electron. Eng. Telecommun. 2022, 11, 146–155. [Google Scholar] [CrossRef]
  19. Al-Kaabi, M.; Al-Bahrani, L.; Dumbrava, V.; Eremia, M. Optimal Power Flow with Four Objective Functions using Improved Differential Evolution Algorithm: Case Study IEEE 57-bus power system. In Proceedings of the 2021 10th International Conference on ENERGY and ENVIRONMENT (CIEM), Bucharest, Romania, 14–15 October 2021; pp. 1–5. [Google Scholar]
  20. Al-Kaabi, M.; Al Hasheme, J.; Dumbrava, V.; Eremia, M. Application of Harris Hawks Optimization (HHO) Based on Five Single Objective Optimal Power Flow. In Proceedings of the 2022 14th International Conference on Electronics, Computers and Artificial Intelligence (ECAI), Ploesti, Romania, 30 June–1 July 2022; pp. 1–8. [Google Scholar]
  21. Al-Kaabi, M.; Dumbrava, V.; Eremia, M. Application of Harris Hawks Optimization in Single Objective Optimal Power Flow. In Proceedings of the 2023 15th International Conference on Electronics, Computers and Artificial Intelligence (ECAI), Bucharest, Romania, 29–30 June 2023; pp. 1–6. [Google Scholar]
  22. AL-Kaabi, M.; Salih, S.; Hussein, A.; Dumbrava, V.; Eremia, M. Optimal Power Flow Based on Grey Wolf Optimizer: Case Study Iraqi Super Grid High Voltage 400 kV. In Proceedings of the 2nd International Conference on Emerging Technologies and Intelligent Systems: ICETIS 2022, Sanya, China, 20–22 January 2022; Springer: Cham, Switzerland, 2023; Volume 1, pp. 490–503. [Google Scholar]
  23. Al-Kaabi, M.; Al-Bahrani, L.; Al Hasheme, J. Improved Differential Evolution Algorithm to solve multi-objective of optimal power flow problem. Arch. Electr. Eng. 2022, 71, 641–657. [Google Scholar]
  24. Al-Kaabi, M.; Dumbrava, V.; Eremia, M. A Slime Mould Algorithm Programming for Solving Single and Multi-Objective Optimal Power Flow Problems with Pareto Front Approach: A Case Study of the Iraqi Super Grid High Voltage. Energies 2022, 15, 7473. [Google Scholar] [CrossRef]
  25. AL-Kaabi, M.; Dumbrava, V.; Eremia, M.; Toma, L.; Lazaroiu, C.; Hussein, B. A New Approach Meta-Heurestics Optimization Techniques to Solve Multi Objective Optimal Power Flow Problems. In Proceedings of the 2023 11th International Conference on ENERGY and ENVIRONMENT (CIEM), Bucharest, Romania, 26–27 October 2023; pp. 1–5. [Google Scholar]
  26. Al-Kaabi, M.; Dumbrava, V.; Eremia, M. Single and Multi-Objective Optimal Power Flow Based on Hunger Games Search with Pareto Concept Optimization. Energies 2022, 15, 8328. [Google Scholar] [CrossRef]
  27. AL-Kaabi, M.; Dumbrava, V.; Eremia, M.; Toma, L.; Lazaroiu, C.; Aljanabi, H. Multi Objective Optimal Power Flow Problems Using Hunger Games Search Algorithm. In Proceedings of the 2023 11th International Conference on ENERGY and ENVIRONMENT (CIEM), Bucharest, Romania, 26–27 October 2023; pp. 1–5. [Google Scholar]
  28. Liang, R.; Wu, C.; Chen, Y.; Tseng, W. Multi-objective dynamic optimal power flow using improved artificial bee colony algorithm based on Pareto optimization. Int. Trans. Electr. Energy Syst. 2016, 26, 692–712. [Google Scholar] [CrossRef]
  29. Warid, W. Optimal power flow using the AMTPG-Jaya algorithm. Appl. Soft Comput. 2020, 91, 106252. [Google Scholar] [CrossRef]
  30. Sivasubramani, S.; Swarup, K. Multi-objective harmony search algorithm for optimal power flow problem. Int. J. Electr. Power Energy Syst. 2011, 33, 745–752. [Google Scholar] [CrossRef]
  31. Mandal, B.; Roy, P. Multi-objective optimal power flow using quasi-oppositional teaching learning based optimization. Appl. Soft Comput. 2014, 21, 590–606. [Google Scholar] [CrossRef]
  32. Bilel, N.; Mohamed, N.; Zouhaier, A.; Lotfi, R. An improved imperialist competitive algorithm for multi-objective optimization. Eng. Optim. 2016, 48, 1823–1844. [Google Scholar] [CrossRef]
  33. Chen, H.; Bo, M.; Zhu, Y. Multi-hive bee foraging algorithm for multi-objective optimal power flow considering the cost, loss, and emission. Int. J. Electr. Power Energy Syst. 2014, 60, 203–220. [Google Scholar] [CrossRef]
  34. Zhang, J.; Tang, Q.; Li, P.; Deng, D.; Chen, Y. A modified MOEA/D approach to the solution of multi-objective optimal power flow problem. Appl. Soft Comput. 2016, 47, 494–514. [Google Scholar] [CrossRef]
  35. Huy, T.H.B.; Kim, D.; Vo, D.N. Multiobjective Optimal Power Flow Using Multiobjective Search Group Algorithm. IEEE Access 2022, 10, 77837–77856. [Google Scholar] [CrossRef]
  36. Yuan, X.; Zhang, X.; Wang, P.; Liang, J.; Yuan, Y.; Huang, Y.; Lei, X. Multi-objective optimal power flow based on improved strength Pareto evolutionary algorithm. Energy 2017, 122, 70–82. [Google Scholar] [CrossRef]
  37. Karthik, N.; Parvathy, A.; Arul, R.; Padmanathan, K. Multi-objective optimal power flow using a new heuristic optimization algorithm with the incorporation of renewable energy sources. Int. J. Energy Environ. Eng. 2021, 12, 641–678. [Google Scholar] [CrossRef]
  38. Meng, A.; Zeng, C.; Wang, P.; Chen, D.; Zhou, T.; Zheng, X.; Yin, H. A high-performance crisscross search based grey wolf optimizer for solving optimal power flow problem. Energy 2021, 225, 120211. [Google Scholar] [CrossRef]
  39. Long, W.; Cai, S.; Jiao, J.; Xu, M.; Wu, T. A new hybrid algorithm based on grey wolf optimizer and cuckoo search for parameter extraction of solar photovoltaic models. Energy Convers. Manag. 2020, 203, 112243. [Google Scholar] [CrossRef]
  40. Qin, H.; Fan, P.; Tang, H.; Huang, P.; Fang, B.; Pan, S. An effective hybrid discrete grey wolf optimizer for the casting production scheduling problem with multi-objective and multi-constraint. Comput. Ind. Eng. 2019, 128, 458–476. [Google Scholar] [CrossRef]
  41. Birogul, S. Hybrid harris hawk optimization based on differential evolution (HHODE) algorithm for optimal power flow problem. IEEE Access 2019, 7, 184468–184488. [Google Scholar] [CrossRef]
  42. Dhawale, D.; Kamboj, V.; Anand, P. An improved Chaotic Harris Hawks Optimizer for solving numerical and engineering optimization problems. Eng. Comput. 2023, 39, 1183–1228. [Google Scholar] [CrossRef]
  43. Mirjalili, S.; Mirjalili, S.; Lewis, A. Grey wolf optimizer. Adv. Eng. Softw. 2014, 69, 46–61. [Google Scholar] [CrossRef]
  44. Heidari, A.; Mirjalili, S.; Faris, H.; Aljarah, I.; Mafarja, M.; Chen, H. Harris hawks optimization: Algorithm and applications. Futur. Gener. Comput. Syst. 2019, 97, 849–872. [Google Scholar] [CrossRef]
  45. Ngatchou, P.; Zarei, A.; El-Sharkawi, A. Pareto multi objective optimization. In Proceedings of the 13th International Conference on, Intelligent Systems Application to Power Systems, Arlington, VA, USA, 6–10 November 2005; pp. 84–91. [Google Scholar]
  46. Fortin, F.; Parizeau, M. Revisiting the NSGA-II crowding-distance computation. In Proceedings of the 15th Annual Conference on Genetic and Evolutionary Computation, Amsterdam, The Netherlands, 6–10 July 2013; pp. 623–630. [Google Scholar]
  47. Khunkitti, S.; Siritaratiwat, A.; Premrudeepreechacharn, S. Multi-Objective optimal power flow problems based on Slime mould algorithm. Sustainability 2021, 13, 7448. [Google Scholar] [CrossRef]
  48. Premkumar, M.; Jangir, P.; Sowmya, R.; Elavarasan, R. Many-Objective Gradient-Based Optimizer to Solve Optimal Power Flow Problems: Analysis and Validations. Eng. Appl. Artif. Intell. 2021, 106, 104479. [Google Scholar] [CrossRef]
  49. Abd El-Sattar, S.; Kamel, S.; El Sehiemy, R.; Jurado, F.; Yu, J. Single-and multi-objective optimal power flow frameworks using Jaya optimization technique. Neural Comput. Appl. 2019, 31, 8787–8806. [Google Scholar] [CrossRef]
  50. IEEE Power Systems Test Case. Available online: http://www.ee.washington.edu/research/pstca/ (accessed on 1 May 2024).
  51. Kahraman, H.; Akbel, M.; Duman, S. Optimization of optimal power flow problem using multi-objective manta ray foraging optimizer. Appl. Soft Comput. 2022, 116, 108334. [Google Scholar] [CrossRef]
  52. Niknam, T.; rasoul Narimani, M.; Jabbari, M.; Malekpour, A. A modified shuffle frog leaping algorithm for multi-objective optimal power flow. Energy 2011, 36, 6420–6432. [Google Scholar] [CrossRef]
  53. Shaheen, A.; El-Sehiemy, R.; Farrag, S. Solving multi-objective optimal power flow problem via forced initialised differential evolution algorithm. IET Gener. Transm. Distrib. 2016, 10, 1634–1647. [Google Scholar] [CrossRef]
  54. Biswas, P.; Suganthan, P.; Mallipeddi, R.; Amaratunga, G. Multi-objective optimal power flow solutions using a constraint handling technique of evolutionary algorithms. Soft Comput. 2020, 24, 2999–3023. [Google Scholar] [CrossRef]
  55. Kumari, M.; Maheswarapu, S. Enhanced genetic algorithm based computation technique for multi-objective optimal power flow solution. Int. J. Electr. Power Energy Syst. 2010, 32, 736–742. [Google Scholar] [CrossRef]
  56. Pulluri, H.; Naresh, R.; Sharma, V. An enhanced self-adaptive differential evolution based solution methodology for multiobjective optimal power flow. Appl. Soft Comput. 2017, 54, 229–245. [Google Scholar] [CrossRef]
  57. Ghasemi, M.; Ghavidel, S.; Ghanbarian, M.; Gitizadeh, M. Multi-objective optimal electric power planning in the power system using Gaussian bare-bones imperialist competitive algorithm. Inf. Sci. 2015, 294, 286–304. [Google Scholar] [CrossRef]
  58. Medina, M.; Das, S.; Coello, C.; Ramírez, J. Decomposition-based modern metaheuristic algorithms for multi-objective optimal power flow–A comparative study. Eng. Appl. Artif. Intell. 2014, 32, 10–20. [Google Scholar] [CrossRef]
  59. Chen, G.; Qian, J.; Zhang, Z.; Sun, Z. Applications of novel hybrid bat algorithm with constrained Pareto fuzzy dominant rule on multi-objective optimal power flow problems. IEEE Access 2019, 7, 52060–52084. [Google Scholar] [CrossRef]
  60. Qian, J.; Wang, P.; Pu, C.; Chen, G. Joint application of multi-object beetle antennae search algorithm and BAS-BP fuel cost forecast network on optimal active power dispatch problems. Knowl.-Based Syst. 2021, 226, 107149. [Google Scholar] [CrossRef]
  61. Chen, G.; Yi, X.; Zhang, Z.; Wang, H. Applications of multi-objective dimension-based firefly algorithm to optimize the power losses, emission, and cost in power systems. Appl. Soft Comput. 2018, 68, 322–342. [Google Scholar] [CrossRef]
  62. Abido, M.; Al-Ali, N. Multi-objective optimal power flow using differential evolution. Arab. J. Sci. Eng. 2012, 37, 991–1005. [Google Scholar] [CrossRef]
  63. Qian, J.; Wang, P.; Pu, C.; Peng, X.; Chen, G. Application of modified beetle antennae search algorithm and BP power flow prediction model on multi-objective optimal active power dispatch. Appl. Soft Comput. 2021, 113, 108027. [Google Scholar] [CrossRef]
  64. Chen, G.; Qian, J.; Zhang, Z.; Li, S. Application of modified pigeon-inspired optimization algorithm and constraint-objective sorting rule on multi-objective optimal power flow problem. Appl. Soft Comput. 2020, 92, 106321. [Google Scholar] [CrossRef]
  65. Chen, G.; Qian, J.; Zhang, Z.; Sun, Z. Multi-Objective Optimal Power Flow Based on Hybrid Firefly-Bat Algorithm and Constraints- Prior Object-Fuzzy Sorting Strategy. IEEE Access 2019, 7, 139726–139745. [Google Scholar] [CrossRef]
  66. Chaib, A.; Bouchekara, H.; Mehasni, R.; Abido, M. Optimal power flow with emission and non-smooth cost functions using backtracking search optimization algorithm. Int. J. Electr. Power Energy Syst. 2016, 81, 64–77. [Google Scholar] [CrossRef]
  67. Ouafa, H.; Linda, S.; Tarek, B. Multi-objective optimal power flow considering the fuel cost, emission, voltage deviation and power losses using Multi-Objective Dragonfly algorithm. In Proceedings of the International Conference on Recent Advances in Electrical Systems, Hammamet, Tunisia, 22–24 December 2017. [Google Scholar]
  68. Ghasemi, M.; Ghavidel, S.; Ghanbarian, M.; Gharibzadeh, M.; Vahed, A. Multi-objective optimal power flow considering the cost, emission, voltage deviation and power losses using multi-objective modified imperialist competitive algorithm. Energy 2014, 78, 276–289. [Google Scholar] [CrossRef]
  69. Zhang, J.; Wang, S.; Tang, Q.; Zhou, Y.; Zeng, T. An improved NSGA-III integrating adaptive elimination strategy to solution of many-objective optimal power flow problems. Energy 2019, 172, 945–957. [Google Scholar] [CrossRef]
  70. Taher, M.; Kamel, S.; Jurado, F.; Ebeed, M. An improved moth-flame optimization algorithm for solving optimal power flow problem. Int. Trans. Electr. Energy Syst. 2019, 29, e2743. [Google Scholar] [CrossRef]
  71. Naderi, E.; Pourakbari-Kasmaei, M.; Cerna, F.; Lehtonen, M. A novel hybrid self-adaptive heuristic algorithm to handle single-and multi-objective optimal power flow problems. Int. J. Electr. Power Energy Syst. 2021, 125, 106492. [Google Scholar] [CrossRef]
  72. Bouchekara, H. Optimal power flow using black-hole-based optimization approach. Appl. Soft Comput. 2014, 24, 879–888. [Google Scholar] [CrossRef]
  73. Bhattacharya, A.; Chattopadhyay, P. Application of biogeography-based optimisation to solve different optimal power flow problems. IET Gener. Transm. Distrib. 2010, 5, 70–80. [Google Scholar] [CrossRef]
  74. Wolpert, D.; Macready, W. No Free Lunch Theorems for Search; Technical Report SFI-TR-95-02-010; Santa Fe Institute: Santa Fe, NM, USA, 1995. [Google Scholar]
  75. Shaheen, A.; El-Sehiemy, R.; Alharthi, M.; Ghoneim, S.; Ginidi, A. Multi-objective jellyfish search optimizer for efficient power system operation based on multi-dimensional OPF framework. Energy 2021, 237, 121478. [Google Scholar] [CrossRef]
  76. Shaheen, A.; El-Sehiemy, R.; Hasanien, H.; Ginidi, A. An improved heap optimization algorithm for efficient energy management based optimal power flow model. Energy 2022, 250, 123795. [Google Scholar] [CrossRef]
Figure 1. Hierarchy of grey wolf.
Figure 1. Hierarchy of grey wolf.
Energies 17 02209 g001
Figure 2. Flowchart of GWO.
Figure 2. Flowchart of GWO.
Energies 17 02209 g002
Figure 3. Flowchart of HHO.
Figure 3. Flowchart of HHO.
Energies 17 02209 g003
Figure 4. Fuzzy membership function.
Figure 4. Fuzzy membership function.
Energies 17 02209 g004
Figure 5. CD estimation.
Figure 5. CD estimation.
Energies 17 02209 g005
Figure 6. The flowchart of MOGWO.
Figure 6. The flowchart of MOGWO.
Energies 17 02209 g006
Figure 7. The flowchart of MOHHO.
Figure 7. The flowchart of MOHHO.
Energies 17 02209 g007
Figure 8. The Pareto fronts non-dominated solutions (PFNDSs) for Cases (1–5).
Figure 8. The Pareto fronts non-dominated solutions (PFNDSs) for Cases (1–5).
Energies 17 02209 g008
Figure 9. The voltage profiles (VD) for Cases (1–5).
Figure 9. The voltage profiles (VD) for Cases (1–5).
Energies 17 02209 g009
Figure 10. The Pareto fronts non-dominated solutions for Cases (6–9).
Figure 10. The Pareto fronts non-dominated solutions for Cases (6–9).
Energies 17 02209 g010
Figure 11. The voltage profiles for Cases (6–10).
Figure 11. The voltage profiles for Cases (6–10).
Energies 17 02209 g011aEnergies 17 02209 g011b
Figure 12. PFNDSs for Cases (11–16).
Figure 12. PFNDSs for Cases (11–16).
Energies 17 02209 g012
Figure 13. The voltage profiles for Cases (11–16).
Figure 13. The voltage profiles for Cases (11–16).
Energies 17 02209 g013
Figure 14. PFNDSs for Cases (17–20).
Figure 14. PFNDSs for Cases (17–20).
Energies 17 02209 g014
Figure 15. The voltage profiles for Cases (17–21).
Figure 15. The voltage profiles for Cases (17–21).
Energies 17 02209 g015aEnergies 17 02209 g015b
Table 1. The characteristics of two systems (IEEE 30-bus and IEEE 57-bus).
Table 1. The characteristics of two systems (IEEE 30-bus and IEEE 57-bus).
CharacteristicsIEEE 30-BusIEEE 57-Bus
Buses3057
Branches4180
Generators97
The limits of PV voltages [p.u.]0.90–1.10.90–1.1
The limits of PQ voltages [p.u.]0.95–1.050.94–1.06
Limit of tap changer setting [p.u.]0.90–1.10.90–1.1
Limit of source VAR [MVAr]0–50–20
Shunts93
Transformers417
MW demand283.41250.8
Control variables 2433
Table 2. Various case studies.
Table 2. Various case studies.
SystemType of OF(s)Case #FCEAPLVDVSI
IEEE 30-bus Bi-OF(s)1
2
3
4
5
Triple-OF(s)6
7
8
9
Quad-OF(s)10
IEEE 57-busBi-OF(s)11
12
13
14
15
16
Triple-OF(s)17
18
19
20
Quad-OF(s)21
Table 3. OCVs obtained by MOGWO and MOHHO for Cases (1–5) IEEE 30 bus test system.
Table 3. OCVs obtained by MOGWO and MOHHO for Cases (1–5) IEEE 30 bus test system.
ItemCase #1Case #2Case #3Case #4Case #5
MOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHO
Pg [MW] P 1 115.77123.40128.246129.794175.797178.87868.35068.56462.13184.455
P 2 57.86756.25649.36148.64049.57848.51066.68071.88778.14572.392
P 5 27.98626.17531.62332.26219.94321.37049.80547.98149.39948.230
P 8 34.87733.28733.61434.95221.34019.94934.68233.08734.99324.654
P 11 25.80025.78227.62820.37712.60512.06229.56828.91925.00627.280
P 13 26.40824.53718.47523.12313.31712.00039.63038.34437.69031.012
Vg [p.u.] V 1 1.0991.0901.0991.0981.0851.0771.0051.0351.0231.034
V 2 1.0891.0901.0861.0791.0621.0630.9680.9991.0151.034
V 5 1.0661.0901.0611.0521.0381.0310.9840.9921.0141.001
V 8 1.0711.0901.0751.0611.0431.0401.0111.0451.0131.010
V 11 1.0951.0901.0821.0861.0251.0701.0811.0631.0391.037
V 13 1.0921.0901.0841.0771.0471.0341.0671.0430.9941.094
Shunt Element [MVAr] Q c 10 1.8763.3993.4842.5323.2793.7164.0071.6483.6313.769
Q C 12 1.4561.7760.6560.1652.2170.9943.1343.1993.3501.263
Q c 15 3.5671.9591.3733.3442.5572.5800.3420.3622.2500.099
Q 17 1.7201.8693.3093.9274.1222.1151.6382.6494.2971.309
Q c 20 4.5082.1072.1530.8992.5734.9814.7571.4163.8983.222
Q 21 2.8031.5104.2790.7932.4151.6583.9994.0714.9120.957
Q c 23 2.6552.2021.9613.1931.2480.4784.9041.0763.4370.217
Q 24 1.7190.2253.5564.0113.9484.3111.5061.9444.6142.427
Q 29 2.2401.0092.5782.2262.0052.4703.5091.4061.5322.609
Tap Position T 11 1.0241.0191.0391.0591.0271.0181.0800.9660.9511.031
T 12 1.0481.0851.0870.9951.0501.0191.0201.0360.9910.962
T 15 0.9780.9700.9521.0060.9591.0480.9621.0140.9801.057
T 36 0.9860.9971.0070.9871.0030.9930.9580.9660.9510.957
FC [$/h]832.82826.785825.91824.624801.39801.305945.01935.569947.59910.300
loss [MW]5.29366.01845.5275.72689.19179.34805.29354.02303.73474.6037
Em [ton/h]0.24550.25530.24680.26350.32640.37110.20680.20860.19810.2269
VD [p.u.]1.21581.15310.97660.92310.34570.33210.14030.25530.15570.2517
The BCS of OFs are given in bold.
Table 4. OCVs obtained by MOGWO and MOHHO for Cases (6–10) IEEE 30 bus.
Table 4. OCVs obtained by MOGWO and MOHHO for Cases (6–10) IEEE 30 bus.
ItemCase #6Case #7Case #8Case #9Case #10
MOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHO
Pg [MW] P 1 92.74796.8526120.350120.137126.606142.62857.85281.9629128.384119.263
P 2 59.05865.302261.61266.815960.90449.021475.38871.868057.12656.912
P 5 38.15140.335127.30025.374328.86735.352149.60541.209431.89436.532
P 8 34.95233.798131.86133.124834.27526.491934.87929.864327.77125.380
P 11 29.81429.038529.07724.445622.99819.901129.81725.212519.91222.304
P 13 33.03022.644919.75921.252316.27416.888539.42238.255224.92129.226
Vg [p.u.] V 1 1.0861.09281.0361.01551.0371.05651.0291.03261.0431.042
V 2 1.0721.09281.0161.01291.0251.04551.0181.02521.0261.042
V 5 1.0481.09281.0200.96260.9991.00980.9901.02521.0041.042
V 8 1.0631.09281.0071.03781.0131.02291.0091.02521.0001.042
V 11 1.0731.09281.0470.97401.0721.06741.0551.00721.0861.042
V 13 1.0781.09281.0311.07271.0221.05201.0401.02521.0691.042
Shunt Element [MVAr] Q c 10 0.0450.18041.8140.80212.5052.01473.2880.66282.1371.042
Q C 12 4.4120.10590.8820.10111.8130.83591.2910.41803.7711.042
Q c 15 2.3073.07773.2960.74152.5782.35312.7720.69482.9341.042
Q 17 3.7280.52211.0950.24401.5262.06502.2410.81632.3291.042
Q c 20 3.6271.39243.7871.44163.2693.04224.6213.41082.3213.076
Q 21 1.3091.99783.7203.80923.4041.64410.9692.41862.6063.076
Q c 23 2.4730.38110.5802.34014.3150.24792.9460.54151.8443.076
Q 24 2.4633.25204.7013.31283.9462.60193.1100.35010.7673.076
Q 29 2.4030.72252.6294.47774.6370.39211.6820.82272.1623.076
Tap Position T 11 1.0481.04601.0031.03350.9831.05251.0050.95761.0301.094
T 12 1.0581.06890.9900.95611.0250.96000.9960.96880.9861.006
T 15 1.0371.00190.9720.95640.9871.03570.9690.95671.0400.952
T 36 1.0171.00720.9570.98080.9800.97060.9570.95510.9760.972
FC [$/h]832.82873.071868.126832.565835.199824.613822.197955.313900.227827.75
loss [MW]5.29364.33194.55136.32686.80066.50356.86263.54294.95246.5865
Em [ton/h]0.24550.22000.22720.25310.25530.26610.28820.20630.21670.2625
VD [p.u.]1.21580.47200.61530.15840.21840.17330.27090.17330.21320.2575
The BCS of OFs are given in bold.
Table 5. Comparison of BCS for MOGWO and MOHHO with optimization methods for cases (1–2).
Table 5. Comparison of BCS for MOGWO and MOHHO with optimization methods for cases (1–2).
Case #1Case #2
MethodFC [$/h] E [ton/h] MethodFC [$/h] RPL [MW]
IMOMRFO [51]817.960.2736Jaya [49]817.136.04
MSFLA [52]823.2780.29078MO-DEA [53]820.88025.5949
MOEA/D-SF [54]829.5150.2501EGA [55]822.875.613
MOSGA [35]830.694 0.2495NSGA-II [30]823.88755.7699
ESDE-MC [56]830.719 0.2483QOTLBO [31]826.49545.2727
MGBICA [57]830.851 0.2484ESDE-MC [56]827.165.227
GBICA [57]830.8520.2488MOABC/D [58]827.6365.2451
NHBA-CPFD [59]830.9590.2350ESDE-EC [56]827.955.4524
ESDE-EC [56]831.0940.2510ESDE [56]828.8415.59
NMBAS [60] 831.4390.2337TLBO [31]828.535.2883
MODFA [61] 831.6650.2432DE [62]828.595.69
MHBAS [63] 832.0360.2337NMBAS [60] 831.1555.0707
MOIDEA [23]832.42830.2336MPIO-COSR [64]831.5585.1085
MPIO-COSR [64]832.4655 0.2351MOIDEA [23]831.841 5.17
NSGA-III [61]832.5323 0.2483NHBA [61]831.8513 5.1096
NHBA [59]832.64710.2375MHBAS [63] 832.12365.0566
MPIO-PFM [61]833.17030.2397MPIO-PFM [61]832.2274 5.1270
MDE [63]833.17280.2346HFBA-COFS [65]832.32035.0796
NSGA-II [61] 833.26050.2367DE-PFA [65]833.44655.1354
ESDE [56]833.47430.2540NSGA-II [61]833.5363 5.3483
MOPSO [61]833.71390.2492MDE [63] 833.7895.1517
BSA [66]835.020.2425MOHS [30]832.67095.3143
MOPSO [60]835.39880.2386NSGA-II [36]835.4445.16
MODA [67]838.60370.2536NSGA-III [61]836.81 5.1775
rNSGA-II [36]848.14990.2464MOPSO [61]837.3475.2635
NSGA-11 [36]850.92 0.2442MOMICA [68]848.0544 4.5603
SPEA2 [36]860.9830.2305MOSGA [35]848.56 4.8975
ISPEA [36]865.950.2234MODA [67]849.3526 4.814
MOHHO826.7850.2553MOPSO [60]852.8083 5.2310
MOGWO832.820.2455MOAGDE [51]856.8335.1224
OMNI [51]861.0515.6896
MO_RING_PSO_SCD [51]892.1414.8224
MOHHO824.62405.7268
MOGWO825.915.527
The values given in bold represent the proposed approaches.
Table 6. Comparison of BCS for MOGWO and MOHHO with other methods.
Table 6. Comparison of BCS for MOGWO and MOHHO with other methods.
Case #3Case #6
MethodFC [$/h] VD [p.u.] MethodFC [$/h] E [ton/h] RPL [MW]
MOIDEA [23]802.480.1452MOSGA [35]857.58060.22884.7379
MOSMA [24]802.0533 0.3267MOEA /D-SF [54]881.012 0.21644.1441
MOHGS [26]803.094 0.1813NMBAS [60] 863.82460.2123 4.2089
MOAGDE [51]821.9920.1285MPIO-PFM [61]866.0601 0.21604.4474
OMNI [51]838.2320.3317MOPSO [61]868.0536 0.21684.4576
MO_RING_PSO_SCD [51]844.6170.1571MHBAS [63]864.4699 0.21144.2476
MO-DEA [53]803.91160.1158MDE [63] 867.1991 0.21164.7428
DE [62]805.2620.1357MPIO-COSR [64] 863.9503 0.21264.3177
MOMICA [68]804.96110.0952HFBA-COFS [65]867.4262 0.21004.1544
NKEA [68]804.96120.099NSGA-II [65]867.9027 0.21115.0865
BB-MOPSO [68]804.96390.1021DE-PFA [65]869.9216 0.2087 4.2429
MNSGA-II [68]805.00760.0989I-NSGA-III [69]871.0220.22184.6004
MOICA [68]805.03450.1004NSGA-III [69]873.78110.22194.8522
IMFO [70]803.57150.0954FAHSPSO-DE [71]867.9808 0.26665.5638
I-NSGA-III [69]803.1290.1212MOHHO868.12600.22724.5513
NSGA-III [69]803.2410.1157MOGWO873.07060.22004.3319
BHBO [72]804.5980.1262
BBO [73]804.9980.102
MOHHO801.30530.3321
MOGWO801.390.3457
The values given in bold represent the proposed approaches.
Table 7. OCVs obtained by MOGWO and MOHHO for Cases (11–14) IEEE 57-bus test.
Table 7. OCVs obtained by MOGWO and MOHHO for Cases (11–14) IEEE 57-bus test.
ItemCase #11Case #12Case #13Case #14
MOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHO
Pg [MW] P 1 162.1359161.877164.044152.300149.9059171.865164.550154.1291
P 2 99.991293.15065.76777.06099.993675.36080.45259.2831
P 5 76.677782.56954.31059.257132.0398128.87053.16940.9314
P 8 99.148493.52483.28694.50692.216789.93453.12664.3804
P 11 364.6249357.647408.738378.438287.7559302.644473.914490.9300
P 13 97.801197.25089.87795.47098.757895.98081.22677.2354
Vg [p.u.] V 1 363.0426377.725397.310405.393402.2666396.967361.379384.8481
V 2 1.08931.0831.0661.0961.07931.0961.0161.0136
V 5 1.08541.0831.0701.0961.08851.0961.0180.9825
V 8 1.07441.0751.0601.0961.06211.0960.9971.0061
V 11 1.08791.0831.0631.0961.06551.0961.0110.9746
V 13 1.06941.0801.0601.0961.08931.0961.0130.9823
Shunt Element [MVAr] Q c 10 1.05431.0831.0581.0961.05931.0961.0321.0268
Q C 12 1.04401.0831.0591.0961.05971.0961.0121.0064
Q c 15 1.00541.0080.9631.0351.04561.0960.9580.9531
Q 17 0.92581.0730.9901.0840.93251.0751.0130.9735
Q c 20 1.01751.0830.9750.9590.98091.0460.9670.9677
Q 21 1.00461.0560.9971.0170.90841.0670.9560.9592
Q c 23 1.01470.9690.9560.9781.03100.9730.9910.9513
Q 24 1.08591.0831.0261.0460.94761.0511.0271.0060
Q 29 0.95621.0890.9551.0961.02081.0640.9540.9622
Tap Position T 11 1.02011.0830.9730.9671.09231.0410.9460.9859
T 12 1.01421.0760.9721.0000.90900.9980.9130.9532
T 15 0.91881.0460.9131.0661.06030.9820.9370.9645
T 36 0.91781.0460.9561.0331.01120.9750.9720.9527
FC [$/h]42,219.6742,408.0241,871.9341,994.5244,52844,25541,823.4841,985.63
Em [ton/h]1.09531.10131.28181.20030.99901.03841.42521.5251
loss [MW]12.623212.941612.533211.62412.136510.82017.020420.8913
VD [p.u.]4.13322.62703.15331.88311.64052.37050.70910.7565
The BCS of OFs are given in bold.
Table 8. OCVs obtained by MOGWO and MOHHO for Cases (15–18) IEEE 57 bus test.
Table 8. OCVs obtained by MOGWO and MOHHO for Cases (15–18) IEEE 57 bus test.
ItemCase #15Case #16Case #17Case #18
MOGWOMOHHOMOGWOMOHHOMOGWOMOHHOMOGWOMOHHO
Pg [MW] P 1 178.4164201.1055216.2864404.415149.786171.974141.049240.603
P 2 77.669757.301597.535075.49086.91089.67894.50679.597
P 5 118.2028127.5753137.489385.19973.53274.17689.76184.018
P 8 91.608963.054494.689759.62996.81393.56485.98877.359
P 11 292.4633358.4195284.0895213.733353.454342.315366.206359.180
P 13 97.179363.219496.980273.65695.43597.11890.62680.433
Vg [p.u.] V 1 406.9564393.3972341.4035363.971406.097393.719396.830345.021
V 2 1.03681.03440.99571.0211.0621.0831.0151.017
V 5 1.04171.02251.03311.0161.0681.0921.0121.020
V 8 1.02191.01351.01501.0121.0561.0910.9991.011
V 11 0.99910.98860.99230.9981.0511.0931.0111.007
V 13 1.02081.02271.01650.9841.0821.0911.0131.017
Shunt Element [MVAr] Q c 10 1.01211.01781.01711.0251.0911.0911.0471.010
Q C 12 1.01251.01131.03071.0131.0721.0911.0031.021
Q c 15 0.92510.98661.02860.9690.9901.0920.9371.025
Q 17 0.96170.95360.94550.9520.9301.0951.0130.951
Q c 20 0.95950.96220.95860.9520.9851.0520.9330.954
Q 21 0.95200.95000.95800.9640.9690.9940.9510.957
Q c 23 0.99250.95440.99130.9501.0541.0050.9871.022
Q 24 1.02921.03671.02571.0150.9520.9760.9971.039
Q 29 1.00020.96160.95600.9550.9101.0380.9820.951
Tap Position T 11 0.93250.95320.96960.9520.9731.0850.9560.955
T 12 0.93320.95880.95120.9521.0211.0700.9230.954
T 15 0.96970.95750.94800.9520.9821.0430.9300.952
T 36 0.95920.95550.94000.9620.9411.0350.9710.952
FC [$/h]44,02943,81045,34549,64342,27742,399.2542,588.8243,225.92
Em [ton/h]1.04521.26500.98441.4981.13381.10871.13541.1802
loss [MW]11.696914.095417.668325.291911.227611.743914.16715.412
VD [p.u.]0.72770.71460.75990.65643.61181.78730.68810.7284
The BCS of OFs are given in bold.
Table 9. OCVs obtained by MOGWO and MOHHO for Cases (15–18) IEEE 57 bus test.
Table 9. OCVs obtained by MOGWO and MOHHO for Cases (15–18) IEEE 57 bus test.
ItemCase #19Case #20Case #21
MOGWOMOHHOMOGWOMOHHOMOGWOMOHHO
Pg [MW] P 1 175.814157.538186.053174.293150.234183.301
P 2 55.60092.78675.97998.34091.77967.500
P 5 51.96092.563133.774134.73994.90964.185
P 8 77.27696.43696.79697.11794.74575.877
P 11 445.829335.289299.919297.962331.307399.713
P 13 79.73988.56387.72182.66794.88278.741
Vg [p.u.] V 1 379.595400.994383.783379.471404.767397.719
V 2 1.0090.9981.0221.0231.0341.003
V 5 1.0101.0201.0271.0301.0360.980
V 8 1.0201.0201.0151.0151.0201.019
V 11 1.0320.9901.0021.0021.0031.025
V 13 1.0611.0201.0381.0101.0191.010
Shunt Element [MVAr] Q c 10 1.0351.0201.0281.0311.0161.036
Q C 12 1.0131.0201.0041.0091.0071.030
Q c 15 0.9630.9660.9820.9531.0170.970
Q 17 1.0620.9761.0500.9960.9700.996
Q c 20 0.9630.9560.9580.9631.0140.955
Q 21 0.9710.9531.0110.9650.9960.995
Q c 23 0.9970.9740.9510.9740.9770.973
Q 24 1.0061.0200.9911.0251.0171.034
Q 29 1.0030.9591.0150.9570.9560.956
Tap Position T 11 0.9380.9660.9490.9560.9870.964
T 12 0.9290.9520.9610.9530.9481.005
T 15 0.9280.9530.9450.9520.9340.956
T 36 0.9680.9520.9540.9580.9400.958
FC [$/h]41,863.1342,449.4544,63344,63242,876.6342,241.61
Em [ton/h]1.38081.09001.03231.00531.08011.2809
loss [MW]15.0113.34913.225513.788211.822416.2366
VD [p.u.]0.79360.74340.77110.72940.83000.8384
The BCS of OFs are given in bold.
Table 10. Comparison of BCS for MOGWO and MOHHO with optimization methods for cases (11 and 12).
Table 10. Comparison of BCS for MOGWO and MOHHO with optimization methods for cases (11 and 12).
Case #11Case #12
MethodFC [$/h] E [ton/h] MethodFC [$/h] RPL [MW]
MOSGA [35]42,497.0131.2712MOSGA [35]41,994.61811.8514
ISPEA [36] 42,444.5541.2904MO-DEA [56]42,006.1412.3669
SPEA2 [36] 42,320.2551.4054ESDE-EC [56] 42,013.3411.9668
rNSGA-II [36] 42,635.7171.3784ESDE [56] 42,020.74412.2155
NSGA-II [36] 43,567.7651.2979ESDE-MC [56] 41,998.35911.8415
IMOMRFO [51] 41,742.9441.7912MHBAS [63] 42,084.8110.5043
ESDE-MC [56] 42,857.4871.2191MDE [63]42,125.8310.9193
ESDE-EC [56] 42,863.2121.2387HFBA-COFS [65] 42,122.01410.6995
ESDE [56] 42,863.3241.2662NSGA-II [65] 42,125.60411.1296
MGBICA [57]42,369.066 1.2940MOQRJFS [75] 41,846.22515.8873
GBICA [57] 42,138.371.3941MOJFS [75] 42,591.87115.1461
NMBAS [60] 43,117.861.2245IHOA [76] 42,419.52510.8192
MOPSO [60] 43,279.641.2546MOHHO41,994.5211.624
MPIO-PFM [61] 43,205.8481.2386MOGWO41,871.9312.5332
MHBAS [63] 43,174.05 1.2211
MDE [63] 43,505.90 1.2236
MPIO-COSR [64] 43,131.2741.2314
HFBA-COFS [65]43,259.31.2129
DE-PFA [65] 43,331.7571.2180
NSGA-II [65] 43,353.5661.2272
MOQRJFS [75] 43,713.0151.3074
MOJFS [75] 43,888.2321.2383
IHOA [76] 43,864.881.2192
MOHHO42,219.671.0953
MOGWO42,408.021.1013
The values given in bold represent the proposed approaches.
Table 11. Comparison of BCS for MOGWO and MOHHO with optimization methods for Case 17.
Table 11. Comparison of BCS for MOGWO and MOHHO with optimization methods for Case 17.
Case #17
MethodFC [$/h] E [ton/h] RPL [MW]
MOSGA [35] 42,815.7891.3219 10.7648
MPIO-PFM [61] 43,133.991.502711.7899
MPIO-COSR [64] 42,133.3311.436011.7711
DE-PFA [65] 42,387.1561.517511.3076
HFBA-COFS [65] 42,856.491.343611.6782
NSGA-II [65] 42,887.0241.4572 11.6865
FAHSPSO-DE [71] 44,759.7761.603513.1377
MOQRJFS [75] 44,315.7481.359714.2560
MOJFS [75] 45,064.7111.189115.0875
MOHHO42,399.251.108711.7439
MOGWO42,2771.133811.2276
The values given in bold represent the proposed approaches.
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Al-Kaabi, M.; Dumbrava, V.; Eremia, M. Multi Criteria Frameworks Using New Meta-Heuristic Optimization Techniques for Solving Multi-Objective Optimal Power Flow Problems. Energies 2024, 17, 2209. https://doi.org/10.3390/en17092209

AMA Style

Al-Kaabi M, Dumbrava V, Eremia M. Multi Criteria Frameworks Using New Meta-Heuristic Optimization Techniques for Solving Multi-Objective Optimal Power Flow Problems. Energies. 2024; 17(9):2209. https://doi.org/10.3390/en17092209

Chicago/Turabian Style

Al-Kaabi, Murtadha, Virgil Dumbrava, and Mircea Eremia. 2024. "Multi Criteria Frameworks Using New Meta-Heuristic Optimization Techniques for Solving Multi-Objective Optimal Power Flow Problems" Energies 17, no. 9: 2209. https://doi.org/10.3390/en17092209

APA Style

Al-Kaabi, M., Dumbrava, V., & Eremia, M. (2024). Multi Criteria Frameworks Using New Meta-Heuristic Optimization Techniques for Solving Multi-Objective Optimal Power Flow Problems. Energies, 17(9), 2209. https://doi.org/10.3390/en17092209

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

Article Metrics

Back to TopTop