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.
Year of publication: |
2011
|
---|---|
Authors: | Berman, Oded ; Wang, Jiamin |
Published in: |
European Journal of Operational Research. - Elsevier, ISSN 0377-2217. - Vol. 208.2011, 3, p. 233-238
|
Publisher: |
Elsevier |
Keywords: | Location Network Gradual covering location Minmax regret Incomplete information |
Saved in:
Online Resource
Saved in favorites
Similar items by person
-
Responsive make‐to‐order supply chain network design
Aboolian, Robert, (2020)
-
The probabilistic 1-maximal covering problem on a network with discrete demand weights
Berman, Oded, (2008)
-
Berman, Oded, (2011)
- More ...