2009 Fifth International Conference on Natural Computation 2009
DOI: 10.1109/icnc.2009.175
|View full text |Cite
|
Sign up to set email alerts
|

Study on Improved Particle Swarm Optimization Algorithm and Its Application

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0
1

Year Published

2012
2012
2024
2024

Publication Types

Select...
2
2

Relationship

1
3

Authors

Journals

citations
Cited by 4 publications
(5 citation statements)
references
References 4 publications
0
4
0
1
Order By: Relevance
“…For the algorithm of sub-population cooperation in particle swarm optimization, Chen et al 41 proposed a scheme in which adjacent sub-populations sequentially transferred the optimal solutions to cooperate and update the speed according to the weighted average of the optimal solutions of adjacent populations, which improved the global search ability of the algorithm to some extent. However, its cooperation mode is only limited to adjacent subpopulations, and the information on each subpopulation is not fully utilized.…”
Section: Robot Joint Error Identification Methods Based On Improved Psomentioning
confidence: 99%
“…For the algorithm of sub-population cooperation in particle swarm optimization, Chen et al 41 proposed a scheme in which adjacent sub-populations sequentially transferred the optimal solutions to cooperate and update the speed according to the weighted average of the optimal solutions of adjacent populations, which improved the global search ability of the algorithm to some extent. However, its cooperation mode is only limited to adjacent subpopulations, and the information on each subpopulation is not fully utilized.…”
Section: Robot Joint Error Identification Methods Based On Improved Psomentioning
confidence: 99%
“…(1) it requires many preset parameters, making it challenging to find the optimal parameters; (2) the change in particle positions lacks randomness, making it easy to fall into the trap of local optimization [76]. A good solution is to adopt the Quantum Particle Swarm Optimization (QPSO) algorithm, which increases particle position's randomness by eliminating particle movement's direction attribute to remove the correlation between location updates and previous motion of particles [77]. QPSO can also make integer particle positions suitable for addressing the integer optimization issue.…”
Section: Moqpsomentioning
confidence: 99%
“…It is important that the ethylene yield is estimated on-line in order to control the product quality and product yield. Thus, a soft sensor should be developed to solve this problem [8].…”
Section: A Application Background Descriptionmentioning
confidence: 99%
“…Twenty independent experiments are carried out for each method and the averaged results are list out in Table II. Root mean squared error (RMSE) and maximal absolute error (MAXE), which are defined as formula (7) and formula (8), are used to evaluate the generalization performance of the three algorithms. Where i y and i y ∧ represent the real value and estimated output value, l is the sample number of testing set.…”
Section: B Soft Sensor Modeling and Analysismentioning
confidence: 99%