The minmax regret gradual covering location problem on a network with incomplete information of demand weights

The gradual covering location problem seeks to establish facilities on a network so as to maximize the total demand covered, allowing partial coverage. We focus on the gradual covering location problem when the demand weights associated with nodes of the network are random variables whose probability distributions are unknown. Using only information on the range of these random variables, this study is aimed at finding the "minmax regret" location that minimizes the worst-case coverage loss. We show that under some conditions, the problem is equivalent to known location problems (e.g. the minmax regret median problem). Polynomial time algorithms are developed for the problem on a general network with linear coverage decay functions.

[1]  Charles ReVelle,et al.  Reserve Design and Facility Siting , 2002 .

[2]  Richard L. Church,et al.  The maximal covering location problem , 1974 .

[3]  O Berman,et al.  The probabilistic 1-maximal covering problem on a network with discrete demand weights , 2008, J. Oper. Res. Soc..

[4]  Zvi Drezner,et al.  Facility location - applications and theory , 2001 .

[5]  Zvi Drezner,et al.  The gradual covering decay location problem on a network , 2003, Eur. J. Oper. Res..

[6]  Oded Berman,et al.  An improved algorithm for the minmax regret median problem on a tree , 2003, Networks.

[7]  Oded Berman,et al.  Minmax Regret Median Location on a Network Under Uncertainty , 2000, INFORMS J. Comput..

[8]  Kenneth L. Roberts,et al.  Generalized coverage models and public facility location , 1983 .

[9]  R. Church,et al.  Location Modeling Utilizing Maximum Service Distance Criteria , 2010 .

[10]  Bintong Chen,et al.  Minmax‐regret robust 1‐median location on a tree , 1998 .

[11]  Luis G. Vargas,et al.  Uncertainty and rank order in the analytic hierarchy process , 1987 .

[12]  Nimrod Megiddo,et al.  Linear-time algorithms for linear programming in R3 and related problems , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[13]  Simon French,et al.  Uncertainty and Imprecision: Modelling and Analysis , 1995 .

[14]  Oded Berman,et al.  Algorithms for the robust 1-center problem on a tree , 2000, Eur. J. Oper. Res..

[15]  J. Milnor.  Games Against Nature , 1951 .

[16]  Melvyn Sim,et al.  Robust discrete optimization and network flows , 2003, Math. Program..

[17]  I. Averbakh,et al.  Minimax regret p-center location on a network with demand uncertainty , 1997 .

[18]  A Gerodimos,et al.  Robust Discrete Optimization and its Applications , 1996, J. Oper. Res. Soc..

[19]  Leonard J. Savage,et al.  The Theory of Statistical Decision , 1951 .

[20]  Kurt Weichselberger.  The theory of interval-probability as a unifying concept for uncertainty , 2000, Int. J. Approx. Reason..

[21]  Bintong Chen,et al.  Minmax-regret robust 1-median location on a tree , 1998, Networks.

[22]  Martin E. Dyer,et al.  Linear Time Algorithms for Two- and Three-Variable Linear Programs , 1984, SIAM J. Comput..