Comprehensive learning particle swarm optimization (CLPSO) is a powerful metaheuristic for global optimization. This paper studies parallelizing CLPSO by open computing language (OpenCL) on the integrated Intel HD Graphics 520 (IHDG520) graphical processing unit (GPU) with a low clock rate. We implement a coarse-grained all-GPU model that maps each particle to a separate work item. Two enhancement strategies, namely, generating and transferring random numbers from the central processor to the GPU as well as reducing the number of instructions in the kernel, are proposed to shorten the model’s execution time. This paper further investigates parallelizing deterministic optimization for implicit stochastic optimization of China’s Xiaowan Reser...
Swarm intelligence algorithms have been widely used to solve difficult real world problems in both a...
Abstract — In this paper, I describe the methods I used for creating a Particle Swarm Optimizer (PSO...
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions ...
Comprehensive learning particle swarm optimization (CLPSO) is a powerful metaheuristic for global op...
This thesis deals with a population based stochastic optimization technique PSO (Particle Swarm Opti...
Particle Swarm Optimization (PSO) is a stochastic technique for solving the optimization problem. At...
Particle Swarm Optimization is robust and effective method to solve optimization problems. Particle ...
Population based metaheuristic can benefit from explicit parallelization in order to address complex...
Particle swarm optimization (PSO), like other population-based meta-heuristics, is intrinsically par...
Particle swarm optimization (PSO), like other population-based meta-heuristics, is intrinsically par...
In recent years, swarm-based stochastic optimizers have achieved remarkable results in tackling real...
Since few years ago, the parallel processing has been embedded in personal computers by including co...
In recent years, particles’ optimization algorithm has highly been used as an effective method in so...
Intelligent optimization algorithms are very effective to tackle complex problems that would be diff...
This work deals with the PSO technique (Particle Swarm Optimization), which is capable to solve comp...
Swarm intelligence algorithms have been widely used to solve difficult real world problems in both a...
Abstract — In this paper, I describe the methods I used for creating a Particle Swarm Optimizer (PSO...
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions ...
Comprehensive learning particle swarm optimization (CLPSO) is a powerful metaheuristic for global op...
This thesis deals with a population based stochastic optimization technique PSO (Particle Swarm Opti...
Particle Swarm Optimization (PSO) is a stochastic technique for solving the optimization problem. At...
Particle Swarm Optimization is robust and effective method to solve optimization problems. Particle ...
Population based metaheuristic can benefit from explicit parallelization in order to address complex...
Particle swarm optimization (PSO), like other population-based meta-heuristics, is intrinsically par...
Particle swarm optimization (PSO), like other population-based meta-heuristics, is intrinsically par...
In recent years, swarm-based stochastic optimizers have achieved remarkable results in tackling real...
Since few years ago, the parallel processing has been embedded in personal computers by including co...
In recent years, particles’ optimization algorithm has highly been used as an effective method in so...
Intelligent optimization algorithms are very effective to tackle complex problems that would be diff...
This work deals with the PSO technique (Particle Swarm Optimization), which is capable to solve comp...
Swarm intelligence algorithms have been widely used to solve difficult real world problems in both a...
Abstract — In this paper, I describe the methods I used for creating a Particle Swarm Optimizer (PSO...
Thesis deals with discrete optimization problems. It focusses on faster ways to find good solutions ...