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


Autoria(s): Franco, John; Lavorato, Marina; Rider, Marcos J.; Romero, Ruben
Contribuinte(s)

Universidade Estadual Paulista (UNESP)

Data(s)

27/05/2014

27/05/2014

11/12/2012

Resumo

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.

Formato

1-8

Identificador

http://dx.doi.org/10.1109/PESGM.2012.6345048

IEEE Power and Energy Society General Meeting.

1944-9925

1944-9933

http://hdl.handle.net/11449/74060

10.1109/PESGM.2012.6345048

WOS:000312493703052

2-s2.0-84870600662

Idioma(s)

eng

Relação

IEEE Power and Energy Society General Meeting

Direitos

closedAccess

Palavras-Chave #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
Tipo

info:eu-repo/semantics/conferencePaper