International Journal of Science and Research (IJSR)

International Journal of Science and Research (IJSR)
Call for Papers | Fully Refereed | Open Access | Double Blind Peer Reviewed

ISSN: 2319-7064

Downloads: 116 | Views: 174

M.Tech / M.E / PhD Thesis | Electrical Engineering | India | Volume 3 Issue 9, September 2014

A Technique of Global Optimal Solution for Radial Distribution System by Using Load Flow Analysis

P. Raju [3] | K. Sridhar [2]

Abstract: This paper proposes the application of Direct Approach algorithm for feeder routing of radial distribution system. For which a complete network of available routes is considered and the optimization goal is to find the routes that provide the minimum number of energizing nodes for existing network and load flow analysis for the same network. The feasibility of proposed algorithm is applied on 25 nodes and 24 branches distribution network. This paper proposes a simple direct solution that significantly reduces the inherent difficulties of finding the solution and ensures optimum solution at the same time. Moreover, the concept of optimality is effectively used to make the proposed technique more computationally efficient and useful. This approach builds on simple concept that depends solely on tracking of radial paths and calculating losses associated with the paths. An easy step by step building algorithm is proposed to find the radial paths existing in a system. The work has also explored the advantage of optimality and successfully established a link with radial system planning that makes the process of searching faster and more effective. The proposed technique ensures global optimal solution without being influenced by initial paths as considered in classical techniques or different parameters as required by soft computing techniques for tuning. Along with the routing, the solution of load flow is also proposed.

Keywords: Distribution system planning, direct solution approach, optimality, load flow analysis

Edition: Volume 3 Issue 9, September 2014,

Pages: 2109 - 2112

How to Download this Article?

Type Your Valid Email Address below to Receive the Article PDF Link

Verification Code will appear in 2 Seconds ... Wait