An Approach to Optimal Distribution System Planning Through Conductor Gradation

Enhancement of Loading of Radial Distribution Networks Using Optimal Conductor Size

“…Although their algorithm was based on realistic assumptions and reliable optimization techniques, it was relatively complicated to handle for the engineer. A model to represent feeder cost, energy loss cost and voltage regulation as a function of conductor cross−section and an objective function for optimizing the conductor cross−section had been formulated by Ponnavaikkio and Prakasa Rao [2]. The method proposed in [2] had taken into account the non−uniform distribution of loads along with the length of feeder and load growth in the future years of the plan period.…”

“…A model to represent feeder cost, energy loss cost and voltage regulation as a function of conductor cross−section and an objective function for optimizing the conductor cross−section had been formulated by Ponnavaikkio and Prakasa Rao [2]. The method proposed in [2] had taken into account the non−uniform distribution of loads along with the length of feeder and load growth in the future years of the plan period. A direct solution procedure for conductor grading was proposed, thereby eliminating the complexity of the dynamic programming approach by Rao [3] A new computational procedure for obtaining the optimal conductor grading policy using PPR model was proposed, which was extremely simple and require very little computation and needed very little computer storage.…”

“…In [4] a new technique of optimizing the feeder routing problem which minimized the total cost of feeder subject to a [2] developed a mathematical model for the problem, and presented multi stage decision dynamic programming method. However, this method failed in handling the large problem and showed only approximate results.…”

A set of new formulations and hybrid algorithms for distribution system planning

“…In the last twenty years, many algorithms for solving this complex problem have been used and documented [1]~ [15]. These algorithms can be categorized by different treatments of planning periods: static planning [5,9,10,14], pseudo-dynamic planning, and dynamic planning (which has several planning periods) [3,6,8,11,12].…”

“…Generally, static planning is the key to and base of pseudo-dynamic planning and dynamic planning. Some existing techniques of static planning focus on the substation location/capacity problem [4], while others have tackled only the feeder section sizing problem [1,7,15]. The more difficult issues of solving simultaneous selection of substations and feeders have also been proposed ( [5,9,10,11,14]).…”