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

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...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Knowledge-based systems Ročník 265; s. 110363
Hlavní autoři: Aïder, Méziane, Azzi, Aida-Ilham, Hifi, Mhand
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 08.04.2023
Elsevier
Témata:
Computer Science
Computing
Learning
Multi-objective
Optimization
Population
Learning
Population
Multi-objective
Computing
Optimization
ISSN:0950-7051, 1872-7409
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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 ɛ-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. •An NP-hard bi-objective obnoxious p-median problem is studied.•A new population-based algorithm is proposed.•The ɛ-constraint is used as a learning strategy fo highlighting the approximate Pareto front.•Quantitative and qualitative analysis are considered for evaluating the performance of the algorithm.•New dominated solutions with high approximate Pareto fronts are reached.
ISSN:0950-7051
1872-7409
DOI:10.1016/j.knosys.2023.110363