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