Random Asynchronous PSO
In this paper, the authors propose the Random Asynchronous PSO (RAPSO) algorithm, a rather simple but intuitive variant of the Asynchronous PSO (APSO) that introduces a randomized order in which particles share their information. Their algorithm, while conceived as serial in terms of execution, is able to model the behavior of the Parallel Asynchronous PSO (PAPSO) but in a controlled environment where results from independent runs are reproducible and the implementation does not need additional computational requirements (e.g. computational grids or GPUs). They support their proposal by comparing it favorably with respect to the original APSO in ten well-known benchmark functions.