Abstract:The proposal of this paper is on a simple and fast distribution load flow solution algorithm. The proposed method fully exploits the radial structure of the network and solves the distribution load flow directly using the single dimension vectors. An effective data structure is proposed to identify lines and number of lines available beyond the particular line. Using this concept, power summations are calculated to obtain the distribution load flow solution. Unlike other traditional methods, the proposed method consider the effective convergence approach which is not only simple and fast but also is efficient from time perspective and needs very less memory for any size of the distribution system compared with the existing methods. The proposed concept was tested on standard distribution system and results are promising and have great potential for applications in the distribution automation.Keywords: Load flow solution, line path identification, sparse technique, distribution automation, distribution systems
IntroductionThere are many solution techniques for load flow calculations. However, an acceptable load flow method should meet the requirements [1] such as high speed and low storage requirements, highly reliable, and accepted versatility and simplicity.In fact, conventional load flow methods, which were developed to solve the transmission networks, encounter convergence problems when applied to distribution networks due to high R/X ratio. In view of the topological specialty of distribution networks, and non-applicability of the transmission networks power flows, researchers has proposed several special load flow techniques for distribution networks [2][3][4][5][6][7][8]. The methods [2-8] derive quadratic equations that relate the sending and receiving end voltage magnitudes with a strong convergence characteristic and speed. However, these solution procedures depend on the knowledge of the distribution system structure.The methods [9][10][11] have presented power flow problem of distribution systems in terms of sets of recursive equations and analyzed power flow results for various voltage dependent load models. D. Das et al. [12,13] have presented proposed a simple algebraic recursive expression of voltage magnitude and the proposed algorithm uses the basic principle of the circuit theory. J. Liu et al. [14] have proposed Ratio-Flow method based on forward-backward ladder equation for complex distribution system by using voltage ratio for convergence control. B. Venkatesh and R. Ranjan [15] have shown th ability of automation algorithms to handle these complex tasks that require frequent topology changes in the RDS demands a dynamic topology processor based on a well-defined data structure.J. H. Teng [16] has proposed a direct approach by using the topological characteristics of the distribution networks to solve the power flow problem. A. Dimitrovski and K. Tomsovic [17] have presented a boundary power flow solution, which considers the uncertainty in nodal powers as boundary values. Jabr ...
Abstract. This paper presents optimal branch conductor selection of radial distribution systems using Particle Swarm Optimization. The problem is posed as an optimization problem with an objective to minimize the overall cost of annual energy losses and depreciation on the cost of conductors. The conductor, which is determined by this method will satisfy the maximum current carrying capacity and maintain acceptable voltage levels of the radial distribution system. Besides, it gives maximum saving in the capital cost of conducting material and cost of energy losses. The effectiveness of the proposed method is demonstrated through different examples.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.