Figures
Abstract
In this paper, a novel, effective meta-heuristic, population-based Hybrid Firefly Particle Swarm Optimization (HFPSO) algorithm is applied to solve different non-linear and convex optimal power flow (OPF) problems. The HFPSO algorithm is a hybridization of the Firefly Optimization (FFO) and the Particle Swarm Optimization (PSO) technique, to enhance the exploration, exploitation strategies, and to speed up the convergence rate. In this work, five objective functions of OPF problems are studied to prove the strength of the proposed method: total generation cost minimization, voltage profile improvement, voltage stability enhancement, the transmission lines active power loss reductions, and the transmission lines reactive power loss reductions. The particular fitness function is chosen as a single objective based on control parameters. The proposed HFPSO technique is coded using MATLAB software and its effectiveness is tested on the standard IEEE 30-bus test system. The obtained results of the proposed algorithm are compared to simulated results of the original Particle Swarm Optimization (PSO) method and the present state-of-the-art optimization techniques. The comparison of optimum solutions reveals that the recommended method can generate optimum, feasible, global solutions with fast convergence and can also deal with the challenges and complexities of various OPF problems.
Citation: Khan A, Hizam H, bin Abdul Wahab NI, Lutfi Othman M (2020) Optimal power flow using hybrid firefly and particle swarm optimization algorithm. PLoS ONE 15(8): e0235668. https://doi.org/10.1371/journal.pone.0235668
Editor: Ashkan Memari, Sunway University, MALAYSIA
Received: December 2, 2019; Accepted: June 20, 2020; Published: August 10, 2020
Copyright: © 2020 Khan et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
Data Availability: All relevant data are within the paper.
Funding: The authors received no specific funding for this work.
Competing interests: The authors have declared that no competing interests exist.
1 Introduction
Electric services companies are repeatedly working for generation scheduling and reasonable operational state to optimize the generating cost based on effective security limits and power transfer confinements. The optimal power flow (OPF) is an essential and complex optimization technique in electrical power system operations to adjust and optimize the control settings with various constraints sit [1] [2] [3] [4]. The earliest, various conventional optimization techniques have been used to solve the OPF problems. Main objective of the OPF problem to obtain the optimize scheduling of particular control variables based on limitation of system constraints sit [5] [6] [7]. These constraints consists of equality and inequality constraints. Equality constrains includes power flow or balance equations, whereas the inequality constrains sphere the dependent and decision variables within its limits.
Newly, single and multiple objective OPF techniques have been developed to obtain optimized solutions based on technical and economic interests. Many developers applied conventional and recent optimization techniques to deal with the OPF problems. there conventional optimization algorithms are: non-linear programming sit [8] [9], decomposition algorithms sit [10], the Newton algorithm sit [11], and quadratic programming sit [12] to solve the OPF problems. Linearization of constraints and specific objective function are main drawback that effects the final solution. Many limitations of the conventional OPF are mentioned in sit [13]. Complete review of the mentioned classical optimization methods is presented in sit [14]. New techniques with critical aspects and new advance are suggested for OPF problems sit [15].
Recently, Notable progress in the field of digital computation, artificial intelligence algorithms combined with nature-inspired, meta-heuristic based optimization methods are used to help electrical system based on economic concern. Numerous heuristic-based optimization algorithms have been proposed and applied to handle OPF problems, such as genetic algorithm (GA) sit [16] [17] [18]. In addition, many methods were developed to improve global performance and convergence of GA method, such as adaptive genetic algorithms with adjusting population size (AGA-POP) sit [19] and enhanced GA sit [19].
Newly developed search-based optimization algorithms are applied for OPF problems, like particle swarm optimization (PSO) method sit [2], differential evolutionary technique sit [20] [21]), improved colliding bodies optimization method sit [22], improved PSO algorithm sit [23], biogeography-based optimization technique sit [24], imperialist competitive method sit [25], grey wolf optimizer sit [26], hybrid algorithm of PSO and GSA algorithm sit [27], differential search technique sit [28], gravitational search method (GSM) sit [29] [30] [31], multi-phase search optimization technique sit [32] [33], fuzzy-based hybrid PSO algorithm sit [34], chaotic self-adaptive differential harmony search method sit [35], black-hole-based optimization technique sit [36], harmony search technique sit [37], artificial bee colony method (4), Jaya optimization technique sit [38], teaching-learning-optimization algorithm sit [39], biogeography-based optimization (BBO) sit [40], differential evolution (DE) sit [41], artificial bee colony (ABC) algorithm sit [42], distributed algorithm (DA) sit [43], and the Firefly algorithm (FA) sit [44]. An analysis of a non-deterministic algorithm, which is applied to solve OPF, is mentioned in sit [45]. Unfortunately, some of these methods are not effective for global optimization of various OPF problems, through a simultaneous calculation of various points in the search space. Such population-based, meta-heuristics algorithms are more efficient, compared to trajectory techniques, to find local optima. On the other hand, the trajectory techniques are good at describing global optima. Hence, hybridization of these meta-heuristic methods can use the benefits of both methods and can deal with more complex and challenging problems because of their robustness and flexibility sit [46].
The key goals of the hybrid meta-heuristic particle swarm optimization algorithm modifications are to create equilibrium between exploration and exploitation and to escape from premature results. Additionally, hybridization can improve the PSO’s capability and eliminate its weakness sit [47]. The main advantages of the PSO method are fast convergence, less calculating resource necessities, and easy implementation. But when populations are near to each other sit [48], this method suffers from being confined in local optima and by slow convergence. The Firefly optimization method is also a nature-inspired optimization method that copies the behavior of fireflies. It has some specific benefits over the PSO algorithm sit [49]. One of the benefits is that it does not have local or global best variables, so this helps it from being caught up in local optima. The method also doesn’t have a velocity vector, so it can prevent the problems that are created by the variations in velocity sit [50].
One of the recently developed hybrid meta-heuristic, population-based optimization methods entitled Hybrid Firefly Particle Swarm Optimization (HFPSO), developed by Aydilek İB sit [51]. Some real engineering problems have been tested on the HFPSO algorithm and the results have been compared to present-day state-of-the-art optimization algorithms. The overall results confirmed that the HFPSO method has the power to provide promising results that were not explored before sit [51]. The use of the HFPSO method to solve the OPF problems had not been studied. Hence, applying a robust optimization method can efficiently overcome the OPF problems.
This article proposed using the Hybrid Firefly Particle Swarm Optimization (HFPSO) method first, to contribute and solve various OPF problems in the power-engineering field. An expanded set of variables is used in the suggested OPF formulations. The set consists of actual power and voltages of generating units, transformer turn ratios, and reactive power of Shunt VAR compensators.
Five single-objective functions are considered in this article to show the efficiency of the proposed method considering optimum results of OPF problems: total generation cost minimization, voltage profile improvement, voltage stability enhancement, active and reactive power transmission loss reduction.
The improved performance is shown by comparing the results of the proposed HFPSO algorithm with the state-of-the-art algorithms chosen from the current literature for OPF problems. The proposed algorithm is also compared with its mother PSO algorithm, from which it is derived. The same single-objective OPF problems were used in the above-mentioned algorithms for the comparison. The standard IEEE 30-bus test scheme is applied to observe, authenticate, and show the effectiveness of the HFPSO algorithm.
The key contributions of this paper are as follows:
- This work proposes an already developed HFPSO algorithm to tackle the OPF problems.
- The algorithm is applied to five single-objective functions of OPF problems.
- Various objective functions of OPF problems are considered, such as total fuel cost minimization, voltage profile improvement, voltage stability enhancement, active and reactive power losses reduction.
- Results of the proposed algorithm are compared with simulated results of PSO and current literature work. So, these compressions prove supremacy of the algorithm in terms of convergence ratio and optimal results based on OPF problems.
- Statistical analysis showed that HFPSO algorithm is a robust and reliable optimization method to solve OPF problems.
The rest of this paper is organized as follows: Mathematical formulation of OPF issues is given in Part 2. Part 3, 4, and 5 briefly explain PSO, FOA, and HFPSO algorithms, respectively. Part 6 summarizes application of the proposed HFPSO algorithm to the OPF problems. Results, comparison, and discussion are explained in Part 7. Conclusions about the application of the HFPSO algorithm are mentioned in Part 8.
2 Problem formulation
Five cases, with five objectives, are considered in this study to verify the efficiency of the proposed HFPSO technique regarding optimum results of OPF problems. The objectives are total fuel cost minimization of the power network, voltage profile improvement, reduction of the active power losses of transmission lines, reduction of reactive power losses of transmission lines and voltage stability enhancement. Fuel cost f1 of a particular electrical power system is characterized by subsequent functions sit [39]:
(1)
Where NG represents the number of power generating units and the fuel cost of the i − th power-generating unit is denoted by fi, the quadratic function fi is formulated as follows:
(2)
Where ai,bi, and ci are coefficients of fuel price of the i − th power generating unit and PGi output active power of the i − th generator unit. The bus voltage is one of the key indicators for security and service quality indices sit [41]. To avoid the infeasibility, a double objective function, such as improvement of voltage profile and reduced fuel cost are considered as a single-objective function in the OPF issue. The objective task f2 is stated as sit [52]:
(3)
Where c is used as a weight factor for the stability between the objectives to avoid the dominance of one function over the other.
Due to economic reasons, a transmission network of a power system is mandatory to function near its security boundaries. The stability of a power system is one of the very important domains, to limit the bus voltage at every single point below standard working conditions during the load surge. The disturbance leads to changes in the system’s configuration. Consequently, an unavoidable voltage collapse accrues sit [39]. Voltage balance of a specific power network can be indicated by using L − index, that is Lmax sit [53].
(4)
Where La denotes the Lmax of a − th demand bus and NL is the integer of PQ (demand) buses, the objective function f3 of the case is represented as follows sit [39]:
(5)
Active power line transmission losses are a very important factor to optimize in a power network. The objective work f4 is denoted by the power balance equation in this case sit [36].
(6)
Where Pi is the active transmission line power loss, PGi is the active power of a generating unit and PDi the active power of the request (demand) of the i − th load line.
The availability of reactive power is an important factor in consideration of the voltage balance margin of a static power network, to reinforce the conduction of active power from the generator to the load. Thus, the optimization of reactive power losses can be stated by the following equation sit [36]:
(7)
Where Qi is the reactive transmission line power loss, QGi is the reactive power of source and QDi the reactive power of demand of the i − th load line.
As aforementioned, OPF provides optimal tuning of the control variables of demand or load to minimize a preset objective task, such as the total cost of a power system or active and reactive transmission line power losses. Most of the OPF detail may be characterized by the standard method sit [14]:
(8)
(9)
(10)
Where h denotes the vector of control variables and g denotes the vector of stated variables, x(g, h) states the system’s objective function. u(g, h) and z(g, h) indicates the sets of equality and inequality constraints. Also, the dependent h and the independent g variables of the OPF problems are detailed in (11) and (12) separately. The control variable h can be stated as sit [54] [39]:
(11)
Where PG stands for the active power generation at the PV (generator) buses apart from the swing bus, T represents the tapping ratio of the transformer. VG refers to the voltage value at generator buses, QC denotes the reactive power injection by shunt capacitor respectively. Moreover, NGG, NTT, and NCC represent the number of generator units, regulating transformer units and shunt capacitor units. The state of an electrical network can be represented by OPF formulations sit [10]. The most common, dependent variables for OPF issue are formulated along these lines sit [54] [39]:
(12)
Where PSlack shows the active power generation of the swing bus, VL1 denotes the voltage value at PQ or load buses. QG symbolizes the reactive power of generators, and Sln denotes the line flow and line loading, respectively. Furthermore, NL and N are the integers of PQ buses and power lines, correspondingly.
OPF constraints can be categorized into two types: 1) equality and 2) inequality constraints. The equality constraints of the OPF show the physical condition of a power network sit [54] [39]:
(13)
(14)
Where PGi and QGi represent the real and imaginary parts of the creation of a power network, PDi and QDi are the real and imaginary parts of the network demands on the i − th bus. Moreover, Bij and Gij reflect the susceptance and conductance between the node i and j. δij = δi − δj denotes a change in voltage angle. N represents the number of buses. More details of power flow formulas are discussed in sit [55].
The inequality constraints, confines the physical devices to certain limits, to assure the security of the power network. Furthermore, active power outputs, reactive power outputs, Shunt VAR compensators, transformer turn ratios, the voltage of all the generator units as well as slack should be limited by their upper and lower limits as formulated sit [39] [41]:
(15)
(16)
(17)
(18)
(19)
Security constraints, such as the voltage values of PQ buses and voltage of transmission line should be limited within the boundaries of its capacity. Which can be formulated as follows sit [36]:
(20)
(21)
Similarly, the inequality constraints of the control variables, like voltage magnitude of PV bus, real and reactive power output at swing bus and generation, and loading of the transmission line can be combined into one objective part in the form of quadratic penalty expressions. Furthermore, a particular penalty factor is multiplied with the square of the control variable and then is added to the objective function sit [36]. Mathematical formula of the penalty function is stated as follows:
(22)
Where αp,αv, αq and αs represent the penalty factors, xlim is the boundary of the control variable. If x value crosses the upper limit, then it automatically brings x to the xlim, similarly, if x crosses the lower limit, then it brings to the xlim sit [36]. Limits of the control variable can be expressed mathematically as follows:
(23)
3 Particle swarm optimization (PSO) algorithm
The particle swarm optimization is a meta-heuristic population-based algorithm originally designed by Kennedy and Eberhart sit [56]. The technique is based on the combined behavior of living organisms such as a swarm of fish or a flock of birds. The PSO algorithm consists of two expressions Pbest and Gbest Its position (X) and velocity (V) updates in every iteration. These parameters can be expressed mathematically as follows:
(24)
(25)
Where w, c1, and c2 are the inertia weight and acceleration coefficients, r1 and r2 denotes two random values within the range of [1, 0]. Inertia weight is calculated on linearly decreasing order based on number of iterations. Inertia weight can be calculated mathematically as follows sit [57] [58]:
(26)
The PSO algorithm can be studied in detail at sit [59].
4 Firefly optimization algorithm (FOA)
The firefly optimization algorithm is based on fireflies. These fireflies emit unique flashing light for their survival sit [49] [60]. The algorithm based on the intensity of flashing light and medium’s absorption. As stated by the inverse square law, the light strength decreases from a light source as distance increases. Moreover, the medium between light source and destination also absorbs the light. The method can be studied in more detail with the mathematical formulation in sit [61]
5 Hybrid firefly and particle swarm optimization (HFPSO) technique
The hybrid firefly and particle swarm optimization has been designed by Ibrahim Berkan Aydilek sit [51]. Hybrid equilibrium is maintained between exploration (localoptima) and exploitation (globaloptima) to take the strengths and advantages of both firefly and particle swarm methods sit [62] [63]. There are no velocity (V) and personal best location (pbest) terms in the firefly algorithm. In a global search, The PSO method offers fast convergence in terms of exploration. Moreover, the firefly algorithm is beneficial in local region search or it gives fine exploitation. The flowchart of the HFPSO method is shown in Fig 1.
Initially, input parameters are inserted. Then these parameters are used step by step by both population-based methods. Afterward, constant swarm vectors are initiated in the search space and velocity ranges. Global best (gbest) and individual best (pbest) swarms are mathematically considered and allocated. The calculated values are compared in the final alternation. Moreover, the present location is saved and then new velocity and location are calculated as follows sit [51]:
(27)
(28)
(29)
If a particle’s fitness value is equal to or better than the preceding global best, then the particle will be picked up by the firefly part according to the Eqs (28) and (29); otherwise, it will be carried by the PSO part according to the Eqs (24) and (25).
6 Application of the HFPSO method to optimal load flow problems
The subsequent steps show the application procedure of the proposed HFPSO algorithm to deal with the optimal power flow problem.
Step 1 Define the system data, real power limits, reactive power limits, generators’ data, state the primary values of real power and the voltage level of generator buses, reactive power of shunt capacitors, and the turn ratio of transformers.
Step 2 Execute the base case power flow. Evaluate the initial values of the objective functions that include the generation cost, voltage profile improvement, voltage stability enhancement, and real and reactive power transmission line loss reduction, by applying Eqs (1), (3), (4), (6), and (7).
Step 3 State the i − th goal function fi to evaluate as described in section 2. Define the designed variables (X) and its limits (Xmin, Xmax), initial population (Pop), dimensions (D), maximum iterations (Iterationmax), and algorithm specified parameters(C, w and V).
Step 4 Generate prime random positions of swarm particles (population) within specified limits of controlled variables. The position of the particles are formulated in such a way:
(30) k = 1, 2, 3… m and j = 1, 2, 3… n.
Where the control variables and the number of various solutions are denoted by n and m. The estimation of the j − th designed variable X(k,j) and k − th applicant solution can be calculated as follows:
(31)
Where
and
are the limits of the j − th designed variables and rand(.) denotes the random number within limits of (0 − 1). For more clarification, the physical components of X(k, j) can be formulated as follow:
(32)
Step 5 Execute the load flow for every single solution and compute the value of the particular objective function that relates to the solution.
Step 6 Evaluate the fitness value and find the personal best (pbest) and global best (gbest) solutions in the group of calculated values.
Step 7 Examine the improvement in the calculated objective function values in the final iteration as stated by Eq (27).
Step 8 Calculate the dispatch in view of the changed vector of controlled variables. Compute the fresh values of the objective functions. Include the allocated penalty(s) to the goal function, if it violates the limits, according to Eq (22).
Step 9 Compare the goal function fi values. If the values are superior to previous ones, then execute the Eqs (28) and (29); otherwise, use the Eqs (24) and (25), respectively.
Step 10 If the termination standard is achieved, then stop and print the results of the optimal values. Otherwise, come back to step 7.
For more clarification, the flowchart of the suggested application of the HFPSO method to solve optimal load flow is presented in Fig 2.
7 Results and discussion
Standard IEEE − 30 bus test network is used as a benchmark function for single-objective OPF problems to examine the efficiency of the proposed HFPSO and original PSO algorithms. Both algorithms were initialized with a population of 30 and executed for a maximum iteration of 100. The algorithms are coded and executed in MATLAB R2016asitbib [64] andtheresultsarecarriedoutonaPCwith8GBRAManda4GHzIntelCorei7CPU.
7.1 IEEE 30-Bus test network
In this research work, the IEEE30 − bus test scheme is applied for the suggested HFPSO and the original PSO algorithms to investigate the effectiveness of the suggested HFPSO method. Fig 3 shows one-line diagram of the IEEE 30-bus test system with the following characteristics sit [36] [5]: The system has 6 generator units at buses 1, 2, 5, 8, 11, and 13 of the network. Also, four tap-controlled transformers are connected between the transmission lines 6 to 9, 6 to 10, 4 to 12, and 27 28, in voltage limits of (0.9 − 1.1). Reactive power sources in MVAR(0 − 5) are installed at the 10, 12, 15, 17, 20, 21, 23, 24, and 29 load buses. Moreover, the voltage magnitudes of PV buses are limited from 0.95 to 1.1(p.u.). Operating limits of the load buses are subjected from 0.95 to 1.05(p.u.). In addition, the bus data, line data, and generator cost coefficients are detailed in sit [5].
To validate the usefulness and robustness of the proposed method, several cases with diverse goal functions, such as total fuel cost reduction, voltage deviation, voltage profile enhancement Lmax, real power losses, and reactive power losses have been simulated as follows:
7.1.1 Case 1: Fuel cost minimization.
In this section, the minimization of the total fuel cost of generation is considered as a goal function during the execution of the HFPSO and the original PSO method. As we see, from the graphs (a) and (b) in Fig 4, the proposed algorithm requires only 25 iterations while the original PSO method needs 40 iterations to reach the optimal solution. The proposed algorithm also achieves a fine convergence rate as compared to the original PSO method. Optimum solutions and values of the control variables of the methods are shown in Tables 1 and 2. In addition, the fuel cost value calculated by the proposed method 11.4% decreased from the base value 902.0207 $/h sit [36] to the optimized value of 799.123 $/h with an average execution time of a single repetition of 0.821s. Table 3 illustrates the improved performance of the HFPSO method over the current heuristic optimization methods in terms of an optimum solution. The minimum values achieved by the proposed algorithm are 799.132, as compared to the best value achieved by the MVO algorithm is 799.242. Consequently, these results showed the dominance of the HFPSO heuristic algorithm over the current heuristic methods in terms of optimality and convergence.
7.1.2 Case 2: Voltage profile improvement.
The objective of this section is to minimize the total fuel cost ($/h) of the system and to improve the voltage profile simultaneously by limiting the voltage deviation (p.u.) of the load buses (PQ buses) from the reference of 1.0p.u. during the execution of the proposed HFPSO and original PSO algorithms. Fig 5(a) and 5(b) describe the convergence curves of fuel cost ($/h) and voltage deviation (p.u.) minimization based on current methods. The graphical representation shows that the proposed algorithm achieves a good convergence rate. Also, the proposed method needs only 20 and 91 iterations, for the fuel cost and voltage deviation, while the original PSO method requires 100 iterations to achieve the optimal solution. The optimum solutions and control variables for the case obtained by the proposed and the original PSO algorithms are tabulated in Tables 1 and 2. Table 1 shows that the voltage deviation is significantly minimized as related to the base value sit [36]. The deviation 89.85% decreased from the base value 1.1469 p.u. to an optimum value of 0.1163 p.u. based on the proposed technique, while the deviation decreased only 59.28% from the base value of 1.1469 (p.u) to the global value of 0.467 (p.u) based on the original PSO method.
To further verify the effectiveness of the suggested algorithm, the optimum solution of the algorithm is also compared with the various natural-inspired-heuristic algorithms in the present research work, as shown in Table 4. Consequently, optimum solutions to the fuel cost and voltage deviation obtained from the proposed HFPSO technique are better than the original PSO and most of the heuristic methods.
7.1.3 Case 3: Voltage stability enhancement.
In this section, fuel cost and voltage stability enhancement are chosen as a single-objective function to be improved based on the proposed HFPSO and the original PSO algorithms as shown in Fig 6. The proposed algorithm achieves a very good convergence rate again, as compared to the original PSO method as illustrated in Fig 6(a) and 6(b).
It is important to note that the voltage stability index is strengthened by 33.94% from the base value of 0.1723 sit [36] to the optimum value of 0.1144, by the proposed algorithm.
It is evident from Fig 6(b) that the original PSO algorithm acquired an abrupt and very weak convergence ratio. Furthermore, the stability index is reinforced by 32.09% from the base value 0.1723 to the improved value 0.1170. Table 5 compares the results of the previous population-based methods with the optimal value achieved by the application of the proposed HFPSO technique. It is obvious from Table 5 that the minimum value obtained by the proposed algorithm is 0.1144, as compared to the best minimum value obtained by the MVO algorithm 0.1146 from the current literature work. So, it is clear from the results and comparisons that the proposed algorithm is very efficient to solve the OPF problems.
7.1.4 Case 4: Active power transmission Losses reduction.
This section explains the active power loss optimization as a single-objective function by using the proposed HFPSO and original PSO algorithms. Fig 7 illustrates the sketched graphs of the objective function over repetitions. Fig 7(a) shows that the proposed algorithm achieved an optimal solution in 40 iterations and has fast convergence compared to the 60 iterations of the PSO. Table 1 arranges optimum solutions and control variables achieved by using the HFPSO algorithm. The active power transmission line losses are reduced 50.78% from the base value of 5.821 MW sit [36] to the optimal value of 2.865MW. Optimum solutions and control variables of the PSO algorithm are tabulated in Table 2. Real power losses are minimized by only 49.37% from the base case 5.821 MW to the best value of 2.947 MW. The real power losses from the previous heuristic techniques in Table 6 are also matched with the proposed HFPSO method to demonstrate its effectiveness. The minimum value of the proposed algorithm is 2.865, as compared to the global minimum value by MVO algorithm 2.881 from the current literature work.
7.1.5 Case 5: Minimization of reactive power transmission losses.
The main goal of this section is to reduce the reactive power losses of the transmission lines based on the proposed HFPSO technique and compare the optimum solution with the original PSO algorithm. Fig 8 shows the convergence curves of the reactive power losses as an objective function in this case. It is observed from Fig 8(a) and 8(b) that the proposed algorithm achieved an optimum solution in only 22 iterations with a fine convergence ratio as compared to the original PSO method. The control variables and optimal solutions obtained by using the HFPSO and PSO algorithms are mentioned in Tables 1 and 2. The reactive power losses are minimized from the base case value of -4.6066 MVAR sit [36] to the optimal value of -25.204 MVAR by using the HFPSO technique. But the same losses are only reduced to -21.329 MVAR after applying the PSO method. Table 7 compares the optimal values of the same losses of the population-based techniques from the current research work with the proposed method to further validate the usefulness of the proposed algorithm. As we see, the value of the MVO algorithm is -25.038 and is only more optimized as compared to the optimum value of the proposed algorithm.
7.2 Statistical results and complexity
To check the robustness of the algorithm, 40 independent trials are performed with initial populations and iterations of 50 and 100. Table 8 shows the best, average, worst, and standard deviation values. It can be observed from the table that best, the mean, and the worst values are very close to each other and the standard deviation value is the minimum, which concludes the robustness of the HFPSO algorithm.
We are interested in computing the computational complexity of the algorithm. More precisely, we compute the temporal (or time) complexity which indicates how the computational time of the algorithm changes with a change in input parameters.
FA and PSO techniques have two inside loops, when passing over the population of size n and one outside loop for t cycles. Both techniques have time complexity of O(n2 t) in the extreme case. When n is relatively large, we can rank the selecting parameters for all particles by applying sorting technique to decrease the complexity to O(ntlog(n)) sit [66] [67].
These two algorithm have the same order of complexity and are applied in HFPSO simultaneously. The overall complexity in the extreme case (resp. when n is relatively large) of the algorithm is therefore O(MaxFESn2 t) (resp. O(MaxFESntlog(n))) since the algorithm runs until the maximum number of function evaluations (MaxFES) is reached.
8 Conclusions
In this article, a novel meta-historic optimization algorithm called HFPSO has been effectively applied to handle the OPF issues in power systems. Equilibrium is maintained between explorations and exploitation to take the advantages of both FOA and PSO methods. Various objective functions of OPF problems were considered: total fuel cost reduction, voltage stability enhancement, voltage profile improvement, active power transmission line loss minimization, and reactive power transmission line loss minimization. A standard IEEE 30-bus test network was tested to authenticate the validity of the HFPSO to solve the OPF problems. The results of the HFPSO algorithm were compared with the standard PSO algorithm and other optimization techniques. Results revealed that optimal solution for each considered case could be presented by the HFPSO algorithm. The new suggested idea of the HFPSO technique led to fast finding of a global solution (that is, supported the exploration and exploitation property). Furthermore, results showed the effectiveness of HFPSO technique concerning the satisfactory convergence rate. Statistical analysis showed that HFPSO algorithm is a robust and reliable optimization method to solve OPF problems. In conclusion, based on the applicability, and performance of the HFPSO, it can be said that this method offers an excellent tool to solve OPF issues of power networks.
References
- 1.
Zhu J. Optimization of power system operation. John Wiley Sons, Inc, Hoboken, New Jersey. 2009;1:315.
- 2. Abido MA. Optimal power flow using particle swarm optimization. International Journal of Electrical Power Energy Systems. 2002.
- 3. Sanjeev Kumar DKC. Optimal power flow solution using fuzzy evolutionary and swarm optimization. International Journal of Electrical Power Energy Systems. 2013;47:416–23.
- 4. Rezaei Adaryani M, Karami A. Artificial bee colony algorithm for solving multi-objective optimal power flow problem. International Journal of Electrical Power and Energy Systems. 2013.
- 5. Lee KY, Park YM, Ortiz JL. A United Approach to Optimal Real and Reactive Power Dispatch. IEEE Power Engineering Review. 1985.
- 6. Alsaç O, Bright J, Prais M, Stott B. Further developments in lp-based optimal power flow. IEEE Transactions on Power Systems. 1990.
- 7. Monoh JA, Ei-Hawary ME, Adapa R. A review of selected optimal power flow literature to 1993 part ii: newton, linear programming and Interior Point Methods. IEEE Transactions on Power Systems. 1999.
- 8. Dommel HW, Tinney WF. Optimal Power Flow Solutions. IEEE Transactions on Power Apparatus and Systems. 1968;Volume: PA(10):1866–76.
- 9. Alsac O, Stott B. Optimal load flow with steady-state security. IEEE Transactions on Power Apparatus and Systems. 1974.
- 10. Shoults RR, Sun DT. Optimal power flow based upon P-Q decomposition. IEEE Transactions on Power Apparatus and Systems. 1982.
- 11. Sun DI, Ashley B, Brewer B, Hughes A, Tinney WF. Optimal power flow by Newton approach. IEEE Transactions on Power Apparatus and Systems. 1984;PAS-103(10):2864–80.
- 12. Burchett RC, Happ HH, Vierath DR. Quadratically Convergent Optimal Power Flow. IEEE Transactions on Power Apparatus and Systems. 1984.
- 13. Momoh JA, Koessler RJ, Bond MS, Stott B, Sun D, Papalexopoulos A, et al. Challenges to optimal power flow. IEEE Transactions on Power Systems. 1997.
- 14. Frank S, Steponavice I, Rebennack S. Optimal power flow: A bibliographic survey I Formulations and deterministic methods. Energy Systems. 2012.
- 15. Frank S, Steponavice I, Rebennack S. Optimal power flow: a bibliographic survey I. Energy Systems. 2012.
- 16. Lai LL, Ma JT, Yokoyama R, Zhao M. Improved genetic algorithms for optimal power flow under both normal and contingent operation States. International Journal of Electrical Power and Energy Systems. 1997.
- 17. Bakirtzis AG, Biskas PN, Zoumas CE, Petridis V. Optimal power flow by enhanced genetic algorithm. IEEE Transactions on Power Systems. 2002.
- 18. Kumari MS, Maheswarapu S. Enhanced Genetic Algorithm based computation technique for multi-objective Optimal Power Flow solution. International Journal of Electrical Power and Energy Systems. 2010.
- 19. Attia AF, Al-Turki YA, Abusorrah AM. Optimal power flow using adapted genetic algorithm with adjusting population size. Electric Power Components and Systems. 2012.
- 20. Shaheen AM, El-Sehiemy RA, Farrag SM. Solving multi-objective optimal power flow problem via forced initialised differential evolution algorithm. IET Generation, Transmission and Distribution. 2016.
- 21. Varadarajan M, Swarup KS. Solving multi-objective optimal power flow using differential evolution. IET Generation, Transmission and Distribution. 2008.
- 22. Bouchekara HREH, Chaib AE, Abido MA, El-Sehiemy RA. Optimal power flow using an Improved Colliding Bodies Optimization algorithm. Applied Soft Computing Journal. 2016.
- 23. Niknam T, Narimani MR, Aghaei J, Azizipanah-Abarghooee R. Improved particle swarm optimisation for multi-objective optimal power flow considering the cost, loss, emission and voltage stability index. IET Generation, Transmission and Distribution. 2012.
- 24. Bhattacharya A, Chattopadhyay PK. Application of biogeography-based optimisation to solve different optimal power flow problems. IET Generation, Transmission and Distribution. 2011.
- 25. Ghanizadeh AJ, Mokhtari G, Abedi M, Gharehpetian GB. Optimal power flow based on imperialist competitive algorithm. International Review of Electrical Engineering. 2011.
- 26. El-Fergany AA, Hasanien HM. Single and Multi-objective Optimal Power Flow Using Grey Wolf Optimizer and Differential Evolution Algorithms. Electric Power Components and Systems. 2015.
- 27. Radosavljević J, Klimenta D, Jevtić M, Arsić N. Optimal Power Flow Using a Hybrid Optimization Algorithm of Particle Swarm Optimization and Gravitational Search Algorithm. Electric Power Components and Systems. 2015.
- 28. Bouchekara HREH, Abido MA. Optimal power flow using differential search algorithm. Electric Power Components and Systems. 2014.
- 29. Duman S, Güvenç U, Sönmez Y, Yörükeren N. Optimal power flow using gravitational search algorithm. Energy Conversion and Management. 2012;(59):86–95.
- 30. Bhattacharya A, Roy PK. Solution of multi-objective optimal power flow using gravitational search algorithm. IET Generation, Transmission and Distribution. 2012.
- 31. Jahan MS, Amjady N. Solution of large-scale security constrained optimal power flow by a new bi-level optimisation approach based on enhanced gravitational search algorithm. IET Generation, Transmission and Distribution. 2013.
- 32. El-Sehiemy RA, Shafiq MB, Azmy AM. Multi-phase search optimisation algorithm for constrained optimal power flow problem. International Journal of Bio-Inspired Computation. 2014.
- 33. Pulluri H, Naresh R, Sharma V. A solution network based on stud krill herd algorithm for optimal power flow problems. Soft Computing. 2018.
- 34. Liang RH, Tsai SR, Chen YT, Tseng WT. Optimal power flow by a fuzzy based hybrid particle swarm optimization approach. Electric Power Systems Research. 2011.
- 35. Arul R, Ravi G, Velusami S. Solving optimal power flow problems using chaotic self-adaptive differential harmony search algorithm. Electric Power Components and Systems. 2013.
- 36. Bouchekara HREH. Optimal power flow using black-hole-based optimization approach. Applied Soft Computing Journal. 2014.
- 37. Sivasubramani S, Swarup KS. Multi-objective harmony search algorithm for optimal power flow problem. International Journal of Electrical Power and Energy Systems. 2011.
- 38. Warid W, Hizam H, Mariun N, Abdul-Wahab NI. Optimal power flow using the Jaya algorithm. Energies. 2016.
- 39. Bouchekara HREH, Abido MA, Boucherma M. Optimal power flow using Teaching-Learning-Based Optimization technique. Electric Power Systems Research. 2014.
- 40. Ananthi Christy A, Vimal Raj PAD. Adaptive biogeography based predator-prey optimization technique for optimal power flow. International Journal of Electrical Power and Energy Systems. 2014.
- 41. Abou El Ela AA, Abido MA, Spea SR. Optimal power flow using differential evolution algorithm. Electric Power Systems Research. 2010.
- 42. He X, Wang W, Jiang J, Xu L. An improved artificial bee colony algorithm and its application to multi-objective optimal power flow. Energies. 2015.
- 43. Sanseverino ER, Di Silvestre ML, Badalamenti R, Nguyen NQ, Guerrero JM, Meng L. Optimal power flow in islanded microgrids using a simple distributed algorithm. Energies. 2015.
- 44. Balachennaiah P, Suryakalavathi M, Nagendra P. Firefly algorithm based solution to minimize the real power loss in a power system. Ain Shams Engineering Journal. 2018.
- 45. Frank S, Steponavice I, Rebennack S. Optimal power flow: A bibliographic survey II Non-deterministic and hybrid methods. Energy Systems. 2012. p. 259–289.
- 46. Blum C, Belsa Aguilera MJ, Roli A, Sampels M. Hybrid Metaheuristics—An Emerging Approach to Optimization. Computational Intelligence. 2008.
- 47. Thangaraj R, Pant M, Abraham A, Bouvry P. Particle swarm optimization: Hybridization perspectives and experimental illustrations. Applied Mathematics and Computation. 2011.
- 48. Ngo TT, Sadollah A, Kim JH. A cooperative particle swarm optimizer with stochastic movements for computationally expensive numerical optimization problems. Journal of Computational Science. 2016.
- 49. Yang XS. Firefly algorithms for multimodal optimization. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2009.
- 50. Fister I, Yang XS, Brest J. A comprehensive review of firefly algorithms. Swarm and Evolutionary Computation. 2013.
- 51. Aydilek İB. A hybrid firefly and particle swarm optimization algorithm for computationally expensive numerical problems. Applied Soft Computing Journal. 2018.
- 52. Abido MA. Optimal design of Power System Stabilizers Using Particle Swarm Optimization. IEEE Power Engineering Review. 2002.
- 53. Bansilal Thukaram D, Parthasarathy K. Optimal reactive power dispatch algorithm for voltage stability improvement. International Journal of Electrical Power and Energy Systems. 1996.
- 54. Bouchekara HREH, Abido MA, Chaib AE, Mehasni R. Optimal power flow using the league championship algorithm: A case study of the Algerian power system. Energy Conversion and Management. 2014.
- 55. Frank S, Rebennack S. An introduction to optimal power flow: Theory, formulation, and examples. IIE Transactions (Institute of Industrial Engineers). 2016;48(12):1172–97.
- 56.
Kennedy J, Eberhart R. Particle Swarm Optimization, Proceedings of IEEE International Conference on Neural Networks Vol. IV: 1942–1948. Neural Networks. 1995.
- 57.
Eberhart RC, Shi Y. Comparing inertia weights and constriction factors in particle swarm optimization. In: Proceedings of the 2000 Congress on Evolutionary Computation, CEC 2000. 2000.
- 58.
Shi Y, Eberhart RC. Empirical study of particle swarm optimization. In: Proceedings of the 1999 Congress on Evolutionary Computation, CEC 1999. 1999.
- 59.
Kennedy J, Eberhart R. Particle Swarm Optimization James. In: Proceedings of the IEEE International Conference on Neural Networks. 1995.
- 60. Yang XS. Firefly algorithm, Levy flights and global optimization. In: Research and Development in Intelligent Systems XXVI: Incorporating Applications and Innovations in Intelligent Systems XVII. 2010.
- 61. Yang X-S. Firefly Algorithm, Stochastic Test Functions and Design Optimisation. Int J Bio-Inspired Computation. 2010;2(2):78–84.
- 62. Kora P, Rama Krishna KS. Hybrid firefly and Particle Swarm Optimization algorithm for the detection of Bundle Branch Block. International Journal of the Cardiovascular Academy. 2016.
- 63. Abd-Elazim SM, Ali ES. A hybrid Particle Swarm Optimization and Bacterial Foraging for optimal Power System Stabilizers design. International Journal of Electrical Power and Energy Systems. 2013.
- 64.
The MathWorks, Inc.: Natick, MA U. R2016a, MATLAB Release. 2016.
- 65. Bachir Bentouati, Saliha Chettih, Pradeep Jangir, et al. A solution to the optimal power flow using multi-verse optimizer. Journal of Electrical Systems: 716–33.
- 66. Yang XS, He X. Firefly algorithm: recent advances and applications. International Journal of Swarm Intelligence. 2013.
- 67.
Ruhela, Dinesh Singh. A study of computational complexity of algorithms for numerical methods [Internet]. University of Rajasthan; 2014. Available from: http://hdl.handle.net/10603/148188.