Levy Flights for Particle Swarm Optimisation Algorithms on Graphical Processing Units

A. V. Husselmann, K. A. Hawick
Computer Science, Massey University, Albany, NS 102-904, Auckland, New Zealand
Computational Science Technical Note CSTN-167


   author={A. V. Husselmann and K. A. Hawick},

   title={Levy Flights for Particle Swarm Optimisation Algorithms on Graphical Processing Units},

   journal={Parallel and Cloud Computing},





   note={Submitted to J. Parallel and Cloud Computing},

   institution={Computer Science, Massey University},

   keywords={particle swarms; optimisation; multi-modal functions; Levy flights; data parallelism; GPUs},





Download Download (PDF)   View View   Source Source   



Particle Swarm Optimisation (PSO) is a powerful algorithm for space search problems such as parametric optimisation. Particles with Levy flights have a long-tailed probability of outlier jumps in the problem space that provide a good compromise between local space exploration and local minima avoidance. Generating many particles and their trajectories with Levy random deviates is computationally expensive, however. We present a data-parallel algorithmic implementation of Levy flighted particle swarm optimisation and show how it makes use of accelerators such as graphical processing units (GPUs). We discuss the computational tradeoffs, performance achievable using GPUs, and the scalability of such an approach using various uni-modal and multi-modal test functions in a range of dimensions.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2021 hgpu.org

All rights belong to the respective authors

Contact us: