TY - GEN
T1 - Distribution system restoration using spanning tree based on depth first search visual in GUI
AU - Eng, Samphors
AU - Penangsang, Ontoseno
AU - Wibowo, Rony Seto
AU - Suryawati, Indri
AU - Chhlonh, Chhith
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/7
Y1 - 2019/7
N2 - Distribution system restoration (DSR) is one of the most challenging problems of modern distribution network under the umbrella of smart grids. DSR is aimed to resupply out-of-service load by changing the topological structure of the distribution system following the fault isolated area through the network reconfiguration. This paper present spanning tree search to ascertain the optimal DSR plan that maximizes the restored load, minimizes the number of switching operation and minimizes the real power losses. Depth first search (DFS) algorithm is unweight graph which is proposed to represent the distribution system as a spanning tree that can maintain the radial structure of system. The proposed algorithm is applied to a modified IEEE 69-bus system by compared with heuristic graph-based method to verify its effectiveness. The results illustrate that, the same amount of switching operation for both proposed algorithms, the proposed algorithm in this paper is able to minimize real power losses and provide a most effective restoration strategy in multi-fault conditions. The 111-bus system which is a part of Surabaya distribution is also used as a test system. Simulation results are displayed on MATLAB graphic user interface (GUI) tool that can help users to carry out computations through an interface.
AB - Distribution system restoration (DSR) is one of the most challenging problems of modern distribution network under the umbrella of smart grids. DSR is aimed to resupply out-of-service load by changing the topological structure of the distribution system following the fault isolated area through the network reconfiguration. This paper present spanning tree search to ascertain the optimal DSR plan that maximizes the restored load, minimizes the number of switching operation and minimizes the real power losses. Depth first search (DFS) algorithm is unweight graph which is proposed to represent the distribution system as a spanning tree that can maintain the radial structure of system. The proposed algorithm is applied to a modified IEEE 69-bus system by compared with heuristic graph-based method to verify its effectiveness. The results illustrate that, the same amount of switching operation for both proposed algorithms, the proposed algorithm in this paper is able to minimize real power losses and provide a most effective restoration strategy in multi-fault conditions. The 111-bus system which is a part of Surabaya distribution is also used as a test system. Simulation results are displayed on MATLAB graphic user interface (GUI) tool that can help users to carry out computations through an interface.
KW - Depth first search algorithm
KW - Distribution system restoration
KW - GUI
KW - Radial distribution system
KW - Spanning tree
UR - http://www.scopus.com/inward/record.url?scp=85091338655&partnerID=8YFLogxK
U2 - 10.1109/ICST47872.2019.9166413
DO - 10.1109/ICST47872.2019.9166413
M3 - Conference contribution
AN - SCOPUS:85091338655
T3 - Proceedings - 2019 5th International Conference on Science and Technology, ICST 2019
BT - Proceedings - 2019 5th International Conference on Science and Technology, ICST 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 5th International Conference on Science and Technology, ICST 2019
Y2 - 30 July 2019 through 31 July 2019
ER -
