Heuristic determination of distribution trees

Víctor Parada, Jacques A. Ferland, Miguel Arias, Pablo Schwarzenberg, Luis S. Vargas

Resultado de la investigación: Article

7 Citas (Scopus)

Resumen

Electrical distribution networks develop configurations that deviate from the original long-term plan. The Distribution Trees Problem (DTP) is one means of measuring this development, which finds the deviation between long-term planning and the optimal topology for the actual conditions of the network. Each feasible solution corresponds to a set of directed out-trees rooted at the substations. DTP takes into account characteristics of the substations and consumer demand. It also determines the optimal topology of the network to distribute electrical energy at minimum cost. In this paper, we use two search techniques to solve this problem: 1) simulated annealing and 2) tabu search. Nine different problems within 500 to 30\thinspace 000 consumer points and 20 substations were used to calibrate the parameters of both methods and to compare their efficiency. The numerical results indicate that the efficiency of simulated annealing decreases as the problem size increases, and that tabu search is more efficient than simulated annealing.

Idioma originalEnglish
Número de artículo5371821
Páginas (desde-hasta)861-869
Número de páginas9
PublicaciónIEEE Transactions on Power Delivery
Volumen25
N.º2
DOI
EstadoPublished - 1 abr 2010

Huella dactilar

Simulated annealing
Tabu search
Topology
Electric power distribution
Planning
Costs

ASJC Scopus subject areas

  • Energy Engineering and Power Technology
  • Electrical and Electronic Engineering

Citar esto

Parada, V., Ferland, J. A., Arias, M., Schwarzenberg, P., & Vargas, L. S. (2010). Heuristic determination of distribution trees. IEEE Transactions on Power Delivery, 25(2), 861-869. [5371821]. https://doi.org/10.1109/TPWRD.2009.2033929
Parada, Víctor ; Ferland, Jacques A. ; Arias, Miguel ; Schwarzenberg, Pablo ; Vargas, Luis S. / Heuristic determination of distribution trees. En: IEEE Transactions on Power Delivery. 2010 ; Vol. 25, N.º 2. pp. 861-869.
@article{3ef063165b1d48a1b107bae9988727c9,
title = "Heuristic determination of distribution trees",
abstract = "Electrical distribution networks develop configurations that deviate from the original long-term plan. The Distribution Trees Problem (DTP) is one means of measuring this development, which finds the deviation between long-term planning and the optimal topology for the actual conditions of the network. Each feasible solution corresponds to a set of directed out-trees rooted at the substations. DTP takes into account characteristics of the substations and consumer demand. It also determines the optimal topology of the network to distribute electrical energy at minimum cost. In this paper, we use two search techniques to solve this problem: 1) simulated annealing and 2) tabu search. Nine different problems within 500 to 30\thinspace 000 consumer points and 20 substations were used to calibrate the parameters of both methods and to compare their efficiency. The numerical results indicate that the efficiency of simulated annealing decreases as the problem size increases, and that tabu search is more efficient than simulated annealing.",
keywords = "Distribution trees problem (DTP), Electrical energy distribution, Simulated annealing, Tabu search",
author = "V{\'i}ctor Parada and Ferland, {Jacques A.} and Miguel Arias and Pablo Schwarzenberg and Vargas, {Luis S.}",
year = "2010",
month = "4",
day = "1",
doi = "10.1109/TPWRD.2009.2033929",
language = "English",
volume = "25",
pages = "861--869",
journal = "IEEE Transactions on Power Delivery",
issn = "0885-8977",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "2",

}

Parada, V, Ferland, JA, Arias, M, Schwarzenberg, P & Vargas, LS 2010, 'Heuristic determination of distribution trees', IEEE Transactions on Power Delivery, vol. 25, n.º 2, 5371821, pp. 861-869. https://doi.org/10.1109/TPWRD.2009.2033929

Heuristic determination of distribution trees. / Parada, Víctor; Ferland, Jacques A.; Arias, Miguel; Schwarzenberg, Pablo; Vargas, Luis S.

En: IEEE Transactions on Power Delivery, Vol. 25, N.º 2, 5371821, 01.04.2010, p. 861-869.

Resultado de la investigación: Article

TY - JOUR

T1 - Heuristic determination of distribution trees

AU - Parada, Víctor

AU - Ferland, Jacques A.

AU - Arias, Miguel

AU - Schwarzenberg, Pablo

AU - Vargas, Luis S.

PY - 2010/4/1

Y1 - 2010/4/1

N2 - Electrical distribution networks develop configurations that deviate from the original long-term plan. The Distribution Trees Problem (DTP) is one means of measuring this development, which finds the deviation between long-term planning and the optimal topology for the actual conditions of the network. Each feasible solution corresponds to a set of directed out-trees rooted at the substations. DTP takes into account characteristics of the substations and consumer demand. It also determines the optimal topology of the network to distribute electrical energy at minimum cost. In this paper, we use two search techniques to solve this problem: 1) simulated annealing and 2) tabu search. Nine different problems within 500 to 30\thinspace 000 consumer points and 20 substations were used to calibrate the parameters of both methods and to compare their efficiency. The numerical results indicate that the efficiency of simulated annealing decreases as the problem size increases, and that tabu search is more efficient than simulated annealing.

AB - Electrical distribution networks develop configurations that deviate from the original long-term plan. The Distribution Trees Problem (DTP) is one means of measuring this development, which finds the deviation between long-term planning and the optimal topology for the actual conditions of the network. Each feasible solution corresponds to a set of directed out-trees rooted at the substations. DTP takes into account characteristics of the substations and consumer demand. It also determines the optimal topology of the network to distribute electrical energy at minimum cost. In this paper, we use two search techniques to solve this problem: 1) simulated annealing and 2) tabu search. Nine different problems within 500 to 30\thinspace 000 consumer points and 20 substations were used to calibrate the parameters of both methods and to compare their efficiency. The numerical results indicate that the efficiency of simulated annealing decreases as the problem size increases, and that tabu search is more efficient than simulated annealing.

KW - Distribution trees problem (DTP)

KW - Electrical energy distribution

KW - Simulated annealing

KW - Tabu search

UR - http://www.scopus.com/inward/record.url?scp=77950187834&partnerID=8YFLogxK

U2 - 10.1109/TPWRD.2009.2033929

DO - 10.1109/TPWRD.2009.2033929

M3 - Article

AN - SCOPUS:77950187834

VL - 25

SP - 861

EP - 869

JO - IEEE Transactions on Power Delivery

JF - IEEE Transactions on Power Delivery

SN - 0885-8977

IS - 2

M1 - 5371821

ER -

Parada V, Ferland JA, Arias M, Schwarzenberg P, Vargas LS. Heuristic determination of distribution trees. IEEE Transactions on Power Delivery. 2010 abr 1;25(2):861-869. 5371821. https://doi.org/10.1109/TPWRD.2009.2033929