Multi-phase Discrete Particle Swarm Optimization

Buthainah Al-Kazemi, Chilukuri K. Mohan

Research output: Chapter in Book/Entry/PoemConference contribution

16 Scopus citations

Abstract

This paper describes a successful adaptation of the Particle Swarm Optimization algorithm to discrete optimization problems. In the proposed algorithm, particles cycle through multiple phases with differing goals. We also exploit hill climbing. On benchmark problems, this algorithm outperforms a genetic algorithm and a previous discrete PSO formulation.

Original languageEnglish (US)
Title of host publicationProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
EditorsJ.H. Caulfield, S.H. Chen, H.D. Cheng, R. Duro, J.H. Caufield, S.H. Chen, H.D. Cheng, R. Duro, V. Honavar
Pages622-625
Number of pages4
StatePublished - 2002
Externally publishedYes
EventProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002 - Research Triange Park, NC, United States
Duration: Mar 8 2002Mar 13 2002

Publication series

NameProceedings of the Joint Conference on Information Sciences
Volume6

Other

OtherProceedings of the 6th Joint Conference on Information Sciences, JCIS 2002
Country/TerritoryUnited States
CityResearch Triange Park, NC
Period3/8/023/13/02

ASJC Scopus subject areas

  • General Computer Science

Fingerprint

Dive into the research topics of 'Multi-phase Discrete Particle Swarm Optimization'. Together they form a unique fingerprint.

Cite this