2000 Power Engineering Society Summer Meeting (Cat. No.00CH37134)
DOI: 10.1109/pess.2000.867414
|View full text |Cite
|
Sign up to set email alerts
|

A parallel tabu search based method for reconfigurations of distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
26
0
2

Publication Types

Select...
6
3

Relationship

0
9

Authors

Journals

citations
Cited by 64 publications
(28 citation statements)
references
References 15 publications
0
26
0
2
Order By: Relevance
“…The SA algorithm with tabu search (TS) was incorporated in [35] for loss reduction by Jeon et al The TS attempted to determine a better solution in the manner of a greatest-descent algorithm but it could not give any guarantee for the convergence property. A parallel TS (PTS) [36] based method was proposed for feeder reconfiguration by Mori et al and TS algorithm was presented [37] for solving the problem of network reconfiguration in distribution systems in order to reduce [38] for loss-minimization reconfiguration in large-scale distribution systems. A modified TS (MTS) [39,40] based algorithm was used for reconfiguration of distribution systems using turning on/off sectionalizing switches to minimize active power losses.…”
Section: Introductionmentioning
confidence: 99%
“…The SA algorithm with tabu search (TS) was incorporated in [35] for loss reduction by Jeon et al The TS attempted to determine a better solution in the manner of a greatest-descent algorithm but it could not give any guarantee for the convergence property. A parallel TS (PTS) [36] based method was proposed for feeder reconfiguration by Mori et al and TS algorithm was presented [37] for solving the problem of network reconfiguration in distribution systems in order to reduce [38] for loss-minimization reconfiguration in large-scale distribution systems. A modified TS (MTS) [39,40] based algorithm was used for reconfiguration of distribution systems using turning on/off sectionalizing switches to minimize active power losses.…”
Section: Introductionmentioning
confidence: 99%
“…These algorithms permit the transition between local optima of the feasible region, as well as a more focused search in each subspace. Algorithms based on meta-heuristics, such as Genetic Algorithms [12][13][14][15][16], Simulated Annealing [17,18], Artificial Ant Colony [19] and Tabu Search [20,21], have been used to solve the problem of EDS reconfiguration. With the same purpose in mind, Ref.…”
Section: Introductionmentioning
confidence: 99%
“…TS algorithm which is introduced into the tabu list can escape from local optimal solution and has a strong ability of global optimization, parallel tabu search algorithm (parallel TABU search, the PTS) [18] has the following characteristics: 1) According to the partition ideological decomposition of the neighborhood; 2) multiple processors at the same time used to search, and set a variety of tabu length. PTS based on the idea of partition method, broke down the solution space into multiple sub-space, then search in parallel by multiple processors.…”
Section: Introductionmentioning
confidence: 99%