2018 Simposio Brasileiro De Sistemas Eletricos (SBSE) 2018
DOI: 10.1109/sbse.2018.8395757
|View full text |Cite
|
Sign up to set email alerts
|

Simulated annealing and tabu search applied on network reconfiguration in distribution systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 8 publications
0
3
0
Order By: Relevance
“…This drawback is overridden by metaheuristic methods (MM), but they are more complicated in formulation with larger execution time requirements than HM. Therefore, many MM have been developed using ideas of nature behavior [9], which could be based on genetic algorithms [2], particle swarm optimization [3,10,11], tabu search [12,13], simulated annealing [13][14][15], variable scaling hybrid differential algorithm [16], ant colony [17,18], plant growth simulation [19,20], bacterial foraging [21], gray wolf [22], salp swarm [23], symbiotic organism search, hybrid cuckoo search [24], harmony search [25], and binary gravitational search [26], among others. On the other hand, mathematical optimization algorithms solve the reconfiguration problem by using conventional optimization techniques, for example, OPF by Bender Decomposition [8], mixedinteger convex programming [27,28], convex models [29], mixed-integer linear programming [30], and mixed-integer second-order cone programming [31].…”
Section: • Metaheuristic Algorithmsmentioning
confidence: 99%
“…This drawback is overridden by metaheuristic methods (MM), but they are more complicated in formulation with larger execution time requirements than HM. Therefore, many MM have been developed using ideas of nature behavior [9], which could be based on genetic algorithms [2], particle swarm optimization [3,10,11], tabu search [12,13], simulated annealing [13][14][15], variable scaling hybrid differential algorithm [16], ant colony [17,18], plant growth simulation [19,20], bacterial foraging [21], gray wolf [22], salp swarm [23], symbiotic organism search, hybrid cuckoo search [24], harmony search [25], and binary gravitational search [26], among others. On the other hand, mathematical optimization algorithms solve the reconfiguration problem by using conventional optimization techniques, for example, OPF by Bender Decomposition [8], mixedinteger convex programming [27,28], convex models [29], mixed-integer linear programming [30], and mixed-integer second-order cone programming [31].…”
Section: • Metaheuristic Algorithmsmentioning
confidence: 99%
“…The article referenced as [10] presents a comparison between two well-known metaheuristic algorithms employed for solving combinatorial optimization problems, specifically focusing on network reconfiguration problems. The methods under investigation in this study are simulated annealing and tabu search.…”
Section: Introductionmentioning
confidence: 99%
“…generations and microgrid resilience enhancement and control, which are predicated on renewable power sources [1][2][3][4][5][6][7][8][9][10][11][12][13][14][15]. In a radial distribution network, some switches are normally open (NO) and some others are normally closed (NC).…”
mentioning
confidence: 99%
“…One of the deficiencies found in previous research and studies was that they were focusing on only one or two objectives in reconfiguration, such as reducing the power losses [1] or increasing load balance [2,3]. In [4], as a part of a new compilation, a method based on the simulated annealing and tabu search algorithms was presented.…”
mentioning
confidence: 99%