2022
DOI: 10.1016/j.jestch.2022.101230
|View full text |Cite
|
Sign up to set email alerts
|

Distribution network reconfiguration using time-varying acceleration coefficient assisted binary particle swarm optimization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
9
0

Year Published

2023
2023
2024
2024

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 16 publications
(9 citation statements)
references
References 43 publications
0
9
0
Order By: Relevance
“…Over the years, numerous PSO modifications and upgrades have been put forth by researchers as solutions to this problem. Among them are PSO with time-varying acceleration coefficients [ 129 ], in which the rates of social and cognitive learning varied over time; human behavior-based PSO [ 130 ], which imitates human behavior by incorporating negative traits in humans by using the term “Gworst”; and PSO with aging leaders and challengers (ALCPSO) [ 131 ], where a leader is initially assigned, and as the leader ages, a new particle challenges its dominance. When coping with unimodal problems, these algorithms work well, but as the algorithm is moved toward more intricate and multimodal functions, the performance starts to deteriorate.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…Over the years, numerous PSO modifications and upgrades have been put forth by researchers as solutions to this problem. Among them are PSO with time-varying acceleration coefficients [ 129 ], in which the rates of social and cognitive learning varied over time; human behavior-based PSO [ 130 ], which imitates human behavior by incorporating negative traits in humans by using the term “Gworst”; and PSO with aging leaders and challengers (ALCPSO) [ 131 ], where a leader is initially assigned, and as the leader ages, a new particle challenges its dominance. When coping with unimodal problems, these algorithms work well, but as the algorithm is moved toward more intricate and multimodal functions, the performance starts to deteriorate.…”
Section: Metaheuristicsmentioning
confidence: 99%
“…From the perspective of the solution procedure, literature [14] employed an efficient Genetic Algorithm (GA) to accelerate the calculation and show higher accuracy in DNR. In [15], researchers proposed an improved Particle Swarm Optimization (PSO) which involved a new acceleration coefficient. Although the solutions of two algorithms above had indicated both a rapid convergence and a good robustness of these approaches, they mainly focused on a single optimization problem.…”
Section: B Development and Research Status Of Dnrmentioning
confidence: 99%
“…However, there will be some invalid solutions in optimization of DNR because of the different islands [30]. The invalid solutions that can not meet the constraint of distribution network topology will greatly reduce the search efficiency [15]. Therefore, the topologies of different systems need to be simplified via the method presented below.…”
Section: Mathematical Model Of Distribution Network Reconfiguration A...mentioning
confidence: 99%
See 1 more Smart Citation
“…Moreover, the GA methodology has given smaller standard deviation values than DE in all scenarios. Te near-optimal outcome represents the one with the lower standard deviation [45,46]. In that manner, the GA-based optimization is more successful than DE since it has the smaller standard deviation.…”
Section: Comparison Between Ga and De For 10 Runs Of Stochastic Optim...mentioning
confidence: 99%