scholarly journals Optimal Selection of Conductors in Three-Phase Distribution Networks Using a Discrete Version of the Vortex Search Algorithm

Computation ◽  
2021 ◽  
Vol 9 (7) ◽  
pp. 80
Author(s):  
John Fernando Martínez-Gil ◽  
Nicolas Alejandro Moyano-García ◽  
Oscar Danilo Montoya ◽  
Jorge Alexander Alarcon-Villamil
Keyword(s):  
Objective Function ◽  
Power Flow ◽  
Phase Distribution ◽  
Search Algorithm ◽  
Distribution Networks ◽  
Discrete Version ◽  
Optimal Selection ◽  
Flow Method ◽  
Three Phase ◽  
Selection Of

In this study, a new methodology is proposed to perform optimal selection of conductors in three-phase distribution networks through a discrete version of the metaheuristic method of vortex search. To represent the problem, a single-objective mathematical model with a mixed-integer nonlinear programming (MINLP) structure is used. As an objective function, minimization of the investment costs in conductors together with the technical losses of the network for a study period of one year is considered. Additionally, the model will be implemented in balanced and unbalanced test systems and with variations in the connection of their loads, i.e., Δ− and Y−connections. To evaluate the costs of the energy losses, a classical backward/forward three-phase power-flow method is implemented. Two test systems used in the specialized literature were employed, which comprise 8 and 27 nodes with radial structures in medium voltage levels. All computational implementations were developed in the MATLAB programming environment, and all results were evaluated in DigSILENT software to verify the effectiveness and the proposed three-phase unbalanced power-flow method. Comparative analyses with classical and Chu & Beasley genetic algorithms, tabu search algorithm, and exact MINLP approaches demonstrate the efficiency of the proposed optimization approach regarding the final value of the objective function.

scholarly journals Optimal Integration of Photovoltaic Sources in Distribution Networks for Daily Energy Losses Minimization Using the Vortex Search Algorithm

2021 ◽  
Vol 11 (10) ◽  
pp. 4418
Author(s):  
Alejandra Paz-Rodríguez ◽  
Juan Felipe Castro-Ordoñez ◽  
Oscar Danilo Montoya ◽  
Diego Armando Giral-Ramírez
Keyword(s):  
Objective Function ◽  
Power Flow ◽  
Search Algorithm ◽  
Peak Load ◽  
Distribution Networks ◽  
Energy Losses ◽  
Continuous Version ◽  
Continuous Section ◽  
Daily Energy ◽  
Discrete Part

This paper deals with the optimal siting and sizing problem of photovoltaic (PV) generators in electrical distribution networks considering daily load and generation profiles. It proposes the discrete-continuous version of the vortex search algorithm (DCVSA) to locate and size the PV sources where the discrete part of the codification defines the nodes. Renewable generators are installed in these nodes, and the continuous section determines their optimal sizes. In addition, through the successive approximation power flow method, the objective function of the optimization model is obtained. This objective function is related to the minimization of the daily energy losses. This method allows determining the power losses in each period for each renewable generation input provided by the DCVSA (i.e., location and sizing of the PV sources). Numerical validations in the IEEE 33- and IEEE 69-bus systems demonstrate that: (i) the proposed DCVSA finds the optimal global solution for both test feeders when the location and size of the PV generators are explored, considering the peak load scenario. (ii) In the case of the daily operative scenario, the total reduction of energy losses for both test feeders are 23.3643% and 24.3863%, respectively; and (iii) the DCVSA presents a better numerical performance regarding the objective function value when compared with the BONMIN solver in the GAMS software, which demonstrates the effectiveness and robustness of the proposed master-slave optimization algorithm.

scholarly journals Accurate and Efficient Derivative-Free Three-Phase Power Flow Method for Unbalanced Distribution Networks

Computation ◽  
2021 ◽  
Vol 9 (6) ◽  
pp. 61
Author(s):  
Oscar Danilo Montoya ◽  
Juan S. Giraldo ◽  
Luis Fernando Grisales-Noreña ◽  
Harold R. Chamorro ◽  
Lazaro Alvarado-Barrios
Keyword(s):  
Power Flow ◽  
Triangular Matrix ◽  
Distribution Networks ◽  
Flow Method ◽  
Processing Times ◽  
Three Phase ◽  
Derivative Free ◽  
Upper Triangular Matrix ◽  
Power Flow Problem ◽  
Power Flow Method

The power flow problem in three-phase unbalanced distribution networks is addressed in this research using a derivative-free numerical method based on the upper-triangular matrix. The upper-triangular matrix is obtained from the topological connection among nodes of the network (i.e., through a graph-based method). The main advantage of the proposed three-phase power flow method is the possibility of working with single-, two-, and three-phase loads, including Δ- and Y-connections. The Banach fixed-point theorem for loads with Y-connection helps ensure the convergence of the upper-triangular power flow method based an impedance-like equivalent matrix. Numerical results in three-phase systems with 8, 25, and 37 nodes demonstrate the effectiveness and computational efficiency of the proposed three-phase power flow formulation compared to the classical three-phase backward/forward method and the implementation of the power flow problem in the DigSILENT software. Comparisons with the backward/forward method demonstrate that the proposed approach is 47.01%, 47.98%, and 36.96% faster in terms of processing times by employing the same number of iterations as when evaluated in the 8-, 25-, and 37-bus systems, respectively. An application of the Chu-Beasley genetic algorithm using a leader–follower optimization approach is applied to the phase-balancing problem utilizing the proposed power flow in the follower stage. Numerical results present optimal solutions with processing times lower than 5 s, which confirms its applicability in large-scale optimization problems employing embedding master–slave optimization structures.

scholarly journals Three-Phase Unbalanced Optimal Power Flow Using Holomorphic Embedding Load Flow Method

2019 ◽  
Vol 11 (6) ◽  
pp. 1774 ◽  
Author(s):  
Bharath Rao ◽  
Friederich Kupzog ◽  
Martin Kozek
Keyword(s):  
Power Flow ◽  
Optimal Power Flow ◽  
Low Voltage ◽  
Distribution Networks ◽  
Optimization Method ◽  
Load Flow ◽  
Flow Method ◽  
Optimal Power ◽  
Three Phase ◽  
Holomorphic Embedding

Distribution networks are typically unbalanced due to loads being unevenly distributed over the three phases and untransposed lines. Additionally, unbalance is further increased with high penetration of single-phased distributed generators. Load and optimal power flows, when applied to distribution networks, use models developed for transmission grids with limited modification. The performance of optimal power flow depends on external factors such as ambient temperature and irradiation, since they have strong influence on loads and distributed energy resources such as photo voltaic systems. To help mitigate the issues mentioned above, the authors present a novel class of optimal power flow algorithm which is applied to low-voltage distribution networks. It involves the use of a novel three-phase unbalanced holomorphic embedding load flow method in conjunction with a non-convex optimization method to obtain the optimal set-points based on a suitable objective function. This novel three-phase load flow method is benchmarked against the well-known power factory Newton-Raphson algorithm for various test networks. Mann-Whitney U test is performed for the voltage magnitude data generated by both methods and null hypothesis is accepted. A use case involving a real network in Austria and a method to generate optimal schedules for various controllable buses is provided.

scholarly journals Optimal Selection and Location of Fixed-Step Capacitor Banks in Distribution Networks Using a Discrete Version of the Vortex Search Algorithm

Energies ◽  
2020 ◽  
Vol 13 (18) ◽  
pp. 4914
Author(s):  
Walter Gil-González ◽  
Oscar Danilo Montoya ◽  
Arul Rajagopalan ◽  
Luis Fernando Grisales-Noreña ◽  
Jesus C. Hernández
Keyword(s):  
Exponential Function ◽  
Gaussian Distribution ◽  
Distribution Systems ◽  
Search Algorithm ◽  
Optimal Solution ◽  
Solution Space ◽  
Distribution Networks ◽  
Discrete Version ◽  
Optimal Selection ◽  
Capacitor Banks

This paper deals with the problem of the optimal selection of capacitor banks in electrical AC distribution systems for minimizing the costs of energy losses during a year of operation through a discrete version of the vortex search algorithm (DVSA). This algorithm works with a hypersphere with a variable radius defined by an exponential function where a Gaussian distribution is used to generate a set of candidate solutions uniformly distributed around the center of this hypersphere. This center corresponds to the best solution obtained at the iteration t, which is initialized at the center of the solution space at the iterative search beginning. The main advantage of combining the exponential function with the Gaussian distribution is the correct balance between the exploration and exploitation of the solution space, which allows reaching the global optimal solution of the optimization problem with a low standard deviation, i.e., guaranteeing repeatability at each simulation. Two classical distribution networks composed of 33 and 69 nodes were used to validate the proposed DVSA algorithm. They demonstrated that the DVSA improves numerical reports found in specialized literature regarding the optimal selection and location of fixed-step capacitor banks with a low computational burden. All the simulations were carried out in MATLAB software.

scholarly journals A Loop-Analysis Theory Based Linear Power Flow Method for Three-Phase Distribution Power System

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 157389-157400 ◽  
Author(s):  
Hongwei Li ◽  
Hailin Zhou ◽  
Tong Liu ◽  
Qi Chen
Keyword(s):  
Power System ◽  
Power Flow ◽  
Phase Distribution ◽  
Loop Analysis ◽  
Flow Method ◽  
Analysis Theory ◽  
Three Phase ◽  
Power Flow Method

scholarly journals A modified backward/forward sweep-based method for reconfiguration of unbalanced distribution networks

2019 ◽  
Vol 9 (1) ◽  
pp. 85 ◽  
Author(s):  
Michel Duran-Quintero ◽  
John E. Candelo ◽  
Jose Soto-Ortiz
Keyword(s):  
Power Systems ◽  
Power Flow ◽  
Large Scale ◽  
Distribution Networks ◽  
Network Reconfiguration ◽  
Computational Tool ◽  
Topology Change ◽  
Flow Method ◽  
Three Phase ◽  
Power Flow Method

<span lang="EN-US">A three-phase unbalanced power flow method can provide a more realistic scenario of how distribution networks operate. The backward/forward sweep-based power flow method </span><span lang="EN-AU">(BF-PF)</span><span lang="EN-US"> has been used for many years as an important computational tool to solve the power flow for unbalanced and radial power systems. However, some of the </span><span lang="EN-AU">few </span><span lang="EN-US">available research tools produce many errors when </span><span lang="EN-AU">they </span><span lang="EN-US">are used for </span><span lang="EN-AU">network </span><span lang="EN-US">reconfiguration </span><span lang="EN-AU">because the </span><span lang="EN-US">topology change</span><span lang="EN-AU">s</span><span lang="EN-AU">after multiple switch actions</span><span lang="EN-US"> and the nodes are disorganized continually. </span><span lang="EN-AU">T</span><span lang="EN-US">his paper presents </span><span lang="EN-AU">a modified</span><span lang="EN-AU">BF-PF for </span><span lang="EN-US">three-phase unbalanced radial </span><span lang="EN-AU">distribution networks</span><span lang="EN-US"> that is capable </span><span lang="EN-AU">of arranging</span><span lang="EN-US"> the system topology when reconfiguration changes the branch connections. A binary search is used to determine the connections between nodes, allowing the algorithm to avoid those problems when reconfiguration is carried out, regardless of node numbers. Tests are made to verify the usefulness of the proposed algorithm in both the IEEE 13-node test feeder and the 123-node test feeder, converging in every run where constraints are accomplished. This approach can be used easily for a large-scale feeder network reconfiguration.</span><span lang="EN-AU"> The full version of this modified </span><span lang="EN-US">backward/forward sweep</span><span lang="EN-AU"> algorithm is available for research at MathWorks</span><span lang="EN-US">.</span>

scholarly journals Newton Power Flow Methods for Unbalanced Three-Phase Distribution Networks

Energies ◽  
2017 ◽  
Vol 10 (10) ◽  
pp. 1658 ◽  
Author(s):  
Baljinnyam Sereeter ◽  
Kees Vuik ◽  
Cees Witteveen
Keyword(s):  
Power Flow ◽  
Phase Distribution ◽  
Distribution Networks ◽  
Three Phase
Sign in / Sign up

Export Citation Format

Share Document