In last couple of years, parallel two or many objective MOPSO (Multi-objective Particle Swarm Optimization) have been proposed in literature. Denumerable implementations were published, however they had not achieved faster execution time and good Pareto fronts. They have alluded some limitation of archive handling, picked up nondominated solutions, high dimensional problems and so on for large swarm population. Moreover, none of the researchers have implemented MOPSO and tested the performance for large swarm population and high dimensional problem simultaneously. In particular, they skipped high dimensional problems. This paper presents a faster implementation of parallel MOPSO on a GPU based on the CUDA architecture, which uses coalescing memory access, pseudorandom number generator (PRNG), Thrust library, atomic function, parallel archiving and so on. In addition, our implementation has a positive impact on the performance to solve high dimensional optimization problems with large swarm population. Therefore, our proposed algorithm can be widely used in real optimizing problems. The proposed parallel implementation of MOPSO using a master-slave model provides up to 182 times speedup compared to the corresponding CPU MOPSO.
|
