2013
DOI: 10.9790/3021-03140106
|View full text |Cite
|
Sign up to set email alerts
|

Dijkstra Algorithm for Feeder Routing of Radial Distribution System

Abstract: 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 minimising 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.… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2016
2016
2017
2017

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 13 publications
0
2
0
Order By: Relevance
“…In related research, the defined radial distribution feeder routing with Dijkstra's algorithm reduces the fixed cost, energy cost, and interruption cost (Jha and Vidyasagar, 2013). In DG allocation and sizing, Harmony Search (HS) was used to solve the problem.…”
Section: Introductionmentioning
confidence: 99%
“…In related research, the defined radial distribution feeder routing with Dijkstra's algorithm reduces the fixed cost, energy cost, and interruption cost (Jha and Vidyasagar, 2013). In DG allocation and sizing, Harmony Search (HS) was used to solve the problem.…”
Section: Introductionmentioning
confidence: 99%
“…The problem above was a provocation, causing a significant money to improve the distribution line, distribution transformer, and substation building to accommodate the active power loss [1]. In related research, the defined radial distribution feeder routing with Dijkstra's algorithm to reduces the fixed cost, energy cost, and interruption cost [2].The other proposed the feeder routing for reducing the cost of energy loss by finding the shortest path to the distribution system [3]. In DG allocation and sizing, theHSwas used to solve the problem.The objective was determined by the voltage and the capacitor.In the experiments using the IEEE33-bus and IEEE 69-bus system to compared the results with the GAand Refine Genetic Algorithm(RGA).The results showed the HSwas the best efficient in processing time [4].…”
Section: Introductionmentioning
confidence: 99%