Parallel fractal decomposition based algorithm for big continuous optimization problems

A. Nakib 1, 2 L. Souquet 2, 3 El-Ghazali Talbi 4, 5
1 SIMO
LISSI - Laboratoire Images, Signaux et Systèmes Intelligents
5 BONUS - Optimisation de grande taille et calcul large échelle
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille (CRIStAL) - UMR 9189
Abstract : Fractal Decomposition Algorithm (FDA) is a metaheuristic that was recently proposed to solve high dimensional continuous optimization problems. This approach is based on a geometric fractal decomposition which divides the search space while looking for the optimal solution. While FDA and its fractal decomposition has shown to be an effective optimization algorithm, its running time grows significantly as the problems dimension increases. To overcome this expensive computational time, a parallelized version of FDA, called Parallel Fractal Decomposition Algorithm (PFDA) is proposed. The focus was on parallelizing the exploration and exploitation phases of the original algorithm on a multi-threaded environment. The performances of PFDA were evaluated on the same Benchmark used to illustrate FDA efficiency, the SOCO 2011. It is composed of 19 functions with dimensions going from 50 to 5000. Results show that PFDA reaches similar performances as the original version with a significantly reduced computational time.
Document type :
Journal articles
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01844420
Contributor : Lab Lissi <>
Submitted on : Thursday, July 19, 2018 - 12:46:54 PM
Last modification on : Friday, March 22, 2019 - 1:36:36 AM

Identifiers

Citation

A. Nakib, L. Souquet, El-Ghazali Talbi. Parallel fractal decomposition based algorithm for big continuous optimization problems. Journal of Parallel and Distributed Computing, Elsevier, 2018, ⟨10.1016/j.jpdc.2018.06.002⟩. ⟨hal-01844420⟩

Share

Metrics

Record views

95