The ɛ -constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p -Median Problems - Université de Picardie Jules Verne Accéder directement au contenu
Article Dans Une Revue Knowledge-Based Systems Année : 2023

The ɛ -constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p -Median Problems

Résumé

The obnoxious p-median problem occurs in real-world applications, where facilities have features that induce a dangerous influence on the surrounding area. Therefore, this study aims to investigate a variant of this problem: the bi-objective version, where the two functions are related to the sum of the distances between each customer and its nearest open facility, and to the dispersion between facilities. For this purpose, a population-based algorithm is designed to solve it, where it starts by determining an initial reference archive set of diversified solutions and sequentially enriching the archive set by combining the dominating sorting local search with exchange and drop/reassign operators. Next, a series of epsilon-constraints is added as a learning strategy for iteratively highlighting the final approximate Pareto front. The performance of the method is evaluated on a set of instances, where its provided results are compared to those reached by more recent methods in the literature. Encouraging results are observed.(c) 2023 Published by Elsevier B.V.
Fichier non déposé

Dates et versions

hal-04052380 , version 1 (30-03-2023)

Identifiants

Citer

Méziane Aïder, Aida-Ilham Azzi, Mhand Hifi. The ɛ -constraint as a learning strategy in the population-based algorithm: The case of Bi-Objective Obnoxious p -Median Problems. Knowledge-Based Systems, 2023, 265, pp.110363. ⟨10.1016/j.knosys.2023.110363⟩. ⟨hal-04052380⟩

Collections

U-PICARDIE EPROAD
12 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More