Multi-phase generalization of the particle swarm optimization algorithm

Buthainah Al-Kazemi, Chilukuri K. Mohan

Research output: Contribution to conferencePaper

56 Scopus citations

Abstract

Multi-phase particle swarm optimization is a new algorithm to be used for discrete and continuous problems. In this algorithm, different groups of particles have trajectories that proceed with differing goals in different phases of the algorithm. On several benchmark problems, the algorithm outperforms standard particle swarm optimization, genetic algorithm, and evolution programming.

Original languageEnglish (US)
Pages489-494
Number of pages6
DOIs
StatePublished - Jan 1 2002
Event2002 Congress on Evolutionary Computation, CEC 2002 - Honolulu, HI, United States
Duration: May 12 2002May 17 2002

Other

Other2002 Congress on Evolutionary Computation, CEC 2002
CountryUnited States
CityHonolulu, HI
Period5/12/025/17/02

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Multi-phase generalization of the particle swarm optimization algorithm'. Together they form a unique fingerprint.

  • Cite this

    Al-Kazemi, B., & Mohan, C. K. (2002). Multi-phase generalization of the particle swarm optimization algorithm. 489-494. Paper presented at 2002 Congress on Evolutionary Computation, CEC 2002, Honolulu, HI, United States. https://doi.org/10.1109/CEC.2002.1006283