Supply restoration in distribution networks using Dijkstra's algorithm

The power quality service is necessary demand in near future of the customer's. The fast service restoration has been a hot issue with fault tolerable distribution system in maintaining power quality. When a fault takes place, it results in the isolation of some portion of the feeder downstream from the affected areas. So this paper describes a high speed-switching algorithm for a distribution network that has been developed with the aim of reducing the time of the restoration and maximizes the amount of power restored. The algorithm developed isolates only the fault section and restores the power supply to normal sections after a fault takes place. The algorithm developed is based on network reduction and determination of the optimal configuration of the reduced network by using Dijkstra's algorithm. The developed algorithm is tested on a standard system and then it is applied for practical systems.