Your browser does not support JavaScript!
http://iet.metastore.ingenta.com
1887

Predator-prey optimization with heterogeneous swarms

Predator-prey optimization with heterogeneous swarms

For access to this article, please select a purchase option:

Buy chapter PDF
£10.00
(plus tax if applicable)
Buy Knowledge Pack
10 chapters for £75.00
(plus taxes if applicable)

IET members benefit from discounts to all IET publications and free access to E&T Magazine. If you are an IET member, log in to your account and the discounts will automatically be applied.

Learn more about IET membership 

Recommend Title Publication to library

You must fill out fields marked with: *

Librarian details
Name:*
Email:*
Your details
Name:*
Email:*
Department:*
Why are you recommending this title?
Select reason:
 
 
 
 
 
Swarm Intelligence -Volume 2: Innovation, new algorithms and methods — Recommend this title to your library

Thank you

Your recommendation has been sent to your librarian.

Predator-prey optimization algorithms use the interaction between predator and prey particles to control the balance between local and global search in particle swarm optimization. Since their introduction in 2002, predator-prey optimizers have been successfully applied to many practical problems, frequently outperforming other particle swarm algorithms. In this chapter, we will start by presenting the original predator-prey optimizing algorithm and to review some of its applications. We will then describe the most recent version of the algorithm, the scouting predator- prey optimizer, where scout particles are proposed as a mechanism to introduce new exploratory behaviors in the new heterogeneous swarm. Scout particles can be used to improve the predator-prey algorithm in different ways, from integrating previous knowledge to increase performance in specific problems to introducing new heuristics that globally improve the algorithm. We illustrate the effect of using different scout particles by empirically comparing the performance of several variants of the scouting predator-prey optimizer on a large set of benchmark problems, carefully chosen to present the algorithms with different challenges. Finally, the scouting predator-prey algorithm will be compared with several particle swarm optimizers and differential evolution algorithms to investigate how competitive the algorithm is with state-ofthe-art particle swarm and evolutionary optimizers.

Chapter Contents:

  • Abstract
  • 5.1 Introduction
  • 5.2 The algorithms
  • 5.2.1 The standard particle swarm optimizer
  • 5.2.2 The scouting predator–prey optimizer
  • 5.2.2.1 The predator–prey mechanism
  • 5.2.2.2 Scout particles
  • 5.3 Experimental setup
  • 5.3.1 Benchmark algorithms
  • 5.4 Experimental results
  • 5.4.1 Global results
  • 5.4.2 Intermediate results
  • 5.4.3 Results for the knowledge- based scout particle
  • 5.5 Conclusions
  • References

Inspec keywords: evolutionary computation; particle swarm optimisation; predator-prey systems

Other keywords: particle swarm algorithms; original predator-prey optimizing algorithm; particle swarm optimization; scouting predator-prey optimizer; predator-prey optimization algorithms; evolutionary optimizers; predator-prey optimizers; scouting predator-prey algorithm; heterogeneous swarm; particle swarm optimizers; differential evolution algorithms

Subjects: Systems theory applications in biology and medicine; Optimisation techniques; Systems theory applications in natural resources and ecology

Preview this chapter:
Zoom in
Zoomout

Predator-prey optimization with heterogeneous swarms, Page 1 of 2

| /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch5-1.gif /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch5-2.gif

Related content

content/books/10.1049/pbce119g_ch5
pub_keyword,iet_inspecKeyword,pub_concept
6
6
Loading
This is a required field
Please enter a valid email address