Optimal Allocation and Sizing of Distributed Generation Using Interval Power Flow

被引:3
作者
Nogueira, Wallisson C. [1 ]
Garces Negrete, Lina P. [1 ]
Lopez-Lezama, Jesus M. [2 ]
机构
[1] Univ Fed Goias, Elect Mech & Comp Engn Sch, Ave Univ 1488, BR-74605010 Goiania, Go, Brazil
[2] Univ Antioquia UdeA, Dept Ingn Elect, Grp Manejo Eficiente Energia GIMEL, Calle 70 52-21, Medellin 050010, Colombia
关键词
distributed generation; distribution networks; interval power flow; metaheuristic optimization; uncertainty; PARTICLE SWARM OPTIMIZATION; DISTRIBUTION NETWORKS; DISTRIBUTION-SYSTEM; ENERGY-RESOURCES; PLACEMENT; ALGORITHM; SEARCH; LOCATION; UNITS; DGS;
D O I
10.3390/su15065171
中图分类号
X [环境科学、安全科学];
学科分类号
08 ; 0830 ;
摘要
Modern distribution systems and microgrids must deal with high levels of uncertainty in their planning and operation. These uncertainties are mainly due to variations in loads and distributed generation (DG) introduced by new technologies. This scenario brings new challenges to planners and system operators that need new tools to perform more assertive analyses of the grid state. This paper presents an optimization methodology capable of considering uncertainties in the optimal allocation and sizing problem of DG in distribution networks. The proposed methodology uses an interval power flow (IPF) that adds uncertainties to the combinatorial optimization problem in charge of sizing and allocating DG units in the network. Two metaheuristics were implemented for comparative purposes, namely, symbiotic organism search (SOS) and particle swarm optimization (PSO). The proposed methodology was implemented in Python((R)) function consists of minimizing technical losses and regulating network voltage levels. The results obtained from the proposed IPF on the tested networks are compatible with those obtained by the PPF, thus evidencing the robustness and applicability of the proposed method. For the solution of the optimization problem, the SOS metaheuristic proved to be robust, since it was able to find the best solutions (lowest losses) while keeping voltage levels within the predetermined range. On the other hand, the PSO metaheuristic showed less satisfactory results, since for all test systems, the solutions found were of lower quality than the ones found by the SOS.
引用
收藏
页数:24
相关论文
共 73 条
[1]   Maximal optimal benefits of distributed generation using genetic algorithms [J].
Abou El-Ela, A. A. ;
Allam, S. M. ;
Shatla, M. M. .
ELECTRIC POWER SYSTEMS RESEARCH, 2010, 80 (07) :869-877
[2]   Distributed generation:: a definition [J].
Ackermann, T ;
Andersson, G ;
Söder, L .
ELECTRIC POWER SYSTEMS RESEARCH, 2001, 57 (03) :195-204
[3]  
Afraz A., 2012, AM J SCI RES, P50
[4]  
Alam Afroz, 2018, 2018 International Conference on Power, Energy, Control and Transmission Systems (ICPECTS). Proceedings, P21, DOI 10.1109/ICPECTS.2018.8521619
[5]   Optimal Site and Size of Distributed Generation Allocation in Radial Distribution Network Using Multi-objective Optimization [J].
Ali, Aamir ;
Keerio, M. U. ;
Laghari, J. A. .
JOURNAL OF MODERN POWER SYSTEMS AND CLEAN ENERGY, 2021, 9 (02) :404-415
[6]  
Alinejad-Beromi Y, 2008, 2008 PROCEEDINGS OF THE 43RD INTERNATIONAL UNIVERSITIES POWER ENGINEERING CONFERENCE, VOLS 1-3, P589
[7]  
Alolyan I., 2011, AUST J MATH ANAL APP, V8, P1
[8]   Optimized Exploitation of Ancillary Services: Compensation of Reactive, Unbalance and Harmonic Currents Based on Particle Swarm Optimization [J].
Alonso, Augusto M. S. ;
Pereira Junior, Benvindo R. ;
Brandao, Danilo I. ;
Marafao, Fernando P. .
IEEE LATIN AMERICA TRANSACTIONS, 2021, 19 (02) :314-325
[9]   Profit-Based DG Planning Considering Environmental and Operational Issues: A Multiobjective Approach [J].
Ameli, Amir ;
Farrokhifard, Mohammad-Reza ;
Davari-nejad, Ehsan ;
Oraee, Hashem ;
Haghifam, Mahmoud-Reza .
IEEE SYSTEMS JOURNAL, 2017, 11 (04) :1959-1970
[10]   Probabilistic Load Flow Based on Parameterized Probability-Boxes for Systems With Insufficient Information [J].
Amiri, Hafez ;
Mohammadi, Mohammad ;
Karimi, Mazaher ;
Rastegar, Mohammad ;
Rostami, Amir .
IEEE ACCESS, 2021, 9 :161038-161045