.png){kind=icon}
.png){kind=icon}
Return
Cooperative particle swarm optimization using MapReduce
.png){kind=icon}
PRE
AI
DOI：10.1007/s00500-016-2390-9.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Cooperative particle swarm optimization (short in CPSO) is an effective evolutionary algorithm for optimization and has attracted a lot of research attention. As real-world optimization problems become complex and large scale, population-based optimization algorithms may take a long time to complete a task. Responding to this trend, CPSO, as a serial evolutionary algorithm, also needs to be updated and accelerated. On the other hand, MapReduce is a programming model for parallel computation and accelerates many tasks successfully. In this paper, we present MapReduce cooperative particle swarm optimization (short in MRCPSO) which implements CPSO-S, a version of CPSO, using MapReduce model. MRCPSO is compared with the original CPSO-S and two algorithms in CEC 2013 special session and competition on real-parameter single-objective optimization. The result on benchmarks shows that MRCPSO outperforms the original CPSO-S significantly on both time and the quality of solution. And in the comparisons with the other two algorithms, MRCPSO has better performance on several problems, while the advantage on time is significant.
Keywords:
Large-scale
Parallel and distributed computing u
MapReduce
PSO
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.