Individual and social behaviour in particle swarm optimizers

Johann Sienz, Mauro Innocente

Research output: Chapter in Book/Report/Conference proceedingChapter

Abstract

Individually, there are three basic factors that govern a particle's trajectory: 1) the inertia from its previous displacement; 2) the attraction to its own best experience; and 3) the attraction to a given neighbour's best experience. The importance awarded to each factor is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. The other important question regarding the particles' behaviour is how to define the social attractor in the velocity equation, which governs the social behaviour. This leads to the design of different neighbourhood topologies within the swarm, where the lower the number of interconnections the slower the convergence. An extensive study of neighbourhood topologies can be found in [1]. There is always the need for a trade-off between the explorative and the exploitative behaviour. The former is more reluctant to get trapped in sub-optimal solutions whereas the latter is better for a fine-grain search. This trade-off may be controlled by both the coefficients' settings and the neighbourhood topology.
The aim of this chapter is two-fold: first to offer some guidelines on the impact of different coefficients' settings on the speed and form of convergence; and second to illustrate their combined effect on the neighbourhood topology. Thus, the convergence region of the plane 'inertia weight (w)–acceleration coefficient (phi)' is presented, and the effect on the trajectory of a deterministic and isolated particle is analyzed for different subregions. Related studies can be found in [2], and [3]. The effect of setting the individuality (iw) and sociality weights (sw) to different values for a given acceleration weight (aw) is also explored. Experiments are performed for a small swarm and a one-dimensional problem to analyze the trajectories and observe whether the conclusions derived from the study of the deterministic particle hold for the full algorithm. Finally, experiments on two 30-dimensional problems are performed for different combinations between two sets of coefficients' settings and three neighbourhood topologies. The results and convergence curves illustrate the effect that the coefficients, the neighbourhood topologies, and their different combinations have on the performance of the optimizer. Thus the user can decide upon the coefficients and the neighbourhoods according to the type of search desired.
Original languageEnglish
Title of host publicationDevelopments and Applications in Engineering Computational Technology
EditorsB.H.V. Topping, J.M. Adam, F.J. Pallarés, R. Bru, M.L. Romero
Place of PublicationStirlingshire
PublisherSaxe-Coburg Publications
Pages219-243
Number of pages25
ISBN (Print)978-1-874672-48-7
DOIs
Publication statusPublished - 2010
Externally publishedYes

Publication series

NameComputational Science, Engineering & Technology Series
ISSN (Electronic)1759-3158

Fingerprint

Topology
Trajectories
Experiments

Keywords

  • particle swarm
  • coefficients
  • neighbourhood topology
  • convergence

Cite this

Sienz, J., & Innocente, M. (2010). Individual and social behaviour in particle swarm optimizers. In B. H. V. Topping, J. M. Adam, F. J. Pallarés, R. Bru, & M. L. Romero (Eds.), Developments and Applications in Engineering Computational Technology (pp. 219-243). (Computational Science, Engineering & Technology Series). Stirlingshire: Saxe-Coburg Publications. https://doi.org/10.4203/csets.26.10

Individual and social behaviour in particle swarm optimizers. / Sienz, Johann; Innocente, Mauro.

Developments and Applications in Engineering Computational Technology. ed. / B.H.V. Topping; J.M. Adam; F.J. Pallarés; R. Bru; M.L. Romero. Stirlingshire : Saxe-Coburg Publications, 2010. p. 219-243 (Computational Science, Engineering & Technology Series).

Research output: Chapter in Book/Report/Conference proceedingChapter

Sienz, J & Innocente, M 2010, Individual and social behaviour in particle swarm optimizers. in BHV Topping, JM Adam, FJ Pallarés, R Bru & ML Romero (eds), Developments and Applications in Engineering Computational Technology. Computational Science, Engineering & Technology Series, Saxe-Coburg Publications, Stirlingshire, pp. 219-243. https://doi.org/10.4203/csets.26.10
Sienz J, Innocente M. Individual and social behaviour in particle swarm optimizers. In Topping BHV, Adam JM, Pallarés FJ, Bru R, Romero ML, editors, Developments and Applications in Engineering Computational Technology. Stirlingshire: Saxe-Coburg Publications. 2010. p. 219-243. (Computational Science, Engineering & Technology Series). https://doi.org/10.4203/csets.26.10
Sienz, Johann ; Innocente, Mauro. / Individual and social behaviour in particle swarm optimizers. Developments and Applications in Engineering Computational Technology. editor / B.H.V. Topping ; J.M. Adam ; F.J. Pallarés ; R. Bru ; M.L. Romero. Stirlingshire : Saxe-Coburg Publications, 2010. pp. 219-243 (Computational Science, Engineering & Technology Series).
@inbook{df2ddbd7186a47199e0f981d1309bd01,
title = "Individual and social behaviour in particle swarm optimizers",
abstract = "Individually, there are three basic factors that govern a particle's trajectory: 1) the inertia from its previous displacement; 2) the attraction to its own best experience; and 3) the attraction to a given neighbour's best experience. The importance awarded to each factor is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. The other important question regarding the particles' behaviour is how to define the social attractor in the velocity equation, which governs the social behaviour. This leads to the design of different neighbourhood topologies within the swarm, where the lower the number of interconnections the slower the convergence. An extensive study of neighbourhood topologies can be found in [1]. There is always the need for a trade-off between the explorative and the exploitative behaviour. The former is more reluctant to get trapped in sub-optimal solutions whereas the latter is better for a fine-grain search. This trade-off may be controlled by both the coefficients' settings and the neighbourhood topology.The aim of this chapter is two-fold: first to offer some guidelines on the impact of different coefficients' settings on the speed and form of convergence; and second to illustrate their combined effect on the neighbourhood topology. Thus, the convergence region of the plane 'inertia weight (w)–acceleration coefficient (phi)' is presented, and the effect on the trajectory of a deterministic and isolated particle is analyzed for different subregions. Related studies can be found in [2], and [3]. The effect of setting the individuality (iw) and sociality weights (sw) to different values for a given acceleration weight (aw) is also explored. Experiments are performed for a small swarm and a one-dimensional problem to analyze the trajectories and observe whether the conclusions derived from the study of the deterministic particle hold for the full algorithm. Finally, experiments on two 30-dimensional problems are performed for different combinations between two sets of coefficients' settings and three neighbourhood topologies. The results and convergence curves illustrate the effect that the coefficients, the neighbourhood topologies, and their different combinations have on the performance of the optimizer. Thus the user can decide upon the coefficients and the neighbourhoods according to the type of search desired.",
keywords = "particle swarm, coefficients, neighbourhood topology, convergence",
author = "Johann Sienz and Mauro Innocente",
year = "2010",
doi = "10.4203/csets.26.10",
language = "English",
isbn = "978-1-874672-48-7",
series = "Computational Science, Engineering & Technology Series",
publisher = "Saxe-Coburg Publications",
pages = "219--243",
editor = "B.H.V. Topping and J.M. Adam and F.J. Pallar{\'e}s and R. Bru and M.L. Romero",
booktitle = "Developments and Applications in Engineering Computational Technology",

}

TY - CHAP

T1 - Individual and social behaviour in particle swarm optimizers

AU - Sienz, Johann

AU - Innocente, Mauro

PY - 2010

Y1 - 2010

N2 - Individually, there are three basic factors that govern a particle's trajectory: 1) the inertia from its previous displacement; 2) the attraction to its own best experience; and 3) the attraction to a given neighbour's best experience. The importance awarded to each factor is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. The other important question regarding the particles' behaviour is how to define the social attractor in the velocity equation, which governs the social behaviour. This leads to the design of different neighbourhood topologies within the swarm, where the lower the number of interconnections the slower the convergence. An extensive study of neighbourhood topologies can be found in [1]. There is always the need for a trade-off between the explorative and the exploitative behaviour. The former is more reluctant to get trapped in sub-optimal solutions whereas the latter is better for a fine-grain search. This trade-off may be controlled by both the coefficients' settings and the neighbourhood topology.The aim of this chapter is two-fold: first to offer some guidelines on the impact of different coefficients' settings on the speed and form of convergence; and second to illustrate their combined effect on the neighbourhood topology. Thus, the convergence region of the plane 'inertia weight (w)–acceleration coefficient (phi)' is presented, and the effect on the trajectory of a deterministic and isolated particle is analyzed for different subregions. Related studies can be found in [2], and [3]. The effect of setting the individuality (iw) and sociality weights (sw) to different values for a given acceleration weight (aw) is also explored. Experiments are performed for a small swarm and a one-dimensional problem to analyze the trajectories and observe whether the conclusions derived from the study of the deterministic particle hold for the full algorithm. Finally, experiments on two 30-dimensional problems are performed for different combinations between two sets of coefficients' settings and three neighbourhood topologies. The results and convergence curves illustrate the effect that the coefficients, the neighbourhood topologies, and their different combinations have on the performance of the optimizer. Thus the user can decide upon the coefficients and the neighbourhoods according to the type of search desired.

AB - Individually, there are three basic factors that govern a particle's trajectory: 1) the inertia from its previous displacement; 2) the attraction to its own best experience; and 3) the attraction to a given neighbour's best experience. The importance awarded to each factor is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. The other important question regarding the particles' behaviour is how to define the social attractor in the velocity equation, which governs the social behaviour. This leads to the design of different neighbourhood topologies within the swarm, where the lower the number of interconnections the slower the convergence. An extensive study of neighbourhood topologies can be found in [1]. There is always the need for a trade-off between the explorative and the exploitative behaviour. The former is more reluctant to get trapped in sub-optimal solutions whereas the latter is better for a fine-grain search. This trade-off may be controlled by both the coefficients' settings and the neighbourhood topology.The aim of this chapter is two-fold: first to offer some guidelines on the impact of different coefficients' settings on the speed and form of convergence; and second to illustrate their combined effect on the neighbourhood topology. Thus, the convergence region of the plane 'inertia weight (w)–acceleration coefficient (phi)' is presented, and the effect on the trajectory of a deterministic and isolated particle is analyzed for different subregions. Related studies can be found in [2], and [3]. The effect of setting the individuality (iw) and sociality weights (sw) to different values for a given acceleration weight (aw) is also explored. Experiments are performed for a small swarm and a one-dimensional problem to analyze the trajectories and observe whether the conclusions derived from the study of the deterministic particle hold for the full algorithm. Finally, experiments on two 30-dimensional problems are performed for different combinations between two sets of coefficients' settings and three neighbourhood topologies. The results and convergence curves illustrate the effect that the coefficients, the neighbourhood topologies, and their different combinations have on the performance of the optimizer. Thus the user can decide upon the coefficients and the neighbourhoods according to the type of search desired.

KW - particle swarm

KW - coefficients

KW - neighbourhood topology

KW - convergence

U2 - 10.4203/csets.26.10

DO - 10.4203/csets.26.10

M3 - Chapter

SN - 978-1-874672-48-7

T3 - Computational Science, Engineering & Technology Series

SP - 219

EP - 243

BT - Developments and Applications in Engineering Computational Technology

A2 - Topping, B.H.V.

A2 - Adam, J.M.

A2 - Pallarés, F.J.

A2 - Bru, R.

A2 - Romero, M.L.

PB - Saxe-Coburg Publications

CY - Stirlingshire

ER -