zbMATH — the first resource for mathematics

Examples
Geometry Search for the term Geometry in any field. Queries are case-independent.
Funct* Wildcard queries are specified by * (e.g. functions, functorial, etc.). Otherwise the search is exact.
"Topological group" Phrases (multi-words) should be set in "straight quotation marks".
au: Bourbaki & ti: Algebra Search for author and title. The and-operator & is default and can be omitted.
Chebyshev | Tschebyscheff The or-operator | allows to search for Chebyshev or Tschebyscheff.
"Quasi* map*" py: 1989 The resulting documents have publication year 1989.
so: Eur* J* Mat* Soc* cc: 14 Search for publications in a particular source with a Mathematics Subject Classification code (cc) in 14.
"Partial diff* eq*" ! elliptic The not-operator ! eliminates all results containing the word elliptic.
dt: b & au: Hilbert The document type is set to books; alternatively: j for journal articles, a for book articles.
py: 2000-2015 cc: (94A | 11T) Number ranges are accepted. Terms can be grouped within (parentheses).
la: chinese Find documents in a given language. ISO 639-1 language codes can also be used.

Operators
a & b logic and
a | b logic or
!ab logic not
abc* right wildcard
"ab c" phrase
(ab c) parentheses
Fields
any anywhere an internal document identifier
au author, editor ai internal author identifier
ti title la language
so source ab review, abstract
py publication year rv reviewer
cc MSC code ut uncontrolled term
dt document type (j: journal article; b: book; a: book article)
A study of particle swarm optimization particle trajectories. (English) Zbl 1093.68105
Summary: Particle Swarm Optimization (PSO) has shown to be an efficient, robust and simple optimization algorithm. Most of the PSO studies are empirical, with only a few theoretical analyses that concentrate on understanding particle trajectories. These theoretical studies concentrate mainly on simplified PSO systems. This paper overviews current theoretical studies, and extend these studies to investigate particle trajectories for general swarms to include the influence of the inertia term. The paper also provides a formal proof that each particle converges to a stable point. An empirical analysis of multi-dimensional stochastic particles is also presented. Experimental results are provided to support the conclusions drawn from the theoretical findings.

MSC:
68T20AI problem solving (heuristics, search strategies, etc.)
WorldCat.org
Full Text: DOI
References:
[1] T. Beielstein, K.E. Parsopoulos, M.N. Vrahatis, Tuning pso parameters through sensitivity analysis, in: Technical Report, Reihe Computational Intelligence CI 124/02, Department of Computer Science, University of Dortmund, 2002. · Zbl 1060.65603
[2] Burden, R. L.; Faires, J. D.: Numerical analysis (Chapter 5.11). 314-321 (1993) · Zbl 0788.65001
[3] A. Carlisle, G. Dozier, An off-the-self pso, in: Proceedings of the Workshop on Particle Swarm Optimization, Indianapolis, USA, 2001.
[4] M. Clerc, The swarm and the queen: Towards a deterministic and adaptive particl e swarm optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, 1999, pp. 1951-1957.
[5] M. Clerc, Think locally, act locally: The way of life of cheap-pso, an adaptive pso, Available from <http://clerc.maurice.free.fr/pso/>, 2001.
[6] Clerc, M.; Kennedy, J.: The particle swarm-explosion, stability, and convergence in a multidimensional complex space. IEEE transactions on evolutionary computation 6, No. 1, 58-73 (2002)
[7] R.C. Eberhart, J. Kennedy, A new optimizer using particle swarm theory, in: Proceedings of the Sixth International Symposium on Micromachine and Human Science, Nagoya, Japan, 1995, pp. 39-43.
[8] Eberhart, R. C.; Shi, Y.: Particle swarm optimization: developments, applications and resources. Proceedings of the IEEE congress on evolutionary computation (2001)
[9] Eberhart, R. C.; Simpson, P. K.; Dobbins, R. W.: Computational intelligence PC tools. (1996)
[10] R.C. Eberhart, Y. Shi, Comparing inertia weights and constriction factors in particle swarm optimization, in: Proceedings of the IEEE Congress on Evolutionary Computation, San Diego, USA, 2000, pp. 84-88.
[11] Holland, J.: Adaption in natural and artificial systems. (1975) · Zbl 0317.68006
[12] J. Kennedy, The particle swarm: Social adaptation of knowledge, in: Proceedings of the IEEE International Conference on Evolutionary Computation, Indianapolis, USA, 1997, pp. 303-308.
[13] J. Kennedy, Small worlds and mega-minds: Effects of neighborhood topology on particle swarm performance, in: Proceedings of the IEEE Congress on Evolutionary Computation, 1999, pp. 1931-1938.
[14] Kennedy, J.; Eberhart, R. C.: Particle swarm optimization. Proceedings of the IEEE international joint conference on neural networks, 1942-1948 (1995)
[15] Kennedy, J.; Mendes, R.: Population structure and particle performance. (2002)
[16] R. Mendes, P. Cortez, M. Rocha, J. Neves, Particle swarms for feedforward neural network training, in: Proceedings of the International Joint Conference on Neural Networks, 2002, pp. 1895-1899.
[17] S. Naka, T. Genji, T. Yura, Y. Fukuyama, Practical distribution state estimation using hybrid particle swarm optimization, in: IEEE Power Engineering Society Winter Meeting, Columbus, USA, 2001, pp. 815-820.
[18] Naka, S.; Genji, T.; Yura, T.; Fukuyama, Y.: A hybrid particle swarm optimization for distribution state estimation. IEEE transactions on power systems 18, No. 1, 60-68 (2003)
[19] E. Ozcan, C.K. Mohan, Analysis of a simple particle swarm optimization system, in: Intelligent Engineering Systems through Artificial Neural Networks, 1998, pp. 253-258.
[20] E. Ozcan, C.K. Mohan, Particle swarm optimization: Surfing the waves, in: Proceedings of the IEEE Congress on Evolutionary Computation, Washington, DC, USA, 1999.
[21] Y. Shi, R.C. Eberhart, A modified particle swarm optimizer, in: Proceedings of the IEEE Congress on Evolutionary Computation, Piscataway, USA, 1998, pp. 69-73.
[22] Y. Shi, R.C. Eberhart, Parameter selection in particle swarm optimization, in: Proceedings of the Seventh Annual Conference on Evolutionary Programming, New York, USA, 1998, pp. 591-600.
[23] Shi, Y.; Eberhart, R. C.: Empirical study of particle swarm optimization. Proceedings of the IEEE congress on evolutionary computation, 1945-1950 (1999)
[24] Shi, Y.; Eberhart, R. C.: Fuzzy adaptive particle swarm optimization. (2001)
[25] Suganthan, P. N.: Particle swarm optimiser with neighborhood operator. Proceedings of the IEEE congress on evolutionary computation, 1958-1962 (1999)
[26] Trelea, I. C.: The particle swarm optimization algorithm: convergence analysis and parameter selection. Information processing letters 85, No. 6, 317-325 (2003) · Zbl 1156.90463
[27] F. van den Bergh, An Analysis of Particle Swarm Optimizers, PhD thesis, Department of Computer Science, University of Pretoria, Pretoria, South Africa, 2002.
[28] G. Venter, J. Sobieszczanski-Sobieski, Multidisciplinary optimization of a transport aircraft wing using particle swarm optimization, in: Ninth AIAA/ISSMO Symposium on Multidisciplinary Analysis and Optimization, Atlanta, USA, 2002.
[29] K. Yasuda, A. Ide, N. Iwasaki, Adaptive particle swarm optimization, in: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 2003, pp. 1554-1559.
[30] H. Yoshida, Y. Fukuyama, S. Takayama, Y. Nakanishi, A particle swarm optimization for reactive power and voltage control in electric power systems considering voltage security assessment, in: Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, 1999, p. 502.
[31] Y. Zheng, L. Ma, L. Zhang, J. Qian, On the convergence analysis and parameter selection in particle swarm optimization, in: Proceedings of the International Conference on Machine Learning and Cybernetics, 2003, pp. 1802-1807.