On a facility location problem with applications to tele-diagnostic

Consider an undirected graph G modelling a network. Each vertex in the graph contains some physical devices, which can be monitored and possibly repaired from a remote site in case they become faulty. We assume that there can be two kinds of faults in the system: soft faults, which can be repaired remotely from another site (i.e., a monitor), and severe faults which cannot be repaired remotely and require further (possibly human) interventions. We assume that soft faults happen with some fixed probability λ, 0 < λ ≤ 1. We investigate the problem of locating monitors in the network so as to minimize the total expected communication cost per fault. We formalize such a problem as a location problem with a cost function depending on λ and study some properties of the optimal solutions. The latter are exploited for investigating the complexity of the problem and providing efficient approximation algorithms.

[1]  Qian Wang,et al.  Facility location models for immobile servers with stochastic demand , 2004 .

[2]  Ju-Liang Zhang,et al.  Capacitated facility location problem with general setup cost , 2006, Comput. Oper. Res..

[3]  François V. Louveaux,et al.  A Dual-Based Procedure for Stochastic Facility Location , 1992, Oper. Res..

[4]  James V. Jucker,et al.  The Simple Plant-Location Problem under Uncertainty , 1976, Oper. Res..

[5]  Vahab S. Mirrokni,et al.  The facility location problem with general cost functions , 2003, Networks.

[6]  Edward A. Fox,et al.  Caching Proxies: Limitations and Potentials , 1995, WWW.

[7]  Gilbert Laporte,et al.  Models and exact solutions for a class of stochastic location-routing problems , 1987 .

[8]  Bhaba R. Sarker,et al.  Discrete location theory , 1991 .

[9]  Roger M. Whitaker,et al.  On the optimality of facility location for wireless transmission infrastructure , 2004, Comput. Ind. Eng..

[10]  François V. Louveaux,et al.  Discrete stochastic location models , 1986 .

[11]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[12]  Yanjun Li,et al.  Budget-Constrained, Capacitated Hub Location to Maximize Expected Demand Coverage in Fixed-Wireless Telecommunication Networks , 2006, INFORMS J. Comput..

[13]  G. Barish,et al.  World Wide Web caching: trends and techniques , 2000, IEEE Commun. Mag..

[14]  George O. Wesolowsky,et al.  FACILITIES LOCATION: MODELS AND METHODS , 1988 .

[15]  Toshihide Ibaraki,et al.  Dynamic Generalized Assignment Problems with Stochastic Demands and Multiple Agent--Task Relationships , 2005, J. Glob. Optim..

[16]  Heung-Suk Hwang,et al.  A stochastic set-covering location model for both ameliorating and deteriorating items , 2004, Comput. Ind. Eng..

[17]  Pitu B. Mirchandani,et al.  Location on networks : theory and algorithms , 1979 .

[18]  Vijay V. Vazirani,et al.  Approximation algorithms for metric facility location and k-Median problems using the primal-dual schema and Lagrangian relaxation , 2001, JACM.