## Abstract

Particle Swam Optimization (PSO) is a population-based and gradient-free optimization method developed by mimicking social behaviour observed in nature. Its ability to optimize is not specifically implemented but emerges in the global level from local interactions. In its canonical version, there are three factors that govern a given 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 given to each of these factors is regulated by three coefficients: 1) the inertia; 2) the individuality; and 3) the sociality weights. The settings and relative settings of these coefficients rule the trajectory of the particle when pulled by these two attractors. While divergent trajectories are of course to be avoided, different speeds and forms of convergence of a given particle towards its attractor(s) take place for different settings of the coefficients. A more general formulation is presented, aiming for a better control of the embedded randomness. Guidelines as to how to select the settings of the coefficients to obtain the desired behaviour are offered. As to the convergence speed of the whole algorithm, it also depends on the speed of spread of information within the swarm. The latter is governed by the structure of the neighbourhood, whose study is beyond the scope of the research presented here. The objective of this paper is to help understand the core of the PSO paradigm from the bottom up by offering some insight into the form of the particles’ trajectories, and to provide some guidelines as to how to decide upon the settings of the coefficients in the particles’

velocity update equation in the proposed formulation to obtain the type of behaviour desired for the given particular problem. General-purpose settings are also suggested, which provide some trade-off between the reluctance to getting trapped in sub-optimal solutions and the ability to carry out a fine-grain search. The relationship between the proposed formulation and both the classical and constricted PSO formulations are also provided.

velocity update equation in the proposed formulation to obtain the type of behaviour desired for the given particular problem. General-purpose settings are also suggested, which provide some trade-off between the reluctance to getting trapped in sub-optimal solutions and the ability to carry out a fine-grain search. The relationship between the proposed formulation and both the classical and constricted PSO formulations are also provided.

Original language | English |
---|---|

Title of host publication | Mecánica Computacional |

Subtitle of host publication | Computational Intelligence Techniques for Optimization and Data Modeling (B) |

Editors | Eduardo Dvorkin, Marcela Goldschmit, Mario Storti |

Publisher | Asociación Argentina de Mecánica Computacional |

Pages | 9253-9269 |

Number of pages | 17 |

Volume | XXIX |

Publication status | Published - Nov 2010 |

Externally published | Yes |

Event | IX Argentinean Congress on Computational Mechanics, II South American Congress on Computational Mechanics, and XXXI Iberian-Latin-American Congress on Computational Methods in Engineering - Buenos Aires, Argentina Duration: 15 Nov 2010 → 18 Nov 2010 http://www.amcaonline.org.ar/twiki/bin/view/AMCA/CongressMECOM2010 |

### Conference

Conference | IX Argentinean Congress on Computational Mechanics, II South American Congress on Computational Mechanics, and XXXI Iberian-Latin-American Congress on Computational Methods in Engineering |
---|---|

Abbreviated title | MECOM-CILAMCE 2010 |

Country | Argentina |

City | Buenos Aires |

Period | 15/11/10 → 18/11/10 |

Internet address |