Distribution Network Planning and Design Using Branch and Bound Methods

This study presents implementation of the bound and branch methods as an optimization mathematical device for distribution network planning. A development technology concentrates on minimizing the total costs and provides extended opportunities for improvement of network operation, from the initial planning stage. The study illustrate the mathematical and the algorithm of the branch and bound method with an example to indicate the efficiency of the branch and bound in planning and design processes. It also shows that the optimal configuration strongly depends on the branching rule and on the bound calculation bases.