Predator-prey optimization with heterogeneous swarms
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.
Predator-prey optimization with heterogeneous swarms, Page 1 of 2
< Previous page Next page > /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch5-1.gif /docserver/preview/fulltext/books/ce/pbce119g/PBCE119G_ch5-2.gif