Abstract
In this paper we present and discuss the results of experimentally comparing the performance of several variants of the standard swarm particle optimiser and a new approach to swarm based optimisation. The new algorithm, which we call predator prey optimiser, combines the ideas of particle swarm optimisation with a predator prey inspired strategy, which is used to maintain diversity in the swarm and preventing premature convergence to local suboptima. This algorithm and the most common variants of the particle swarm optimisers are tested in a set of multimodal functions commonly used as benchmark optimisation problems in evolutionary computation.
This is a preview of subscription content, log in via an institution to check access.
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
Kennedy, J. and Eberhart, R. C., “Particle swarm optimisation”, Proc. IEEE International Conference on Neural Networks. Piscataway, NJ, pp. 1942–1948, 1995.
Kennedy, J., Eberhart, R. C., and Shi, Y., “Swarm intelligence”, Morgan Kaufmann Publishers, San Francisco. 2001
Angeline, P. J., “Evolutionary optimisation versus particle swarm optimisation: philosophy and performance differences”, The Seventh Annual Conf. on Evolutionary Programming. 1998.
Shi, Y. and Eberhart, R. C., “Parameter selection in particle swarm optimisation” Evolutionary Programming VII: Proc. EP 98. New York, pp. 591–600, 1998.
Shi, Y. and Eberhart, R. C., “Empirical study of particle swarm optimisation”, Proceedings of the 1999 Congress on Evolutionary Computation. Piscataway, NJ, pp. 1945–1950, 1999.
Clerc, M. and Kennedy, J.. “The particle swarm-explosion, stability, and convergence in a multidimensional complex space”. IEEE Transactions on Evolutionary Computation, Vol. 6, No. 1, pp. 58–73. 2002.
Kennedy, J., “Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance”, Proc. Congress on Evolutionary Computation 1999. Piscataway, NJ, pp. 1931–1938, 1999.
Muhlenbein, H., & Schlierkamp-Voosen, D.. “Predictive models for the breeder genetic algorithm: I. Continuous parameter optimisation.” Evolutionary Computation, 1 (1), 25–49.
Eberhart, R. C. and Shi, Y. “Comparing inertia weigthts and constriction factors in particle swarm optimization”. Proc. CEC 2000 pp. 84–88. San Diego, CA, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Silva, A., Neves, A., Costa, E. (2002). An Empirical Comparison of Particle Swarm and Predator Prey Optimisation. In: O’Neill, M., Sutcliffe, R.F.E., Ryan, C., Eaton, M., Griffith, N.J.L. (eds) Artificial Intelligence and Cognitive Science. AICS 2002. Lecture Notes in Computer Science(), vol 2464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45750-X_13
Download citation
DOI: https://doi.org/10.1007/3-540-45750-X_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44184-7
Online ISBN: 978-3-540-45750-3
eBook Packages: Springer Book Archive