An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , , , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866911724501729280 |
|---|---|
| author | Gjergji, Ida Kletzander, Lucas Musliu, Nysret Schaerf, Andrea |
| author_facet | Gjergji, Ida Kletzander, Lucas Musliu, Nysret Schaerf, Andrea |
| contents | A new variant of the classic capacitated facility location problem, which considers incompatibilities between customers, has recently been introduced in the literature. This problem captures the situation where given pairs of customers cannot be served by the same facility. Such a feature is crucial for many practical cases of location problems, such as the presence of hazardous or polluting materials and contention between competing costumers. In this paper, we propose a Large Neighborhood Search (LNS) method to solve this problem. Within the framework of LNS, we introduce three different destroy operators, which are combined in a hybrid manner, and we use an exact solver in the repair phase. Different algorithmic components are investigated for the design of LNS. The experimental analysis shows that our new method outperforms existing state-of-the-art metaheuristics, providing new best solutions for all available benchmark instances. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_28337 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers Gjergji, Ida Kletzander, Lucas Musliu, Nysret Schaerf, Andrea Artificial Intelligence A new variant of the classic capacitated facility location problem, which considers incompatibilities between customers, has recently been introduced in the literature. This problem captures the situation where given pairs of customers cannot be served by the same facility. Such a feature is crucial for many practical cases of location problems, such as the presence of hazardous or polluting materials and contention between competing costumers. In this paper, we propose a Large Neighborhood Search (LNS) method to solve this problem. Within the framework of LNS, we introduce three different destroy operators, which are combined in a hybrid manner, and we use an exact solver in the repair phase. Different algorithmic components are investigated for the design of LNS. The experimental analysis shows that our new method outperforms existing state-of-the-art metaheuristics, providing new best solutions for all available benchmark instances. |
| title | An Enhanced Large Neighborhood Search Approach for the Capacitated Facility Location Problem with Incompatible Customers |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2605.28337 |