Skip to main navigation Skip to search Skip to main content

Enhancing particle swarm optimization using generalized opposition-based learning

  • Hui Wang*
  • , Zhijian Wu
  • , Shahryar Rahnamayan
  • , Yong Liu
  • , Mario Ventresca
  • *Corresponding author for this work
  • UOIT
  • University of Aizu
  • University of Cambridge

Research output: Contribution to journal › Article › peer-review

556 Scopus citations

Abstract

Particle swarm optimization (PSO) has been shown to yield good performance for solving various optimization problems. However, it tends to suffer from premature convergence when solving complex problems. This paper presents an enhanced PSO algorithm called GOPSO, which employs generalized opposition-based learning (GOBL) and Cauchy mutation to overcome this problem. GOBL can provide a faster convergence, and the Cauchy mutation with a long tail helps trapped particles escape from local optima. The proposed approach uses a similar scheme as opposition-based differential evolution (ODE) with opposition-based population initialization and generation jumping using GOBL Experiments are conducted on a comprehensive set of benchmark functions, including rotated multimodal problems and shifted large-scale problems. The results show that COPS obtains promising performance on a majority of the test problems. (C) 2011 Elsevier Inc. All rights reserved.
Original languageEnglish
Pages (from-to)4699-4714
Number of pages16
JournalInformation Sciences
Volume181
Issue number20
DOIs
StatePublished - 15 Oct 2011

Funding

The authors thank the editor and anonymous reviewers for their detailed and constructive comments that help us to increase the quality of this work. This work was supported by the National Natural Science Foundation of China (No. 61070008).

Indexed by

  • EI
  • Scopus
  • SCIE

Fingerprint

Dive into the research topics of 'Enhancing particle swarm optimization using generalized opposition-based learning'. Together they form a unique fingerprint.

Cite this