Welcome to the InfoSci Platform
Reference Hub3
Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems

Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems

Farid Bourennani
Copyright: © 2019 |Volume: 10 |Issue: 3 |Pages: 20
ISSN: 1947-8283|EISSN: 1947-8291|EISBN13: 9781522566083|DOI: 10.4018/IJAMC.2019070102
Cite Article Cite Article

MLA

Bourennani, Farid. "Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems." IJAMC vol.10, no.3 2019: pp.19-38. http://doi.org/10.4018/IJAMC.2019070102

APA

Bourennani, F. (2019). Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems. International Journal of Applied Metaheuristic Computing (IJAMC), 10(3), 19-38. http://doi.org/10.4018/IJAMC.2019070102

Chicago

Bourennani, Farid. "Cooperative Asynchronous Parallel Particle Swarm Optimization for Large Dimensional Problems," International Journal of Applied Metaheuristic Computing (IJAMC) 10, no.3: 19-38. http://doi.org/10.4018/IJAMC.2019070102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Metaheuristics have been very successful to solve NP-hard optimization problems. However, some problems such as big optimization problems are too expensive to be solved using classical computing. Naturally, the increasing availability of high performance computing (HPC) is an appropriate alternative to solve such complex problems. In addition, the use of HPC can lead to more accurate metaheuristics if their internal mechanisms are enhanced. Particle swarm optimization (PSO) is one of the most know metaheuristics and yet does not have many parallel versions of PSO which take advantage of HPC via algorithmic modifications. Therefore, in this article, the authors propose a cooperative asynchronous parallel PSO algorithm (CAPPSO) with a new velocity calculation that utilizes a cooperative model of sub-swarms. The asynchronous communication among the sub-swarms makes CAPPSO faster than a parallel and more accurate than the master-slave PSO (MS-PSO) when the tested big problems.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.