The critical state in particle swarm optimisation

The critical state in particle swarm optimisation

For access to this article, please select a purchase option:

Buy chapter PDF
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Your details
Why are you recommending this title?
Select reason:
Swarm Intelligence - Volume 1: Principles, current algorithms and methods — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Particle swarm optimisation (PSO) is a widely used meta-heuristic algorithm, which has been successfully applied to a large variety of problems in optimisation, prediction, classification, visualisation and robotics. However, the underlying mechanism that leads to good solutions in these domains is not well understood. A number of parameters influence the algorithm mainly by determining the balance between exploration and exploitation. In this chapter, we describe the behaviour of PSO as a product of random matrices, and use a Lyapunov exponent to precisely characterise the critical parameters for PSO. The theoretical results are discussed based on numerical experiments for standard benchmark problems.

Chapter Contents:

  • Abstract
  • 10.1 Introduction
  • 10.1.1 Particle swarm optimisation
  • PSO parameter selection and resultant behaviours
  • Alternative meta-heuristics
  • The problem of making comparisons between algorithms
  • 10.1.2 On criticality
  • 10.1.3 The dynamics of PSO
  • 10.1.4 Matrix formulation
  • 10.2 Critical swarm conditions for a single particle
  • 10.2.1 PSO as a random dynamical system
  • 10.2.2 Stability
  • 10.2.3 Personal best vs. global best
  • 10.3 Simulations
  • 10.3.1 Combining the results from multiple cost functions
  • 10.4 Discussion
  • 10.4.1 Relevance of criticality
  • 10.4.2 Comparison with earlier explanations
  • Lines of stability when viewed against average cost function results
  • Lines of stability when viewed against individual cost function results
  • Lines of stability when viewed against detailed cost function results
  • 10.4.3 Switching dynamics at discovery of better solutions
  • 10.4.4 The role of personal best, present best and best ever
  • 10.5 Conclusion
  • Acknowledgement
  • References

Inspec keywords: particle swarm optimisation

Other keywords: PSO; meta-heuristic algorithm; particle swarm optimisation; critical parameters

Subjects: Optimisation; Optimisation techniques; Optimisation techniques

Preview this chapter:
Zoom in

The critical state in particle swarm optimisation, Page 1 of 2

| /docserver/preview/fulltext/books/ce/pbce119f/PBCE119F_ch10-1.gif /docserver/preview/fulltext/books/ce/pbce119f/PBCE119F_ch10-2.gif

Related content

This is a required field
Please enter a valid email address