Int. J. Simul. Multidisci. Des. Optim.
Volume 11, 2020
|Number of page(s)||10|
|Published online||31 January 2020|
A comparative study of three new parallel models based on the PSO algorithm
LGS Lab − ENSA, Ibn Tofail University, Kenitra, Morocco
2 LITIS Lab − INSA, Normandy University, Rouen, France
* e-mail: email@example.com
Accepted: 2 December 2019
Meta-heuristic PSO has limits, such as premature convergence and high running time, especially for complex optimization problems. In this paper, a description of three parallel models based on the PSO algorithm is developed, on the basis of combining two concepts: parallelism and neighborhood, which are designed according to three different approaches in order to avoid the two disadvantages of the PSO algorithm. The third model, SPM (Spherical-neighborhood Parallel Model), is designed to improve the obtained results from the two parallel NPM (Neighborhood Parallel Model) and MPM (Multi-PSO Parallel Model) models. The experimental results presented in this paper show that SPM model performed much better than both NPM and MPM models in terms of computing time and solution quality.
Key words: Optimization / metaheuristic / PSO / SA / parallelization / computing time
© M. Zemzami et al., published by EDP Sciences, 2020
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.