Skip to main navigation Skip to search Skip to main content

Opposition based PSO and mutation operators

  • Muhammad Imran*
  • , Hajira Jabeen
  • , Mubashir Ahmad
  • , Qamar Abbas
  • , Waqas Bangyal
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

15 Scopus citations

Abstract

Particle Swarm Optimization (PSO) algorithm has shown good performance in many optimization problems, but PSO suffers from the problem of early convergence into a local minima. Introduction of opposition based initialization and mutation operators have played an important role to overcome the convergence problem in function optimization. In this study we have reviewed different variants of PSO for function optimization. Researchers have proposed different modifications in PSO to prevent it from getting stuck in local optima. At the end, we have proposed a variant of PSO for better conversion.

Original languageEnglish
Title of host publicationICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
PagesV4506-V4508
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 2nd International Conference on Education Technology and Computer, ICETC 2010 - Shanghai, China
Duration: 22 Jun 201024 Jun 2010

Publication series

NameICETC 2010 - 2010 2nd International Conference on Education Technology and Computer
Volume4

Conference

Conference2010 2nd International Conference on Education Technology and Computer, ICETC 2010
Country/TerritoryChina
CityShanghai
Period22/06/1024/06/10

Keywords

  • Function optimization
  • Mutation
  • Opposition
  • PSO
  • Survey

ASJC Scopus subject areas

  • Computer Science (miscellaneous)
  • Education

Fingerprint

Dive into the research topics of 'Opposition based PSO and mutation operators'. Together they form a unique fingerprint.

Cite this