A Branch and Bound Model for Choosing Optimal Substation Locations

A distribution planning model is formulated which considers existing and potential substation locations, their capacities and costs, together with the primary feeder network represented by small area demand locations to represent non-uniform loads, and feeder segments having variable distribution costs and limited capacities. A branch and bound search method is described which utilizes a shortest path table to obtain lower bounds and solutions from a transshipment linear programming model for upper bounds. The solution of a small example is presented in detail, and computational results for several larger problems are summarized.