Minmax regret maximal covering location problems with edge demands

Identificadores
URI: http://hdl.handle.net/10498/33311
DOI: 10.1016/J.COR.2020.105181
ISSN: 0305-0548
Ficheros
Estadísticas
Métricas y Citas
Metadatos
Mostrar el registro completo del ítemFecha
2021Departamento/s
Estadística e Investigación OperativaFuente
Computers & Operations Research Volume 130 , June 2021, 105181Resumen
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.
Materias
Location; Covering; Minmax regret; Networks; Robust optimizationColecciones
- Artículos Científicos [12077]
- Articulos Científicos Est. I.O. [364]
- Artículos Científicos INDESS [1046]





