Simulated annealing and tabu search applied on network reconfiguration in distribution systems

摘要

This article presents two algorithms that can solve combinatorial optimization problems such as network reconfiguration for loss reduction. The power summation method is used to calculate losses of the systems. Simulated Annealing is a technique that can accept worse solutions in order to scape from local minimum. The algorithm Tabu Search uses a memory structure called tabu list to avoid local minimum. Both methods presented good results and were tested in two distribution systems.