SPIDER: decomposition and path-relinking based algorithm for bi-objective optimization problems - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2020

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.
Fichier principal
Vignette du fichier
GPS.pdf (3.61 Mo) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-02499403 , version 1 (05-03-2020)
hal-02499403 , version 2 (03-06-2020)

Identifiers

  • HAL Id : hal-02499403 , version 2

Cite

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

Share

Gmail Facebook X LinkedIn More