Skip to Main content Skip to Navigation
Journal articles

Fractal Decomposition Approach for Continuous Multi-Objective Optimization Problems

Leo Souquet 1 El Ghazali Talbi 2 Amir Nakib 3
2 BONUS - Optimisation de grande taille et calcul large échelle
Inria Lille - Nord Europe, CRIStAL - Centre de Recherche en Informatique, Signal et Automatique de Lille - UMR 9189
Abstract : Multi-objective optimization problems (MOPs) have been widely studied during the last decades. In this paper, we present a new intrinsically parallel approach based on Fractal decomposition (FDA) to solve MOPs. The key contribution of the proposed approach is to divide recursively the decision space using hyperspheres. Two different methods were investigated: the first one is based on scalarization that has been distributed on a parallel multi-node architecture virtual environments and taking profit from the FDA’s properties, while the second method is based on Pareto dominance sorting. A comparison with state of the art algorithms on different well known benchmarks shows the efficiency and the robustness of the proposed decomposition approaches.
Complete list of metadata
Contributor : Talbi El-Ghazali Connect in order to contact the contributor
Submitted on : Monday, January 4, 2021 - 9:09:26 AM
Last modification on : Tuesday, January 4, 2022 - 6:50:44 AM

Links full text



Leo Souquet, El Ghazali Talbi, Amir Nakib. Fractal Decomposition Approach for Continuous Multi-Objective Optimization Problems. IEEE Access, IEEE, 2020, 8, pp.167604-167619. ⟨10.1109/ACCESS.2020.3022866⟩. ⟨hal-03093676⟩



Les métriques sont temporairement indisponibles