A Branch And Bound Formulation To An Electricity Distribution Planning Problem
- 1 August 1985
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Power Apparatus and Systems
- Vol. PAS-104 (8) , 2112-2118
- https://doi.org/10.1109/tpas.1985.318789
Abstract
The application of a branch-and-bound method to a heuristic circuit-optimisation algorithm for electricity distribution planning is described. The intention is to produce a family of near-optimal designs, to a given planning problem. The principal results of this approach are twofold. First, a clearer understanding of the complex network modelling problem is obtained, and secondly the imaginative development of branch-and-bound formulation for optimisation purposes is stimulated.Keywords
This publication has 5 references indexed in Scilit:
- Circuit Optimisation Algorithm for Electrical Networks Using Dynamic Contingency AnalysisIEEE Transactions on Power Apparatus and Systems, 1981
- Transmission Expansion by Branch-and-Bound Integer Programming with Optimal Cost - Capacity CurvesIEEE Transactions on Power Apparatus and Systems, 1974
- Computers in power system planningProceedings of the IEEE, 1974
- Optimal planning of power networks using mixed-integer programming. Part 1: Static and time-phased network synthesisProceedings of the Institution of Electrical Engineers, 1974
- The logical design of electrical networks using linear programming methodsProceedings of the IEE - Part A: Power Engineering, 1960