2017
DOI: 10.22266/ijies2017.1231.14
|View full text |Cite
|
Sign up to set email alerts
|

Adaptive Weighted Improved Discrete Particle Swarm Optimization for Minimizing Load Balancing Index in Radial Distribution Network

Abstract: Abstract:In this paper a metaheuristic based newfangled adaptive weighted improved discrete particle swarm optimization (AWIDPSO) algorithm is applied to minimize the load balancing index in radial distribution network reconfiguration (RDNR) problem. It is devised as extremely nonlinear and multimodal optimization problem under practical constraints. In order to improve the solution quality the constraint violations are augmented with objective function. Further, adaptively varying inertia weight increases the… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1

Citation Types

0
3
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
2

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(3 citation statements)
references
References 17 publications
0
3
0
Order By: Relevance
“…The classical PSO algorithm proposed in 1995 and sophisticated on by Kennedy and Eberhart is a stochastic optimization method that depends on the movement intelligence of particle [21][22][23]25]. It applies to the thought of the social conducts of swarms.…”
Section: Proposed Algorithm 31 Classical Psomentioning
confidence: 99%
“…The classical PSO algorithm proposed in 1995 and sophisticated on by Kennedy and Eberhart is a stochastic optimization method that depends on the movement intelligence of particle [21][22][23]25]. It applies to the thought of the social conducts of swarms.…”
Section: Proposed Algorithm 31 Classical Psomentioning
confidence: 99%
“…Likewise, a mapping strategy is incorporated with the imperialist competitive algorithm and it becomes an improved adaptive imperialist competitive algorithm (IAICA) which adapts ICA into discrete nonlinear optimization problem [21], the step size of the E-coli of modified bacterial foraging optimization (MBFOA) has varied in each iteration [22], in case of theta-modified bat algorithm (T-BA) the Cartesian form is transformed into polar form results the velocity and position of each bat is updated using the phase angle vectors thus increases the convergence speed [23], as the genetic operator has augmented in an enhanced genetic algorithm (EGA), generating superior solutions for electrical distribution reconfiguration problem [24] and the inertia weight is adaptively varied in adaptive weighted improved discrete particle swarm optimization (AWIDPSO) for minimizing power loss [25] and load balancing index [26].…”
Section: Introductionmentioning
confidence: 99%
“…Similarly, modified algorithms such as AACO [19], APSO [20], IAICA [21], MBFOA [22] T-BA [23] and AWIDPSO [25][26], hybrid algorithms MIHDE [27] and HPSO [28] have applied to ascertain optimal distribution reconfiguration under steady state condition.…”
Section: Introductionmentioning
confidence: 99%