A Comparative Study of Optimal PV Allocation in a Distribution Network Using Evolutionary Algorithms

Wenlei Bai (), Wen Zhang, Richard Allmendinger, Innocent Enyekwe and Kwang Y. Lee
Additional contact information
Wenlei Bai: School of Engineering and Computer Science, Baylor University, Waco, TX 76706, USA
Wen Zhang: Hankamer School of Business, Baylor University, Waco, TX 76706, USA
Richard Allmendinger: Alliance Manchester Business School, University of Manchester, Manchester M15 6PB, UK
Innocent Enyekwe: School of Engineering and Computer Science, Baylor University, Waco, TX 76706, USA
Kwang Y. Lee: School of Engineering and Computer Science, Baylor University, Waco, TX 76706, USA

Energies, 2024, vol. 17, issue 2, 1-19

Abstract: The growing distributed energy resource (DER) penetration into distribution networks, such as through residential and commercial photovoltaics (PV), has emerged through a transition from passive to active networks, which takes the complexity of planning and operations to the next level. Optimal PV allocation (sizing and location) is challenging because it involves mixed-integer non-linear programming with three-phase non-linear unbalanced power flow equations. Meta-heuristic algorithms have proven their effectiveness in many complex engineering problems. Thus, in this study, we propose to achieve optimal PV allocation by using several basic evolutionary algorithms (EAs), particle swarm optimization (PSO), artificial bee colony (ABC), differential evolution (DE), and their variants, all of which are applied for a study of their performance levels. Two modified unbalanced IEEE test feeders (13 and 37 bus) are developed to evaluate these performance levels, with two objectives: one is to maximize PV penetration, and the other is to minimize the voltage deviation from 1.0 p.u. To handle the computational burden of the sequential power flow and unbalanced network, we adopt an efficient iterative load flow algorithm instead of the commonly used and yet highly simplified forward–backward sweep method. A comparative study of these basic EAs shows their general success in finding a near-optimal solution, except in the case of the DE, which is known for solving continuous optimization problems efficiently. From experiments run 30 times, it is observed that PSO-related algorithms are more efficient and robust in the maximum PV penetration case, while ABC-related algorithms are more efficient and robust in the minimum voltage deviation case.

Keywords: distributed energy resources; evolutionary algorithms; optimal PV allocation; PV penetration (search for similar items in EconPapers)
JEL-codes: Q Q0 Q4 Q40 Q41 Q42 Q43 Q47 Q48 Q49 (search for similar items in EconPapers)
Date: 2024
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/1996-1073/17/2/511/pdf (application/pdf)
https://www.mdpi.com/1996-1073/17/2/511/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jeners:v:17:y:2024:i:2:p:511-:d:1323029

Access Statistics for this article

Energies is currently edited by Ms. Agatha Cao

More articles in Energies from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().