论文信息 - Facility Location on a Network with Unreliable Links

Facility Location on a Network with Unreliable Links

In this paper we study a simple vulnerability-based stochastic dependency model of link failures in a network prone to disasters. Under this model, we study the problem of locating k facilities to maximize the expected demand serviced within a given distance, and show its equivalence to the well-studied maximum k-facility location problem. In the special case when there is no distance constraint, we give two solutions to the k-facility location problem using dynamic programming and a greedy algorithm.

R. Ravi | Refael Hassin | F. Sibel Salman

[1] Thomas Wolle. A Framework for Network Reliability Problems on Graphs of Bounded Treewidth , 2002, ISAAC.

[2] Maged Dessouky,et al. A modeling framework for facility location of medical services for large-scale emergencies , 2007 .

[3] Nick Goldman,et al. Species Choice for Comparative Genomics: Being Greedy Works , 2005, PLoS genetics.

[4] Emanuel Melachrinoudis,et al. A single facility location problem on a tree with unreliable edges , 1996, Networks.

[5] Benita M. Beamon,et al. Facility location in humanitarian relief , 2008 .

[6] F. Sibel Salman,et al. Assessing the reliability and the expected performance of a network under disaster risk , 2011, OR Spectr..

[7] Mike Steel,et al. Phylogenetic diversity and the greedy algorithm. , 2005, Systematic biology.

[8] Lawrence V. Snyder,et al. Reliability Models for Facility Location: The Expected Failure Cost Case , 2005, Transp. Sci..

[9] Michel Gendreau,et al. Location of facilities on a network subject to a single-edge failure , 1992, Networks.

[10] George L. Nemhauser,et al. Note--On "Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms" , 1979 .