A graph theory based power system restoration plan

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.