Lévy-Flights for Particle Swarm Optimisation Algorithms on Graphical Processing Units
نویسندگان
چکیده
Particle Swarm Optimisation (PSO) is a powerful algorithm for space search problems such as parametric optimisation. Particles with Lévy-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 Lévy-random deviates is computationally expensive, however. We present a data-parallel algorithmic implementation of Lévy-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. KeywordsParticle Swarms; Optimisation; Multi-Modal Functions; Lévy-Flights; Data-Parallelism; GPUs
منابع مشابه
Parallel Implementation of Particle Swarm Optimization Variants Using Graphics Processing Unit Platform
There are different variants of Particle Swarm Optimization (PSO) algorithm such as Adaptive Particle Swarm Optimization (APSO) and Particle Swarm Optimization with an Aging Leader and Challengers (ALC-PSO). These algorithms improve the performance of PSO in terms of finding the best solution and accelerating the convergence speed. However, these algorithms are computationally intensive. The go...
متن کاملAn Energy Efficient Control Strategy for Induction Machines Based on Advanced Particle Swarm Optimisation Algorithms
This paper proposes an energy efficient control strategy for an induction machine (IM) based on two advanced particle swarm optimisation (PSO) algorithms. Two advanced PSO algorithms, known as the dynamic particle swarm optimisation (Dynamic PSO) and the chaos particle swarm optimisation (Chaos PSO) algorithms modify the algorithm parameters to improve the performance of the standard PSO algori...
متن کاملAn approach to Improve Particle Swarm Optimization Algorithm Using CUDA
The time consumption in solving computationally heavy problems has always been a concern for computer programmers. Due to simplicity of its implementation, the PSO (Particle Swarm Optimization) is a suitable meta-heuristic algorithm for solving computationally heavy problems. However, despite the simplicity, the algorithm is inefficient for solving real computationally heavy problems but the pr...
متن کاملAn electoral quantum-behaved PSO with Lévy flights for permutation flow shop scheduling problem
Permutation flow shop scheduling problem (PFSSP), a NP-hard combinatorial optimization problem, has strong engineering background of finding the optimal processing sequence and time of jobs on machines under the constraints of resources. Recently, several approaches based on Particle Swarm Optimization (PSO) have been developed to solve the PFSSP, and the experimental results show that they are...
متن کاملACO-PSO Optimization for Solving TSP Problem with GPU Acceleration
In this paper, we present a novel approach named "ACO-PSO-TSPGPU" to run PSO and ACO on Graphical Processing Units (GPUs) and applied to TSP (Parallel-PSO&ACO-A-TSP). Both algorithms are implemented on GPUs. Well-known benchmark problems for many heuristic and meta heuristic algorithms presented by Travelling Salesman Problem (TSP) are known as NP hard complex problems.TSP was investigated usin...
متن کامل