2010
DOI: 10.4028/www.scientific.net/amm.40-41.201
|View full text |Cite
|
Sign up to set email alerts
|

A Particle Swarm Optimization Based on Dynamic Parameter Modification

Abstract: A new particle swarm optimization based on dynamic parameter modification is proposed in this paper (Dynamic Parameter Modification Particle Swarm Optimizer, DPSO). In DPSO algorithm , is doing oscillating decay breaking through the constraint of topical linear decreasing, and the Euclidean distance and is calculated, which respectively stand for the Euclidean distances form the position of particle to the best position that the particle has passed and the best position that all the particles have passed under… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
6
0

Year Published

2013
2013
2019
2019

Publication Types

Select...
3
1

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(6 citation statements)
references
References 2 publications
0
6
0
Order By: Relevance
“…Based on the data set in Table 6, perform a multi-peak function fitting for the three-dimensional model and adopt the simulation function of PSO by Zhang, Xiong, and Chen (2010).…”
Section: Empirical Analysis Of the Modelmentioning
confidence: 99%
“…Based on the data set in Table 6, perform a multi-peak function fitting for the three-dimensional model and adopt the simulation function of PSO by Zhang, Xiong, and Chen (2010).…”
Section: Empirical Analysis Of the Modelmentioning
confidence: 99%
“…The PSO 2131 has a significant impact on performance of the algorithm with respect to two acceleration coefficients c1 and c2 and inertia weight γ(t). The PSO with larger inertia weight has a faster convergence speed and works well in global search, while the PSO with smaller inertia weight can reach a more accurate optimum value but only works well in local search.…”
Section: Modified Psomentioning
confidence: 99%
“…Decreasing inertia weight particle swarm optimization is a topical algorithm, of which inertia weight decreases linearly from 0.9 to 0.4 [20][21][22]. Some scholars propose the increasing inertia weight particle swarm optimization of which inertia weight increases linearly from 0.4 to 0.9 [25]. The further development of these algorithms is fuzzy adaptive PSO, which optimizes the value of dynamically using adaptive fuzzy inertia weight controller and can solve many problems satisfactorily.…”
Section: Improved Particle Swarm Optimizationmentioning
confidence: 99%
“…max is 6000, initial is 0.9, and final is 0.4 [25], the changes of are shown in Figure 2. The improved in (3) modifies the momentum factor dynamically in real time, while the iteration goes on and chooses the step length corresponding with the current condition according to the detection function and then achieves the self-adaptive changes according to the numerical feedback.…”
Section: Parametric Analysis For Idpsomentioning
confidence: 99%