Deterministic metaheuristic based on fractal decomposition for large-scale optimization - Archive ouverte HAL Access content directly
Journal Articles Applied Soft Computing Year : 2017

Deterministic metaheuristic based on fractal decomposition for large-scale optimization

(1) , (1) , (1) , (2) , (3)
1
2
3

Abstract

In this work a new method based on geometric fractal decomposition to solve large-scale continuous optimization problems is proposed. It consists of dividing the feasible search space into sub-regions with the same geometrical pattern. At each iteration, the most promising ones are selected and further decomposed. This approach tends to provide a dense set of samples and has interesting theoretical convergence properties. Under some assumptions, this approach covers all the search space only in case of small dimensionality problems. The aim of this work is to propose a new algorithm based on this approach with low complexity and which performs well in case of large-scale problems. To do so, a low complex method that profits from fractals properties is proposed. Then, a deterministic optimization procedure is proposed using a single solution-based metaheuristic which is exposed to illustrate the performance of this strategy. Obtained results on common test functions were compared to those of algorithms from the literature and proved the efficiency of the proposed algorithm.
Not file

Dates and versions

hal-01660190 , version 1 (10-12-2017)

Identifiers

Cite

Amir Nakib, Salima Ouchraa, Nadiya Shvai, Léo Souquet, El-Ghazali Talbi. Deterministic metaheuristic based on fractal decomposition for large-scale optimization. Applied Soft Computing, 2017, 61, pp.468-485. ⟨10.1016/j.asoc.2017.07.042⟩. ⟨hal-01660190⟩
311 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More