TY - JOUR
T1 - Optimal routing an ungrounded electrical distribution system based on heuristic method with micro grids integration
AU - Pavón, Wilson
AU - Inga, Esteban
AU - Simani, Silvio
PY - 2019/1/1
Y1 - 2019/1/1
N2 - This paper proposes a three-layer model to find the optimal routing of an underground electrical distribution system, employing the PRIM algorithm as a graph search heuristic. In the algorithm, the first layer handles transformer allocation and medium voltage network routing, the second layer deploys the low voltage network routing and transformer sizing, while the third presents a method to allocate distributed energy resources in an electric distribution system. The proposed algorithm routes an electrical distribution network in a georeferenced area, taking into account the characteristics of the terrain, such as streets or intersections, and scenarios without squared streets. Moreover, the algorithm copes with scalability characteristics, allowing the addition of loads with time. The model analysis discovers that the algorithm reaches a node connectivity of 100%, satisfies the planned distance constraints, and accomplishes the optimal solution of underground routing in a distribution electrical network applied in a georeferenced area. Simulating the electrical distribution network tests that the voltage drop is less than 2% in the farthest node.
AB - This paper proposes a three-layer model to find the optimal routing of an underground electrical distribution system, employing the PRIM algorithm as a graph search heuristic. In the algorithm, the first layer handles transformer allocation and medium voltage network routing, the second layer deploys the low voltage network routing and transformer sizing, while the third presents a method to allocate distributed energy resources in an electric distribution system. The proposed algorithm routes an electrical distribution network in a georeferenced area, taking into account the characteristics of the terrain, such as streets or intersections, and scenarios without squared streets. Moreover, the algorithm copes with scalability characteristics, allowing the addition of loads with time. The model analysis discovers that the algorithm reaches a node connectivity of 100%, satisfies the planned distance constraints, and accomplishes the optimal solution of underground routing in a distribution electrical network applied in a georeferenced area. Simulating the electrical distribution network tests that the voltage drop is less than 2% in the farthest node.
KW - Electrical distribution system
KW - Graph theory
KW - Heuristic
KW - Micro grids
KW - Optimization
KW - Planning
UR - https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85063540714&origin=inward
UR - https://www.scopus.com/inward/citedby.uri?partnerID=HzOxMe3b&scp=85063540714&origin=inward
UR - http://www.mendeley.com/research/optimal-routing-ungrounded-electrical-distribution-system-based-heuristic-method-micro-grids-integra
U2 - 10.3390/su11061607
DO - 10.3390/su11061607
M3 - Article
SN - 2071-1050
VL - 11
JO - Sustainability (Switzerland)
JF - Sustainability (Switzerland)
IS - 6
M1 - 1607
ER -