
Graph theory‐based radial load flow analysis to solve the dynamic network reconfiguration problem
Author(s) -
Aman Muhammad M.,
Jasmon Ghauth B.,
Abu Bakar Abdul Halim,
Mokhlis Hazlie,
Naidu Kanendra
Publication year - 2016
Publication title -
international transactions on electrical energy systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.428
H-Index - 42
ISSN - 2050-7038
DOI - 10.1002/etep.2108
Subject(s) - control reconfiguration , computer science , network topology , mathematical optimization , electric power system , graph theory , topology (electrical circuits) , jacobian matrix and determinant , node (physics) , graph , reactance , power (physics) , mathematics , engineering , theoretical computer science , voltage , computer network , physics , electrical engineering , structural engineering , quantum mechanics , combinatorics , embedded system
Summary Radial load flow (RLF) methods are frequently used in solving distribution system problems. The conventional Jacobian‐based load flow methods (e.g., Newton–Raphson) may fail to converge in solving distribution system due to high resistance to reactance ratio of distribution lines. RLF methods are based on sweep‐based mechanism and require that the line data must be arranged in accordance with network topology. This problem needs special attention particularly in case of solving dynamic power system problems, where topology of the network changes with tie switches position (network reconfiguration problem). This paper has presented an intelligent graph theory‐based RLF analysis to solve “dynamic” problems. The proposed algorithm will help in arranging line data for any combination of tie switch positions, to check the radiality of the system and to ensure that all nodes are connected with the source node. The effectiveness of the proposed method is also validated by solving 16‐bus and 33‐bus network reconfiguration problem using graph theory‐based RLF method. Copyright © 2015 John Wiley & Sons, Ltd.