برنامه ریزی مطلوب از شبکه های توزیع شهری مبتنی بر مسیر راه

This paper presents a method for optimal planning of new urban distribution networks based upon the selection of the best subset of paths providing back feed from the entire path set generated for the available cable routes. The optimal solution is the path subset providing minimum total annual cost including capital recovery, loss and undelivered energy costs while satisfying all technical constraints. The impacts of distributed generator units, if available, can be also taken into account in the optimization flow. The reliability requirements are additionally assured by introducing SAIFI and SAIDI constraints. The method allows for common trenches for cables and different sizes of feeders depending on their loads. The planner is allowed to choose the concept of back feed, through only feeders interconnecting source nodes, ring feeders or by the best combination of these two structures. During the optimization process the optimal distribution system trees are generated providing minimum loss operation. The search for the optimal network is conducted using the simulated annealing algorithm.