1101. Optimal planning of power networks using mixed-integer programming. Part 1: Static and time-phased network synthesis
- Author
-
M.A. Laughton and R.N. Adams
- Subjects
Optimal design ,Mathematical optimization ,Linear programming ,Network security ,business.industry ,Computer science ,General Engineering ,Optimal planning ,General Medicine ,Network synthesis filters ,business ,Integer programming ,Scheduling (computing) - Abstract
A mixed-integer linear programming approach to the planning of electrical-power networks is described. The method is based on an interpretation of fixed-cost transportation-type models, and includes both network security and costs of network losses. Both single-period and multitime-period planning problems are considered. A large general-purpose mathematical programming system is used to obtain solutions using branch-and-bound algorithms, and the practical aspects of organising the problems and controlling the branch-and-bound tree search within a modern m.p.s. package are discussed. Three case studies are presented for illustration: the optimal design of a 132 kV subtransmission system, the optimal time-phased design of the same system over. eight years, and the optimal layout and cable selection for a new housing-estate low-voltage network. The paper concludes by indicating potential further applications of the method for scheduling, for example, new plant at substations.
- Published
- 1974
- Full Text
- View/download PDF