Franco, John [UNESP]Lavorato, Marina [UNESP]Rider, Marcos J. [UNESP]Romero, Ruben [UNESP]2014-05-272014-05-272012-12-11IEEE Power and Energy Society General Meeting.1944-99251944-9933http://hdl.handle.net/11449/74060This paper presents an efficient tabu search algorithm (TSA) to solve the problem of feeder reconfiguration of distribution systems. The main characteristics that make the proposed TSA particularly efficient are a) the way in which the neighborhood of the current solution was defined; b) the way in which the objective function value was estimated; and c) the reduction of the neighborhood using heuristic criteria. Four electrical systems, described in detail in the specialized literature, were used to test the proposed TSA. The result demonstrate that it is computationally very fast and finds the best solutions known in the specialized literature. © 2012 IEEE.1-8engFeeder reconfiguration of distribution systemsmixed binary nonlinear programmingtabu search algorithmDistribution systemsEfficient implementationElectrical systemsFeeder reconfigurationsMixed binary nonlinear programmingObjective function valuesTabu search algorithmsCurrent limiting reactorsLearning algorithmsTabu searchFeedingTrabalho apresentado em evento10.1109/PESGM.2012.6345048WOS:000312493703052Acesso aberto2-s2.0-84870600662