Artículo
Unreliable point facility location problems on networks
Autor/es | Puerto Albandoz, Justo
Ricca, Federica Scozzari, Andrea |
Departamento | Universidad de Sevilla. Departamento de Estadística e Investigación Operativa |
Fecha de publicación | 2014-03 |
Fecha de depósito | 2016-06-27 |
Publicado en |
|
Resumen | In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities ... In this paper we study facility location problems on graphs under the most common criteria, such as, median, center and centdian, but we incorporate in the objective function some reliability aspects. Assuming that facilities may become unavailable with a certain probability, the problem consists of locating facilities minimizing the overall or the maximum expected service cost in the long run, or a convex combination of the two. We show that the k-facility problem on general networks is NP-hard. Then, we provide efficient algorithms for these problems for the cases of k = 1, 2, both on general networks and on trees. We also explain how our methodology extends to handle a more general class of unreliable point facility location problems related to the ordered median objective function. |
Agencias financiadoras | Ministerio de Ciencia y Tecnología (MCYT). España Junta de Andalucía |
Identificador del proyecto | MTM2007-67433-C02-01
FQM5849 |
Cita | Puerto Albandoz, J., Ricca, F. y Scozzari, A. (2014). Unreliable point facility location problems on networks. Discrete Applied Mathematics, 166, 188-203. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Unreliable point facility location ... | 277.8Kb | [PDF] | Ver/ | |