The mean-value-at-risk median problem on a network with random demand weights

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dr. Zvi Drezner’s research career has touched on many areas of location analysis. We devote the first part of this chapter to summarizing Zvi’s vast contributions to the studies of the minimax and the maximum facility location problems. His relevant publications are grouped in terms of the characteristics of the problems investigated, including space, the number of facilities to locate, and completeness of information. In particular, we provide an overview of Zvi’s work in the deterministic planar minimax problems. The second part of the chapter is our own paper on a network median problem when demand weights are independent random variables. The objective of the model proposed is to locate a single facility so as to minimize the expected total demand-weighted distance subject to a constraint on the value-at-risk (VaR). The study integrates the expectation criterion with the VaR measure and links different median models with random demand weights. Methods are suggested to identify dominant points for the optimal solution. An algorithm is developed for solving the problem.

Cite

CITATION STYLE

APA

Xin, C., & Wang, J. (2019). The mean-value-at-risk median problem on a network with random demand weights. In International Series in Operations Research and Management Science (Vol. 281, pp. 321–341). Springer New York LLC. https://doi.org/10.1007/978-3-030-19111-5_13

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free