a resilience-oriented graph-based method for restoration of critical loads in distribution networks using microgrids

This paper presents a resilience-based approach for critical load restoration in distribution networks using microgrids during extreme events when the main supply is disrupted. reconfiguration of the distribution network using graph theory is investigated, for which dijkstra’s algorithm is first used to determine the shortest paths between microgrids and critical loads, and then the feasible restoration trees are established by combining the restorable paths. a mixed-integer linear programming (milp) model is then used to find the optimal selection of feasible restoration trees to make a restoration scheme. the service restoration is implemented with the objectives of maximizing the energy delivered to the critical loads and minimizing the number of switching operations. the limited fuel storage of the generation sources in microgrids, the operational constraints of the network and microgrids, as well as the radiality constraint of the restored sub-networks, are considered the constraints of the optimization problem. the presented method can be used for optimal restoration of critical loads including the number of switching operations which is essential for the ease of implementation of a restoration plan. the results of simulations on a 118-bus distribution network demonstrate the efficiency of the procedure.