BRANCH AND BOUND FORMULATION TO AN ELECTRICITY DISTRIBUTION PLANNING PROBLEM.

Abstract

The application of a branch-and-bound method to a heuristic circuit-optimization 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 modeling problem is obtained, and secondly the imaginative development of branch-and-bound formulation for optimization purposes is stimulated. The branch-and-bound formulation as described could only be useful for a step-by-step synthesis process which proceeds to a solution from a preliminary design. The formulation is independent of the actual preliminary design used, the circuit exchange strategy, and the network security requirements, all of which may be varied without affecting the formulation.