Dynamic model for long-term expansion planning studies of power transmission systems: the Ortie model

Abstract With regard to its complexity, the long-term expansion planning problem of a power transmission system cannot be tackled without making some broad assumptions. In the present study, it is assumed that the investment variables are continuous variables and that the flow on the transmission system complies with Kirchhoff's current law only. Moreover, only the forced outage rates on thermal generation units are taken into account, whereas all other uncertainties are ignored. The problem to be solved may be defined in the following way: if the increase in demand and the structure and site of the generators are known, the maximum transfer limits of the network at each point of time of the period studied can be determined so as to minimize the investment, operation and reliability costs. Using certain assumptions, the problem is solved by linear programming techniques. The special structure of the constraint matrix makes it possible to apply two methods for solving large-scale problems: a column generation technique with maximal flow problems as subproblems, and a partitioning technique of the basis matrix.

[1]  Ahmed H. El-Abiad,et al.  Transmission Planning Using Discrete Dynamic Optimizing , 1973 .

[2]  T. C. Hu,et al.  An Application of Generalized Linear Programming to Network Flows , 1962 .

[3]  Leon S. Lasdon,et al.  Optimization Theory of Large Systems , 1970 .

[4]  L. L. Garver,et al.  Transmission Network Estimation Using Linear Programming , 1970 .

[5]  George B. Dantzig,et al.  Generalized Upper Bounding Techniques , 1967, J. Comput. Syst. Sci..

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

[7]  John Peschon,et al.  Power System Long-Term Planning in the Presence of Uncertainty , 1970 .

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

[9]  Bennett Fox,et al.  Letter to the Editor - Finding Minimal Cost-Time Ratio Circuits , 1969, Oper. Res..

[10]  J. A. Tomlin,et al.  Minimum-Cost Multicommodity Network Flows , 1966, Oper. Res..

[11]  Ralph E. Gomory,et al.  A Linear Programming Approach to the Cutting Stock Problem---Part II , 1963 .

[12]  John Peschon,et al.  A Mathematical Optimization Technique for the Expansion of Electric Power Transmission Systems , 1970 .

[13]  M. R. Rao,et al.  Allocation of Transportation Units to Alternative Trips - A Column Generation Scheme with Out-of-Kilter Subproblems , 1968, Oper. Res..

[14]  D. R. Fulkerson,et al.  Flows in Networks. , 1964 .

[15]  Esteban Hnyilicza,et al.  Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity Curves , 1974 .

[16]  R. Gomory,et al.  Multistage Cutting Stock Problems of Two and More Dimensions , 1965 .

[17]  Bennett Fox,et al.  FINDING MINIMAL COST-TIME RATIO CIRCUITS, , 1968 .

[18]  A. Merlin,et al.  Recent improvements of the Mexico model for probabilistic planning studies , 1979 .

[19]  George B. Dantzig,et al.  Decomposition Principle for Linear Programs , 1960 .

[20]  Salah E. Elmaghraby,et al.  A Loading Problem in Process Type Production , 1968, Oper. Res..

[21]  R. Gomory,et al.  A Linear Programming Approach to the Cutting-Stock Problem , 1961 .