Dijkstra Algorithm for Feeder Routing of Radial Distribution System
This paper proposes the application of Dijkstra algorithm for feeder routing of radial distribution system. A complete network of available routes is considered and the optimization goal is to find the routes that provide the minimal total annual cost, which is obtained by the proposed algorithm. Distribution system planning mainly concentrates upon minimizing the total annual cost, which is the summation of recovery cost, energy loss cost and undelivered energy loss cost taking in account all the constraints. The feasibility of proposed algorithm is applied on 25 nodes distribution network.