Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

SPIDER: decomposition and path-relinking based algorithm for bi-objective optimization problems

Abstract : This paper proposes an original bi-objective optimization approach around the key feature of local conservation of the Pareto stationnarity along the gradient axes (LCPS). The proposed algorithm consists of two steps. The decomposition step starts with the anchor points, generate N evenly points on the axes relating the anchor points to the utopia point. Then, the corresponding nearest reference points on the Pareto front are generated. In the path-relinking step, we carry out a path-relinking in the objective space, between each pair of Pareto solutions, following the best direction among the gradients axes. The SPIDER algorithm largely outperforms state-of-the-art and popular evolutionary algorithms both in terms of the quality of the obtained Pareto fronts (convergence, cardinality, diversity) and the search time.
Complete list of metadata

Cited literature [30 references]  Display  Hide  Download

https://hal.inria.fr/hal-02499403
Contributor : Talbi El-Ghazali <>
Submitted on : Wednesday, June 3, 2020 - 9:21:21 AM
Last modification on : Friday, December 11, 2020 - 6:44:08 PM

File

GPS.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-02499403, version 2

Collections

Citation

Nassime Aslimani, El-Ghazali Talbi, Rachid Ellaia. SPIDER: decomposition and path-relinking based algorithm for bi-objective optimization problems. 2020. ⟨hal-02499403v2⟩

Share

Metrics

Record views

63

Files downloads

256