A Branch And Bound Formulation To An Electricity Distribution Planning Problem

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 clear...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE Trans. Power Appar. Syst.; (United States) 1985-08, Vol.PAS-104 (8), p.2112-2118
Hauptverfasser: BOARDMAN, J. T., MECKIFF, C. C.
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:0018-9510
2995-6323
DOI:10.1109/TPAS.1985.318789