Planeación de sistemas secundarios de distribución usando el algoritmo branch and bound

this paper presents a methodology for solving secondary distribution systems planning problem as a mixed integer linear programming problem (milp). the algorithm takes into account several design issues such as the capacity and location of distribution transformers and secondary feeders. variable costs of secondary feeders are also considered. the problem is solved using branch and bound algorithm. numerical results show that the mathematical model and the solution technique are effective for this kind of problems.