A directed graph formulation of the multistage distribution expansion problem

In this paper, the objectives and detailed analysis of the multistage distribution expansion are presented. The problem is modeled as a directed graph minimum edge cost network flow problem. This new formulation details a multistage framework within a single mathematical program while addressing several deficiencies of previous approaches. The accuracy of a single step approximation of the objective function, without using the conventional linearization techniques, is discussed. Each of the constraints is introduced in terms of industry standard practices. Detailed numerical results for practical study cases are provided in a separate paper.

[1]  T. Gönen,et al.  Computer-aided design of power-distribution systems: multiobjective mathematical simulations , 1994 .

[2]  U. G. Knight,et al.  The logical design of electrical networks using linear pro-gramming methods , 1960 .

[3]  M. Blanchard,et al.  Experience with optimization software for distribution system planning , 1996 .

[4]  R. N. Adams,et al.  Optimal planning of power networks using mixed-integer programming. Part 1: Static and time-phased network synthesis , 1974 .

[5]  S. Gupta,et al.  Automated primary distribution system design: reliability and cost optimization , 1996, Proceedings of 1996 Transmission and Distribution Conference and Exposition.

[6]  Roy Billinton,et al.  Minimum Cost Analysis of Feeder Routing in Distribution System Planning , 1996, IEEE Power Engineering Review.

[7]  D. Sun,et al.  Calculation of Energy Losses in a Distribution System , 1980, IEEE Transactions on Power Apparatus and Systems.

[8]  K. Tomsovic,et al.  Distribution expansion problem: formulation and practicality for a multistage globally optimal solution , 2001, 2001 IEEE Power Engineering Society Winter Meeting. Conference Proceedings (Cat. No.01CH37194).

[9]  R. Hackam,et al.  Dynamic solution of distribution planning in intermediate time range , 1988 .

[10]  Ravindra K. Ahuja,et al.  Network Flows: Theory, Algorithms, and Applications , 1993 .

[11]  N. Kagan,et al.  A Benders' decomposition approach to the multi-objective distribution planning problem , 1993 .

[12]  M. A. El-Kady.  Computer-Aided Planning of Distribution Substation and Primary Feeders , 1984, IEEE Power Engineering Review.

[13]  Obrad M. Mikic,et al.  Mathematical Dynamic Model for Long-Term Distribution System Planning , 1986, IEEE Transactions on Power Systems.

[14]  K. Aoki,et al.  Multi-year expansion planning for distribution systems , 1991 .

[15]  Y. Tang,et al.  Power distribution system planning with reliability modeling and optimization , 1996 .

[16]  K. R. Nayar,et al.  Optimal operation of distribution networks by quadratic programming methods , 1970 .

[17]  T. Gönen,et al.  Mathematical dynamic optimization model for electrical distribution system planning , 1982 .

[18]  K. S. Prakasa Rao,et al.  An Approach to Optimal Distribution System Planning Through Conductor Gradation , 1982, IEEE Transactions on Power Apparatus and Systems.

[19]  K. Tomsovic,et al.  Numerical analyses of a directed graph formulation of the multistage distribution expansion problem , 2004, IEEE Transactions on Power Delivery.

[20]  R. Shoults,et al.  Optimal Distribution Substation and Primary Feeder Planning VIA the Fixed Charge Network Formulation , 1982, IEEE Transactions on Power Apparatus and Systems.

[21]  I.J. Ramirez-Rosado,et al.  Pseudodynamic planning for expansion of power distribution systems , 1991, IEEE Power Engineering Review.

[22]  Turan Gonen,et al.  Electric power distribution system engineering , 1985 .

[23]  Turan Gonen,et al.  Optimal Multi-Stage Planning of Power Distribution Systems , 1987, IEEE Transactions on Power Delivery.