An Efficient Algorithm for Load-Flow Solution of Radial Distribution Networks

dc.contributor.authorMurari, Krishna
dc.contributor.supervisorGhosh, Smarajit
dc.date.accessioned2014-08-11T08:09:18Z
dc.date.available2014-08-11T08:09:18Z
dc.date.issued2014-08-11T08:09:18Z
dc.descriptionME, EIEDen
dc.description.abstractIn this thesis, a new method has been proposed for load-flow calculation of radial distribution systems. The aim of this thesis is to propose a method to identify the nodes beyond each branch with lesser computation. Matrix method has been used in this work to find branch currents, node voltages and power loss in a radial distribution network. The matrix reduces computational time and the solution converges in lesser number of iterations. Simple equations have been used. Effectiveness of this method has been tested on 33- bus and 69- bus radial distribution systems with constant power (CP), constant current (CC), constant impedance (CZ) composite and exponential load modelling. The proposed method converges well for constant power, constant current, constant impedance, composite and exponential load modelling. The superiority of proposed method has compared with existing methods [8,26,27] in terms of relative values CPU time and memory size. The proposed method requires much less time to converge and also require less memory size when compared with the existing methods [8,26,27].en
dc.format.extent995064 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.urihttp://hdl.handle.net/10266/2858
dc.language.isoenen
dc.subjectLoad-flow, Radial,en
dc.subjectcomposite, Exponentialen
dc.subjectdistribution networken
dc.subjectconvergence rateen
dc.titleAn Efficient Algorithm for Load-Flow Solution of Radial Distribution Networksen
dc.typeThesisen

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
KRISHNA MURARI (801241012).pdf
Size:
971.74 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.79 KB
Format:
Item-specific license agreed upon to submission
Description: