Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2409.11872 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929504019021824 |
|---|---|
| author | Baldomero-Naranjo, Marta Kalcsics, Jörg Rodríguez-Chía, Antonio M. |
| author_facet | Baldomero-Naranjo, Marta Kalcsics, Jörg Rodríguez-Chía, Antonio M. |
| contents | This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose a minmax regret model where the service facility can be located anywhere along the network. This problem is called Minmax Regret Maximal Covering Location Problem with demand distributed along the edges (MMR-EMCLP). Furthermore, we present two polynomial algorithms for finding the location that minimises the maximal regret assuming that the demand realisation is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study for the unknown constant demand case to illustrate the potential and limits of the proposed methodology. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2409_11872 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Minmax regret maximal covering location problems with edge demands Baldomero-Naranjo, Marta Kalcsics, Jörg Rodríguez-Chía, Antonio M. Optimization and Control This paper addresses a version of the single-facility Maximal Covering Location Problem on a network where the demand is: (i) distributed along the edges and (ii) uncertain with only a known interval estimation. To deal with this problem, we propose a minmax regret model where the service facility can be located anywhere along the network. This problem is called Minmax Regret Maximal Covering Location Problem with demand distributed along the edges (MMR-EMCLP). Furthermore, we present two polynomial algorithms for finding the location that minimises the maximal regret assuming that the demand realisation is an unknown constant or linear function on each edge. We also include two illustrative examples as well as a computational study for the unknown constant demand case to illustrate the potential and limits of the proposed methodology. |
| title | Minmax regret maximal covering location problems with edge demands |
| topic | Optimization and Control |
| url | https://arxiv.org/abs/2409.11872 |