Psychology Wiki

Assessment | Biopsychology | Comparative | Cognitive | Developmental | Language | Individual differences | Personality | Philosophy | Social |
Methods | Statistics | Clinical | Educational | Industrial | Professional items | World psychology |

Animals · Animal ethology · Comparative psychology · Animal models · Outline · Index

In computer science, particle swarm optimization (PSO) is a computational method that optimizes a problem by iteratively trying to improve a candidate solution with regard to a given measure of quality. PSO optimizes a problem by having a population of candidate solutions, here dubbed particles, and moving these particles around in the search-space according to simple mathematical formulae over the particle's position and velocity. Each particle's movement is influenced by its local best known position and is also guided toward the best known positions in the search-space, which are updated as better positions are found by other particles. This is expected to move the swarm toward the best solutions.

PSO is originally attributed to Kennedy, Eberhart and Shi[1][2] and was first intended for simulating social behaviour,[3] as a stylized representation of the movement of organisms in a bird flock or fish school. The algorithm was simplified and it was observed to be performing optimization. The book by Kennedy and Eberhart[4] describes many philosophical aspects of PSO and swarm intelligence. An extensive survey of PSO applications is made by Poli.[5][6]

PSO is a metaheuristic as it makes few or no assumptions about the problem being optimized and can search very large spaces of candidate solutions. However, metaheuristics such as PSO do not guarantee an optimal solution is ever found. More specifically, PSO does not use the gradient of the problem being optimized, which means PSO does not require that the optimization problem be differentiable as is required by classic optimization methods such as gradient descent and quasi-newton methods. PSO can therefore also be used on optimization problems that are partially irregular, noisy, change over time, etc.


A basic variant of the PSO algorithm works by having a population (called a swarm) of candidate solutions (called particles). These particles are moved around in the search-space according to a few simple formulae. The movements of the particles are guided by their own best known position in the search-space as well as the entire swarm's best known position. When improved positions are being discovered these will then come to guide the movements of the swarm. The process is repeated and by doing so it is hoped, but not guaranteed, that a satisfactory solution will eventually be discovered.

Formally, let fn → be the cost function which must be minimized. The function takes a candidate solution as argument in the form of a vector of real numbers and produces a real number as output which indicates the objective function value of the given candidate solution. The gradient of f is not known. The goal is to find a solution a for which f(a) ≤ f(b) for all b in the search-space, which would mean a is the global minimum. Maximization can be performed by considering the function h = -f instead.

Let S be the number of particles in the swarm, each having a position xi ∈ n in the search-space and a velocity vi ∈ n. Let pi be the best known position of particle i and let g be the best known position of the entire swarm. A basic PSO algorithm is then:

  • For each particle i = 1, ..., S do:
    • Initialize the particle's position with a uniformly distributed random vector: xi ~ U(blobup), where blo and bup are the lower and upper boundaries of the search-space.
    • Initialize the particle's best known position to its initial position: pi ← xi
    • If (f(pi) < f(g)) update the swarm's best known position: g ← pi
    • Initialize the particle's velocity: vi ~ U(-|bup-blo|, |bup-blo|)
  • Until a termination criterion is met (e.g. number of iterations performed, or a solution with adequate objective function value is found), repeat:
    • For each particle i = 1, ..., S do:
      • Pick random numbers: rp, rg ~ U(0,1)
      • For each dimension d = 1, ..., n do:
        • Update the particle's velocity: vi,d ← ω vi,d + φp rp (pi,d-xi,d) + φg rg (gd-xi,d)
      • Update the particle's position: xi ← xi + vi
      • If (f(xi) < f(pi)) do:
        • Update the particle's best known position: pi ← xi
        • If (f(pi) < f(g)) update the swarm's best known position: g ← pi
  • Now g holds the best found solution.

The parameters ω, φp, and φg are selected by the practitioner and control the behaviour and efficacy of the PSO method, see below.

Parameter selection

File:PSO Meta-Fitness Landscape (12 benchmark problems).JPG

Performance landscape showing how a simple PSO variant performs in aggregate on several benchmark problems when varying two PSO parameters.

The choice of PSO parameters can have a large impact on optimization performance. Selecting PSO parameters that yield good performance has therefore been the subject of much research.[7][8][9][10][11][12][13][14][15]

Basically, it can be imagined that the function which is to be minimized forms a hyper-surface of dimensionality same as that of the parameters to be optimized (search variables). It is then obvious that the 'ruggedness' of this hyper-surface depends on the particular problem. Now, how good the search is depends on how extensive it is, which is decided by the parameters. Whereas a 'lesser rugged' solution hyper-surface would need fewer particles and lesser iterations, a 'more rugged' one would require a more thorough search- using more individuals and iterations. This is analogous to another realistic situation of flocks searching for a good 'food' traversing a very difficult terrain containing gardens all over, some better than others where a huge flock would be required in order to reach the best (read global optimum) 'food' source, compared to another terrain where there are very few gardens on an otherwise non-vegetated land, where it becomes easy to search for 'food' and lesser number of individuals and iterations will suffice.

The PSO parameters can also be tuned by using another overlaying optimizer, a concept known as meta-optimization.[16][17][18] Parameters have also been tuned for various optimization scenarios.[15][19][20]

Neighbourhoods and Topologies

The basic PSO is easily trapped into a local minimum. This premature convergence can be avoided by not using the entire swarm's best known position g but just the best known position l of a sub-swarm "around" the particle that is moved. Such a sub-swarm can be a geometrical one - for example "the m nearest particles" - or, more often, a social one, i.e. a set of particles that is not depending on any distance. In such a case, the PSO variant is said to be local best (vs global best for the basic PSO).

If we suppose there is an information link between each particle and its neighbours, the set of these links builds a graph, a communication network, that is called the topology of the PSO variant. A commonly used social topology is the ring, in which each particle has just two neighbours, but there are many others.[21] The topology is not necessarily fixed, and can be adaptive (SPSO,[22] stochastic star,[23] TRIBES,[24] Cyber Swarm,[25] C-PSO[26]).

Inner workings

There are several schools of thought as to why and how the PSO algorithm can perform optimization.

A common belief amongst researchers is that the swarm behaviour varies between exploratory behaviour, that is, searching a broader region of the search-space, and exploitative behaviour, that is, a locally oriented search so as to get closer to a (possibly local) optimum. This school of thought has been prevalent since the inception of PSO.[2][3][7][11] This school of thought contends that the PSO algorithm and its parameters must be chosen so as to properly balance between exploration and exploitation to avoid premature convergence to a local optimum yet still ensure a good rate of convergence to the optimum. This belief is the precursor of many PSO variants, see below.

Another school of thought is that the behaviour of a PSO swarm is not well understood in terms of how it affects actual optimization performance, especially for higher dimensional search-spaces and optimization problems that may be discontinuous, noisy, and time-varying. This school of thought merely tries to find PSO algorithms and parameters that cause good performance regardless of how the swarm behaviour can be interpreted in relation to e.g. exploration and exploitation. Such studies have led to the simplification of the PSO algorithm, see below.


In relation to PSO the word convergence typically means one of two things, although it is often not clarified which definition is meant and sometimes they are mistakenly thought to be identical.

  • Convergence may refer to the swarm's best known position g approaching (converging to) the optimum of the problem, regardless of how the swarm behaves.
  • Convergence may refer to a swarm collapse in which all particles have converged to a point in the search-space, which may or may not be the optimum.

Several attempts at mathematically analyzing PSO convergence exist in the literature.[10][11][12] These analyses have resulted in guidelines for selecting PSO parameters that are believed to cause convergence, divergence or oscillation of the swarm's particles, and the analyses have also given rise to several PSO variants. However, the analyses were criticized by Pedersen[18] for being oversimplified as they assume the swarm has only one particle, that it does not use stochastic variables and that the points of attraction, that is, the particle's best known position p and the swarm's best known position g, remain constant throughout the optimization process. Furthermore, some analyses allow for an infinite number of optimization iterations which is not possible in reality. This means that determining convergence capabilities of different PSO algorithms and parameters therefore still depends on empirical results.


As the basic PSO works dimension by dimension, the solution point is easier found when it lies on an axis of the search space, on a diagonal, and even easier if it is right on the centre.[27][28]

A first approach to avoid this bias, and for fair comparisons, is precisely to use non-biased benchmark problems, that are shifted or rotated.[29]

Another approach is to modify the algorithm itself so that it is not any more sensitive to the system of coordinates.[30][31]


Numerous variants of even a basic PSO algorithm are possible. For example, there are different ways to initialize the particles and velocities (e.g. start with zero velocities instead), how to dampen the velocity, only update pi and g after the entire swarm has been updated, etc. Some of these choices and their possible performance impact have been discussed in the literature.[9]

New and more sophisticated PSO variants are also continually being introduced in an attempt to improve optimization performance. There are certain trends in that research; one is to make a hybrid optimization method using PSO combined with other optimizers,[32][33] e.g., the incorporation of an effective learning method.[34] Another research trend is to try and alleviate premature convergence (that is, optimization stagnation), e.g. by reversing or perturbing the movement of the PSO particles,[14][35][36] another approach to deal with premature convergence is the use of multiple swarms (multi-swarm optimization). The multi-swarm approach can also used to implement multi-objective optimization.[37] Finally, there are developments in adapting the behavioural parameters of PSO during optimization.[20]


Another school of thought is that PSO should be simplified as much as possible without impairing its performance; a general concept often referred to as Occam's razor. Simplifying PSO was originally suggested by Kennedy[3] and has been studied more extensively,[13][17][18][38] where it appeared that optimization performance was improved, and the parameters were easier to tune and they performed more consistently across different optimization problems.

Another argument in favour of simplifying PSO is that metaheuristics can only have their efficacy demonstrated empirically by doing computational experiments on a finite number of optimization problems. This means a metaheuristic such as PSO cannot be proven correct and this increases the risk of making errors in its description and implementation. A good example of this[39] presented a promising variant of a genetic algorithm (another popular metaheuristic) but it was later found to be defective as it was strongly biased in its optimization search towards similar values for different dimensions in the search space, which happened to be the optimum of the benchmark problems considered. This bias was because of a programming error, and has now been fixed.[40]

Initialization of velocities may require extra inputs. A simpler variant is the accelerated particle swarm optimization (APSO),[41] which does not need to use velocity at all and can speed up the convergence in many applications. A simple demo code of APSO is available[42]

Multi-objective optimization

PSO has also been applied to multi-objective problems,[43][44] in which the objective function comparison takes pareto dominance into account when moving the PSO particles and non-dominated solutions are stored so as to approximate the pareto front.

Binary, Discrete, and Combinatorial PSO

As the PSO equations given above work on real numbers, a commonly used method to solve discrete problems is to map the discrete search space to a continuous domain, to apply a classical PSO, and then to demap the result. Such a mapping can be very simple (for example by just using rounded values) or more sophisticated.[45]

However, it can be noted that the equations of movement make use of operators that perform four actions:

  • computing the difference of two positions. The result is a velocity (more precisely a displacement)
  • multiplying a velocity by a numerical coefficient
  • adding two velocities
  • applying a velocity to a position

Usually a position and a velocity are represented by n real numbers, and these operators are simply -, *, +, and again +. But all these mathematical objects can be defined in a completely different way, in order to cope with binary problems (or more generally discrete ones), or even combinatorial ones [46] [47] [48] .[49] One approach is to redefine the operators based on sets.[50]

See also

  • Swarm intelligence
  • Multi-swarm optimization
  • Bees algorithm / Artificial Bee Colony Algorithm
  • Particle filter


  1. (1995) "Particle Swarm Optimization". Proceedings of IEEE International Conference on Neural Networks IV: 1942–1948. DOI:10.1109/ICNN.1995.488968. 
  2. 2.0 2.1 (1998) "A modified particle swarm optimizer". Proceedings of IEEE International Conference on Evolutionary Computation: 69–73. 
  3. 3.0 3.1 3.2 (1997) "The particle swarm: social adaptation of knowledge". Proceedings of IEEE International Conference on Evolutionary Computation: 303–308. 
  4. (2001) Swarm Intelligence, Morgan Kaufmann.
  5. Poli, R. (2007). An analysis of publications on particle swarm optimisation applications. Technical Report CSM-469.
  6. Poli, R. (2008). Analysis of the publications on the applications of particle swarm optimisation. Journal of Artificial Evolution and Applications 2008: 1–10.
  7. 7.0 7.1 (1998) "Parameter selection in particle swarm optimization". Proceedings of Evolutionary Programming VII (EP98): 591–600. 
  8. (2000) "Comparing inertia weights and constriction factors in particle swarm optimization". Proceedings of the Congress on Evolutionary Computation 1: 84–88. 
  9. 9.0 9.1 (2001) "An Off-The-Shelf PSO". Proceedings of the Particle Swarm Optimization Workshop: 1–6. 
  10. 10.0 10.1 van den Bergh, F. (2001). An Analysis of Particle Swarm Optimizers (PhD thesis), University of Pretoria, Faculty of Natural and Agricultural Science.
  11. 11.0 11.1 11.2 (2002). The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation 6 (1): 58–73.
  12. 12.0 12.1 Trelea, I.C. (2003). The Particle Swarm Optimization Algorithm: convergence analysis and parameter selection. Information Processing Letters 85 (6): 317–325.
  13. 13.0 13.1 (2008). A Simplified Recombinant PSO. Journal of Artificial Evolution and Applications.
  14. 14.0 14.1 Evers, G. (2009). An Automatic Regrouping Mechanism to Deal with Stagnation in Particle Swarm Optimization (Master's thesis), The University of Texas - Pan American, Department of Electrical Engineering.
  15. 15.0 15.1 (2009). Evolutionary optimization as applied to inverse scattering problems. Inverse Problems 25: 1–41.
  16. (2006). Optimized Particle Swarm Optimization (OPSO) and its application to artificial neural network training. BMC Bioinformatics 7: 125.
  17. 17.0 17.1 Pedersen, M.E.H. (2010). Tuning & Simplifying Heuristical Optimization (PhD thesis), University of Southampton, School of Engineering Sciences, Computational Engineering and Design Group.
  18. 18.0 18.1 18.2 Pedersen, M.E.H., Chipperfield, A.J. (2010). Simplifying particle swarm optimization. Applied Soft Computing 10 (2): 618–628.
  19. Pedersen, M.E.H. (2010). Good parameters for particle swarm optimization. Technical Report HL1001.
  20. 20.0 20.1 (2009). Adaptive Particle Swarm Optimization. IEEE Transactions on Systems, Man, and Cybernetics 39 (6): 1362–1381.
  21. Mendes, R. (2004). Population Topologies and Their Influence in Particle Swarm Performance (PhD thesis). Universidade do Minho.
  22. SPSO, Particle Swarm Central
  23. Miranda, V., Keko, H. and Duque, Á. J. (2008). Stochastic Star Communication Topology in Evolutionary Particle Swarms (EPSO). International Journal of Computational Intelligence Research (IJCIR), Volume 4, Number 2, pp. 105-116
  24. Clerc, M. (2006). Particle Swarm Optimization. ISTE (International Scientific and Technical Encyclopedia), 2006
  25. Yin, P., Glover, F., Laguna, M., & Zhu, J. (2011). A Complementary Cyber Swarm Algorithm. International Journal of Swarm Intelligence Research (IJSIR), 2(2), 22-41
  26. (2007) "Clubs-based Particle Swarm Optimization". IEEE Swarm Intelligence Symposium 2007 (SIS2007): 289–296. 
  27. Monson, C. K. & Seppi, K. D. (2005). Exposing Origin-Seeking Bias in PSO GECCO'05, pp. 241-248
  28. Spears, W. M., Green, D. T. & Spears, D. F. (2010). Biases in Particle Swarm Optimization. International Journal of Swarm Intelligence Research, Vol. 1(2), pp. 34-57
  29. Suganthan, P. N., Hansen, N., Liang, J. J., Deb, K.; Chen, Y. P., Auger, A. & Tiwari, S. (2005). Problem definitions and evaluation criteria for the CEC 2005 Special Session on Real Parameter Optimization. Nanyang Technological University
  30. Wilke, D. N., Kok, S. & Groenwold, A. A. (2007). Comparison of linear and classical velocity update rules in particle swarm optimization: notes on scale and frame invariance. International Journal for Numerical Methods in Engineering, John Wiley & Sons, Ltd., 70, pp. 985-1008
  31. SPSO 2011, Particle Swarm Central
  32. (2002) "The LifeCycle Model: combining particle swarm optimisation, genetic algorithms and hillclimbers". Proceedings of Parallel Problem Solving from Nature VII (PPSN): 621–630. 
  33. (2010). An efficient hybrid approach based on PSO, ACO and k-means for cluster analysis. Applied Soft Computing 10 (1): 183–197.
  34. (2011). Orthogonal Learning Particle Swarm Optimization. IEEE Transactions on Evolutionary Computation 15 (6): 832–847.
  35. (2002) "Extending Particle Swarm Optimisers with Self-Organized Criticality". Proceedings of the Fourth Congress on Evolutionary Computation (CEC) 2: 1588–1593. 
  36. Xinchao, Z. (2010). A perturbed particle swarm algorithm for numerical optimization. Applied Soft Computing 10 (1): 119–124.
  37. (2012) "A GPU-Based Multi-Swarm PSO Method for Parameter Estimation in Stochastic Biological Systems Exploiting Discrete-Time Target Series". Evolutionary Computation, Machine Learning and Data Mining in Bioinformatics. Lecture Notes in Computer Science. 7264: 74–85. 
  38. (2008) Nature-Inspired Metaheuristic Algorithms, Luniver Press.
  39. (2004). A robust stochastic genetic algorithm (StGA) for global numerical optimization. IEEE Transactions on Evolutionary Computation 8 (5): 456–470.
  40. (2008). Corrections to "A Robust Stochastic Genetic Algorithm (StGA) for Global Numerical Optimization. IEEE Transactions on Evolutionary Computation 12 (6): 781–781.
  41. X. S. Yang, S. Deb and S. Fong, Accelerated particle swarm optimization and support vector machine for business optimization and applications, NDT 2011, Springer CCIS 136, pp. 53-66 (2011).
  43. (2002) "Particle swarm optimization method in multiobjective problems". Proceedings of the ACM Symposium on Applied Computing (SAC): 603–607. 
  44. (2002) "MOPSO: A Proposal for Multiple Objective Particle Swarm Optimization". Congress on Evolutionary Computation (CEC'2002): 1051–1056. 
  45. Roy, R., Dehuri, S., & Cho, S. B. (2012). A Novel Particle Swarm Optimization Algorithm for Multi-Objective Combinatorial Optimization Problem. 'International Journal of Applied Metaheuristic Computing (IJAMC)', 2(4), 41-57
  46. Kennedy, J. & Eberhart, R. C. (1997). A discrete binary version of the particle swarm algorithm, Conference on Systems, Man, and Cybernetics, Piscataway, NJ: IEEE Service Center, pp. 4104-4109
  47. Clerc, M. (2004). Discrete Particle Swarm Optimization, illustrated by the Traveling Salesman Problem, New Optimization Techniques in Engineering, Springer, pp. 219-239
  48. Clerc, M. (2005). Binary Particle Swarm Optimisers: toolbox, derivations, and mathematical insights, Open Archive HAL
  49. Jarboui, B., Damak, N., Siarry, P., and Rebai, A.R. (2008). A combinatorial particle swarm optimization for solving multi-mode resource-constrained project scheduling problems. In Proceedings of Applied Mathematics and Computation, pp. 299-308.
  50. (2010). A novel set-based particle swarm optimization method for discrete optimization problem. IEEE Transactions on Evolutionary Computation 14 (2): 278–300.

External links

Template:Major subfields of optimization