Particle Swarm Optimization with Inertia Weight and Constriction Factor

Mauro Innocente, Johann Sienz

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Abstract

In the original Particle Swarm Optimization (PSO) formulation, convergence of a particle towards its attractors is not guaranteed. A velocity constraint is successful in controlling the explosion, but not in improving the fine-grain search. Clerc and Kennedy studied this system, and proposed constriction methodologies to ensure convergence and to fine tune the search. Thus, they developed different constriction methods according to the correlations among some coefficients incorporated to the system. Type 1” constriction became very popular because the basic update equations remained virtually unmodified, and the original and intuitive metaphor valid. The main drawbacks of this constriction type are that constriction becomes too strong very quickly as the acceleration is increased; that the speed of convergence cannot be easily controlled; and that there is no flexibility to set a desired form of convergence. Another problem is that the method can be found in the literature formulated so as to constrict a PSO system which already includes the inertia weight, for which the calculation of a constriction factor using the formulae provided by Clerc and Kennedy does not guarantee convergence. This paper analyzes Type 1” constriction in detail, for which Type 1 constriction is also relevant. The formulae for Type 1 and Type 1” constriction factors suitable for a PSO algorithm including the inertia weight are provided.
Original languageEnglish
Title of host publicationProceedings of the 2011 International Conference on Swarm Intelligence
Publication statusPublished - 2011
Externally publishedYes
EventInternational conference on swarm intelligence - Cergy, France
Duration: 14 Jun 201115 Jun 2011
Conference number: 2
https://www.ieee.org/conferences_events/conferences/conferencedetails/index.html?Conf_ID=19020

Conference

ConferenceInternational conference on swarm intelligence
CountryFrance
CityCergy
Period14/06/1115/06/11
Internet address

Fingerprint

Particle swarm optimization (PSO)
Explosions

Keywords

  • Constriction factor
  • guaranteed convergence
  • inertia weight
  • particle swarm

Cite this

Innocente, M., & Sienz, J. (2011). Particle Swarm Optimization with Inertia Weight and Constriction Factor. In Proceedings of the 2011 International Conference on Swarm Intelligence

Particle Swarm Optimization with Inertia Weight and Constriction Factor. / Innocente, Mauro; Sienz, Johann.

Proceedings of the 2011 International Conference on Swarm Intelligence. 2011.

Research output: Chapter in Book/Report/Conference proceedingConference proceeding

Innocente, M & Sienz, J 2011, Particle Swarm Optimization with Inertia Weight and Constriction Factor. in Proceedings of the 2011 International Conference on Swarm Intelligence. International conference on swarm intelligence, Cergy, France, 14/06/11.
Innocente M, Sienz J. Particle Swarm Optimization with Inertia Weight and Constriction Factor. In Proceedings of the 2011 International Conference on Swarm Intelligence. 2011
Innocente, Mauro ; Sienz, Johann. / Particle Swarm Optimization with Inertia Weight and Constriction Factor. Proceedings of the 2011 International Conference on Swarm Intelligence. 2011.
@inproceedings{3ae5d265ce97499a9f131b4fe37eb70a,
title = "Particle Swarm Optimization with Inertia Weight and Constriction Factor",
abstract = "In the original Particle Swarm Optimization (PSO) formulation, convergence of a particle towards its attractors is not guaranteed. A velocity constraint is successful in controlling the explosion, but not in improving the fine-grain search. Clerc and Kennedy studied this system, and proposed constriction methodologies to ensure convergence and to fine tune the search. Thus, they developed different constriction methods according to the correlations among some coefficients incorporated to the system. Type 1” constriction became very popular because the basic update equations remained virtually unmodified, and the original and intuitive metaphor valid. The main drawbacks of this constriction type are that constriction becomes too strong very quickly as the acceleration is increased; that the speed of convergence cannot be easily controlled; and that there is no flexibility to set a desired form of convergence. Another problem is that the method can be found in the literature formulated so as to constrict a PSO system which already includes the inertia weight, for which the calculation of a constriction factor using the formulae provided by Clerc and Kennedy does not guarantee convergence. This paper analyzes Type 1” constriction in detail, for which Type 1 constriction is also relevant. The formulae for Type 1 and Type 1” constriction factors suitable for a PSO algorithm including the inertia weight are provided.",
keywords = "Constriction factor, guaranteed convergence, inertia weight, particle swarm",
author = "Mauro Innocente and Johann Sienz",
year = "2011",
language = "English",
booktitle = "Proceedings of the 2011 International Conference on Swarm Intelligence",

}

TY - GEN

T1 - Particle Swarm Optimization with Inertia Weight and Constriction Factor

AU - Innocente, Mauro

AU - Sienz, Johann

PY - 2011

Y1 - 2011

N2 - In the original Particle Swarm Optimization (PSO) formulation, convergence of a particle towards its attractors is not guaranteed. A velocity constraint is successful in controlling the explosion, but not in improving the fine-grain search. Clerc and Kennedy studied this system, and proposed constriction methodologies to ensure convergence and to fine tune the search. Thus, they developed different constriction methods according to the correlations among some coefficients incorporated to the system. Type 1” constriction became very popular because the basic update equations remained virtually unmodified, and the original and intuitive metaphor valid. The main drawbacks of this constriction type are that constriction becomes too strong very quickly as the acceleration is increased; that the speed of convergence cannot be easily controlled; and that there is no flexibility to set a desired form of convergence. Another problem is that the method can be found in the literature formulated so as to constrict a PSO system which already includes the inertia weight, for which the calculation of a constriction factor using the formulae provided by Clerc and Kennedy does not guarantee convergence. This paper analyzes Type 1” constriction in detail, for which Type 1 constriction is also relevant. The formulae for Type 1 and Type 1” constriction factors suitable for a PSO algorithm including the inertia weight are provided.

AB - In the original Particle Swarm Optimization (PSO) formulation, convergence of a particle towards its attractors is not guaranteed. A velocity constraint is successful in controlling the explosion, but not in improving the fine-grain search. Clerc and Kennedy studied this system, and proposed constriction methodologies to ensure convergence and to fine tune the search. Thus, they developed different constriction methods according to the correlations among some coefficients incorporated to the system. Type 1” constriction became very popular because the basic update equations remained virtually unmodified, and the original and intuitive metaphor valid. The main drawbacks of this constriction type are that constriction becomes too strong very quickly as the acceleration is increased; that the speed of convergence cannot be easily controlled; and that there is no flexibility to set a desired form of convergence. Another problem is that the method can be found in the literature formulated so as to constrict a PSO system which already includes the inertia weight, for which the calculation of a constriction factor using the formulae provided by Clerc and Kennedy does not guarantee convergence. This paper analyzes Type 1” constriction in detail, for which Type 1 constriction is also relevant. The formulae for Type 1 and Type 1” constriction factors suitable for a PSO algorithm including the inertia weight are provided.

KW - Constriction factor

KW - guaranteed convergence

KW - inertia weight

KW - particle swarm

M3 - Conference proceeding

BT - Proceedings of the 2011 International Conference on Swarm Intelligence

ER -