Summary
This paper describes an adaptive strategy for tuning the parameters of the PSO method based on an analysis of the dynamics of PSO. This adaptive tuning strategy is based on the results of an analysis of the dynamics of average velocity of the particles with successful search processes. The feasibility and advantages of the proposed adaptive PSO method are demonstrated through numerical simulations using a typical global optimization test problem.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Kennedy and R. C. Eberhart (2001) “Swarm Interlligence”, Morgan Kaufmann Publishers.
M. Clerc and J. Kennedy (2002) “The Particle Swarm-Explosion, Stability, and Convergence in a Multidimensional Complex Space”, IEEE Transactions on Evolutionary Computation, Vol.6, No.1, pp.58–73.
Keiichiro Yasuda and Nobuhiro Iwasaki (Oct.2004) “Adaptive Particle Swarm Optimization using velocity information of swarm”, IEEE International Conference on Systems, Man & Cybernetics Proceedings, pp.3475–3481.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yasuda, K., Iwasaki, N. (2005). Adaptive Particle Swarm Optimization via Velocity Feedback. In: Abraham, A., Dote, Y., Furuhashi, T., Köppen, M., Ohuchi, A., Ohsawa, Y. (eds) Soft Computing as Transdisciplinary Science and Technology. Advances in Soft Computing, vol 29. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-32391-0_49
Download citation
DOI: https://doi.org/10.1007/3-540-32391-0_49
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25055-5
Online ISBN: 978-3-540-32391-4
eBook Packages: EngineeringEngineering (R0)