Abstract
The particle swarm algorithm has been shown to optimize a wide variety of complex functions. This paper examines a simplified version of the algorithm in an effort to understand the trajectories of particles as they search for solutions. Findings address optimal parameter values, point out issues for future research, and contribute to understanding this new optimization method.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Kennedy, J., and Eberhart, R. C. (1995). Particle swarm optimization. Proceedings of the 1995 IEEE International Conference on Neural Networks (Perth, Australia), 1942–1948. IEEE Service Center, Piscataway, NJ.
Kennedy, J., and Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm. Proceedings of the 1997 Conference on Systems, Man, and Cybernetics, 4104–4109. IEEE Service Center, Piscataway, NJ.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kennedy, J. (1998). The behavior of particles. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040809
Download citation
DOI: https://doi.org/10.1007/BFb0040809
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-64891-8
Online ISBN: 978-3-540-68515-9
eBook Packages: Springer Book Archive