An efficient implementation of tabu search in feeder reconfiguration of distribution systems

• Autor(a) principal: Franco, John [UNESP]
• Data de Publicação: 2012
• Outros Autores: Lavorato, Marina [UNESP], Rider, Marcos J. [UNESP], Romero, Ruben [UNESP]
• Tipo de documento: Artigo de conferência
• Idioma: eng
• Título da fonte: Repositório Institucional da UNESP
• Texto Completo: http://dx.doi.org/10.1109/PESGM.2012.6345048; http://hdl.handle.net/11449/74060
• topic: Feeder reconfiguration of distribution systems; mixed binary nonlinear programming; tabu search algorithm; Distribution systems; Efficient implementation; Electrical systems; Feeder reconfigurations; Mixed binary nonlinear programming; Objective function values; Tabu search algorithms; Current limiting reactors; Learning algorithms; Tabu search; Feeding

This 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.