版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Natl Inst Technol Dept Elect & Elect Engn Nagaland Dimapur 797103 India
出 版 物:《JOURNAL OF ELECTRICAL ENGINEERING & TECHNOLOGY》 (J. Electr. Eng. Technol.)
年 卷 期:2022年第17卷第6期
页 面:3263-3274页
核心收录:
主 题:Network reconfiguration Search algorithms Voltage stability Graph theory
摘 要:Nowadays, power system reconfiguration has received much interest and has achieved significant progress. Reconfiguration can be accomplished by modifying the status of the sectionalizing switches or tie switches. The main objective of a network reconfiguration strategy is to reduce power loss, relieve overloading and improve load end voltage profile. This study reviews the advancement of power system reconfiguration research using graph theory including optimization-based approaches. In the context of determining the optimal radial network using graph theory-based strategies are also discussed. Network reconfiguration mechanism, which includes different graph theory analysis such as Prim s Minimal Spanning Tree, Dijkstra s Shortest Path Algorithm, Kruskal s Maximal Spanning Tree, Edmonds Maximal Spanning Tree are presented. Four different code for the above graph theory techniques which already been implemented by previous researchers have been simulated and generate candidate solutions for 14 node system. The simulations demonstrate step by step procedure of the network reconfiguration mechanism. Moreover, simulation results verify that the graph theory approach can give good solution for Network reconfiguration with optimal radial network, less power loss and higher level of load voltage.