A Graph Theory Based Power System Restoration Plan
S. Hemalatha1, R. Srinivasan2, A. Ruban Raja3
1S. Hemalatha, Professor, Department of Electrical and Electronics, Joseph’s Institute of Technology, Chennai, India.
2R. Srinivasan, Professor, Department of Electrical and Electronics, Joseph’s Institute of Technology, Chennai, India.
3A. Ruban Raja, Professor, Department of Electrical and Electronics, Joseph’s Institute of Technology, Chennai, India.
Manuscript received on 18 June 2019 | Revised Manuscript received on 25 June 2019 | Manuscript Published on 19 June 2019 | PP: 551-556 | Volume-8 Issue-8S June 2019 | Retrieval Number: H10920688S19/19©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: Power system restoration planning is necessary in order to make the restoration more reliable and effective, thereby preventing further blackouts during the restoration process. In this paper an efficient graph theory based restoration plan is used in place of heuristics based algorithms. In the proposed plan, an extension of Dijkstra’s algorithm is being used to obtain a reliable power system restoration. The restoration plan is executed in WSCC 9 Bus System and New England 39 Bus System.
Keywords: Power System Restoration, Load Pickup, Dijkstra’s Algorithm, Graph Theory Technique.
Scope of the Article: System Integration