Power system reconfiguration based on Prim's algorithm

The distribution network can undergo outages, during which the supply of power is either partially or completely isolated from distribution network to the load centres. To achieve minimum deficit of power supply, proper switching of power lines is required. The power flow path identification in the network is the complicated task of the distribution operators. Based on the survey the papers published have always used some predefined rules in identifying the power flow path, sometimes it may lead to cascaded outage. Hence the identification of the path was the major drawback of other proposed methodologies. The scope of the proposed work is to find the path using Prim's algorithm for a power distribution network. The algorithm is used here because it provides a path which consists of all the possible buses through which the power will flow. A computer program has been, developed for planning and operation in service restoration of distribution network. The validity of this new approach has been tested on 16 bus IEEE Power Distribution System. The results obtained have reduced the losses considerably without using any optimization techniques and the amount of load shed is less when compared to the reference papers.

[1]  Qian Ai,et al.  Research of PMU optimal placement in power systems , 2005 .

[2]  Jizhong Zhu,et al.  Refined genetic algorithm for minimum-loss reconfiguration of electrical distribution network , 1998, Proceedings of EMPD '98. 1998 International Conference on Energy Management and Power Delivery (Cat. No.98EX137).

[3]  Fernando José Von Zuben,et al.  On-Line Approach for Loss Reduction in Electric Power Distribution Networks Using Learning Classifier Systems , 2001, IWLCS.

[4]  H. Mori,et al.  A fast method for topological observability analysis using a minimum spanning tree technique , 1991 .

[5]  M. Omair Ahmad,et al.  Scheduling of DSP data flow graphs onto multiprocessors for maximum throughput , 1999, ISCAS'99. Proceedings of the 1999 IEEE International Symposium on Circuits and Systems VLSI (Cat. No.99CH36349).

[6]  A. Morelato,et al.  Dynamic evaluation of reenergization times during power systems restoration , 2004, 2004 IEEE/PES Transmision and Distribution Conference and Exposition: Latin America (IEEE Cat. No. 04EX956).

[7]  S.-P. Chan,et al.  An electrical method for finding suboptimal routes , 1989, IEEE International Symposium on Circuits and Systems,.

[8]  Christiano Lyra,et al.  Minimization of energy losses in electric power distribution systems by intelligent search strategies , 1997 .

[9]  Michael Barbehenn,et al.  A Note on the Complexity of Dijkstra's Algorithm for Graphs with Weighted Vertices , 1998, IEEE Trans. Computers.

[10]  Chi-Yuan Lo,et al.  A space-efficient short-finding algorithm [VLSI layouts] , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[11]  S. Sivanagaraju,et al.  A Simple Method for Feeder Reconfiguration and Service Restoration of Distribution Networks , 2004 .

[12]  Yixin Yu,et al.  Loads combination method based core schema genetic shortest-path algorithm for distribution network reconfiguration , 2002, Proceedings. International Conference on Power System Technology.

[13]  Roy Billinton,et al.  Reliability evaluation algorithm for complex medium voltage electrical distribution networks based on the shortest path , 2003 .