2007
DOI: 10.1016/j.epsr.2006.06.005
|View full text |Cite
|
Sign up to set email alerts
|

An improved TS algorithm for loss-minimum reconfiguration in large-scale distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
242
0
12

Year Published

2016
2016
2019
2019

Publication Types

Select...
7
2

Relationship

0
9

Authors

Journals

citations
Cited by 532 publications
(275 citation statements)
references
References 12 publications
0
242
0
12
Order By: Relevance
“…In order to obtain the power active losses for each demand level and for each candidate solution (each antibody in the population) we used the power flow algorithm detailed in [15]. The tests were developed using distribution systems with 33, 84, 136 and 417 buses and the respective data is available in [20], [21], [5] and [22]. The systems with 33, 84 and 136 nodes are test systems and the one with 417 nodes is a real distribution network.…”
Section: Applications and Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…In order to obtain the power active losses for each demand level and for each candidate solution (each antibody in the population) we used the power flow algorithm detailed in [15]. The tests were developed using distribution systems with 33, 84, 136 and 417 buses and the respective data is available in [20], [21], [5] and [22]. The systems with 33, 84 and 136 nodes are test systems and the one with 417 nodes is a real distribution network.…”
Section: Applications and Resultsmentioning
confidence: 99%
“…In this sense, the literature related with the DSR problem assuming fixed demand levels includes publications reporting the use of heuristic algorithms [1][2], metaheuristics as Genetic Algorithms [3], Simulated Annealing [4], Tabu Search [5], Ant Colonies [6], GRASP [7], Artificial Neural Networks [8] and Artificial Immune Systems [9]. On the other hand, references [10][11][12][13] address the DSR problem assuming variable demand levels.…”
Section: Introductionmentioning
confidence: 99%
“…Algunas de las técnicas mono-objetivo más empleadas son: algoritmo genético [50], enjambre de partículas [51], recocido simulado [52], búsqueda tabú [53], algoritmos inmunes [54], colonia de hormigas [55], enjambre de abejas [56], entre otros. Dentro las técnicas multi-objetivo, las más conocidas y empleadas son: algoritmo de ordenamiento no dominado (NSGA, por sus siglas en inglés) [57] y el algoritmo caótico artificial colonia de abejas (CABC, de sus siglas en inglés) [58].…”
Section: Métodos Heurísticos Y Metaheurísticosunclassified
“…In [4], the authors solving the problem of distribution network reconfiguration apply both the algorithms for the construction of a maximum spanning tree and the simplified approaches to specification of currents and power losses. It is probably this simplification that did not allow the researchers to find better solutions which were obtained with the help of other algorithms, for example, in [5].…”
Section: Introductionmentioning
confidence: 99%