کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
399369 | 1438743 | 2014 | 20 صفحه PDF | دانلود رایگان |
• A graph theoretic based feeder routing in power distribution network is proposed.
• Effect of DG interface is also assessed.
• Provides improved reliability.
• Reduced computational burden and Easy implementation.
Feeder routing becomes more challenging as Distributed Generations (DGs) are increasingly embedded into the power distribution network. This paper presents a graph theoretic based feeder routing (a mixed non-linear integer optimization problem) in power distribution network including DGs. Graph theory is found to be much simpler and effective technique that significantly reduces the complexities of the search algorithms and provides the optimal radial path while minimizing the cost. The proposed technique has been extensively tested for different topologies of power distribution networks considering DGs and the results obtained for feeder routing is highly encouraging compared to the existing techniques. Also the reliability assessment is carried out to evaluate the reliability of the optimal radial networks including DGs.
Journal: International Journal of Electrical Power & Energy Systems - Volume 57, May 2014, Pages 11–30