Article (Scientific journals)
A Scalable Parallel Cooperative Coevolutionary PSO Algorithm for Multi-objective Optimization
ATASHPENDAR, Arash; Dorronsoro, Bernabé; DANOY, Grégoire et al.
2017In Journal of Parallel and Distributed Computing
Peer Reviewed verified by ORBi
 

Files


Full Text
author_preprint_JPDC_CCMOEAs_PSO_Scalability.pdf
Author preprint (754.73 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to



Details



Keywords :
Metaheuristics; Particle swarm optimization; Cooperative; Coevolutionary; Parallelism
Abstract :
[en] We present a parallel multi-objective cooperative coevolutionary variant of the Speed-constrained Multi-objective Particle Swarm Optimization (SMPSO) algorithm. The algorithm, called CCSMPSO, is the first multi-objective cooperative coevolutionary algorithm based on PSO in the literature. SMPSO adopts a strategy for limiting the velocity of the particles that prevents them from having erratic movements. This characteristic provides the algorithm with a high degree of reliability. In order to demonstrate the effectiveness of CCSMPSO, we compare our work with the original SMPSO and three different state-of-the-art multi-objective CC metaheuristics, namely CCNSGA-II, CCSPEA2 and CCMOCell, along with their original sequential counterparts. Our experiments indicate that our proposed solution, CCSMPSO, offers significant computational speedups, a higher convergence speed and better or comparable results in terms of solution quality, when evaluated against three other CC algorithms and four state-of-the-art optimizers (namely SMPSO, NSGA-II, SPEA2, and MOCell), respectively. We then provide a scalability analysis, which consists of two studies. First, we analyze how the algorithms scale when varying the problem size, i.e., the number of variables. Second, we analyze their scalability in terms of parallelization, i.e., the impact of using more computational cores on the quality of solutions and on the execution time of the algorithms. Three different criteria are used for making the comparisons, namely the quality of the resulting approximation sets, average computational time and the convergence speed to the Pareto front.
Disciplines :
Computer science
Author, co-author :
ATASHPENDAR, Arash ;  University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT)
Dorronsoro, Bernabé;  University of Cádiz, Spain > School of Engineering
DANOY, Grégoire  ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
BOUVRY, Pascal ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Computer Science and Communications Research Unit (CSC)
External co-authors :
yes
Language :
English
Title :
A Scalable Parallel Cooperative Coevolutionary PSO Algorithm for Multi-objective Optimization
Publication date :
10 June 2017
Journal title :
Journal of Parallel and Distributed Computing
ISSN :
1096-0848
Publisher :
Elsevier
Peer reviewed :
Peer Reviewed verified by ORBi
Focus Area :
Computational Sciences
Available on ORBilu :
since 13 July 2017

Statistics


Number of views
246 (56 by Unilu)
Number of downloads
1 (1 by Unilu)

Scopus citations®
 
38
Scopus citations®
without self-citations
38
OpenCitations
 
27
WoS citations
 
34

Bibliography


Similar publications



Contact ORBilu