2020
DOI: 10.11591/ijeecs.v20.i3.pp1118-1127
|View full text |Cite
|
Sign up to set email alerts
|

A new hybrid algorithm for solving distribution network reconfiguration under different load conditions

Abstract: <p>Distribution Network Reconfiguration (DNR) is a significant problem for<br />keeping the network running under normal conditions. In this study, for<br />preventing the premature convergence issue, also to improving the searching<br />ability of the Binary Particle Swarm Optimization (BPSO) algorithm, chaotic<br />strategy is incorporating with BPSO algorithm to create a new hybrid<br />algorithm called Chaotic BPSO (CBPSO). Undeniably, the chaotic strategy<br />ena… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(5 citation statements)
references
References 22 publications
0
5
0
Order By: Relevance
“…๐ผ๐‘“ ๐‘“(๐‘ฅ ๐‘– ) < ๐‘“(๐‘ฅ โ„Ž ๐‘– ). Based on the unconventional dance component d outlined in (17), male mayflies alter their velocity depending on their actual status.…”
Section: Movements Of Mayfliesmentioning
confidence: 99%
“…๐ผ๐‘“ ๐‘“(๐‘ฅ ๐‘– ) < ๐‘“(๐‘ฅ โ„Ž ๐‘– ). Based on the unconventional dance component d outlined in (17), male mayflies alter their velocity depending on their actual status.…”
Section: Movements Of Mayfliesmentioning
confidence: 99%
“…Standard algorithms such as Newton-Raphson method of load flows can be used with transmission systems. But due to weak reactance to resistance ratio of the distribution system, convergence rate of such algorithms is very slow [14], [15]. Distribution system load flows are developed to get used in weak reactance to resistance ratio systems.…”
Section: Load Flow Analysis Of Radial Distribution Systemmentioning
confidence: 99%
“…Kennedy and Eberhart were first enhanced and developed this algorithm in 1995 [21], [22]. Each individual in the PSO algorithm has local best position (๐‘ƒ ๐‘๐‘’๐‘ ๐‘ก ), and global best position (๐บ ๐‘๐‘’๐‘ ๐‘ก ) [23]. The velocity (๐‘‰ ๐‘– ) and position (๐‘‹ ๐‘– ) from ๐‘ƒ ๐‘๐‘’๐‘ ๐‘ก to ๐บ ๐‘๐‘’๐‘ ๐‘ก of the agents will be changed by utilizing in ( 7) and ( 8) [24], [25].…”
Section: Pso Algorithmmentioning
confidence: 99%