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

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:2012 IEEE Power and Energy Society General Meeting s. 1 - 8
Hlavní autoři: Franco, J., Lavorato, M., Rider, M. J., Romero, R.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.07.2012
Témata:
Equations
Feeder reconfiguration of distribution systems
Linear programming
mixed binary nonlinear programming
Proposals
Search problems
Substations
tabu search algorithm
Threshold voltage
Topology
ISBN:1467327271, 9781467327275
ISSN:1932-5517
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISBN:1467327271
9781467327275
ISSN:1932-5517
DOI:10.1109/PESGM.2012.6345048