A novel particle swarm optimizer hybridized with extremal optimization

  • Chen M
  • Li X
  • Zhang X
 et al. 
  • 35


    Mendeley users who have this article in their library.
  • 90


    Citations of this article.


Particle swarm optimization (PSO) has received increasing interest from the optimization community due to its simplicity in implementation and its inexpensive computational overhead. However, PSO has premature convergence, especially in complex multimodal functions. Extremal optimization (EO) is a recently developed local-search heuristic method and has been successfully applied to a wide variety of hard optimization problems. To overcome the limitation of PSO, this paper proposes a novel hybrid algorithm, called hybrid PSO-EO algorithm, through introducing EO to PSO. The hybrid approach elegantly combines the exploration ability of PSO with the exploitation ability of EO. We testify the performance of the proposed approach on a suite of unimodal/multimodal benchmark functions and provide comparisons with other meta-heuristics. The proposed approach is shown to have superior performance and great capability of preventing premature convergence across it comparing favorably with the other algorithms. © 2009 Elsevier B.V. All rights reserved.

Author-supplied keywords

  • Extremal optimization
  • Meta-heuristics
  • Multimodal functions
  • Numerical optimization
  • Particle swarm optimization

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document


Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free