The network 1-median problem with discrete demand weights and traveling times

In this paper, the l-median location problem on an undirected network with discrete random demand weights and traveling times is investigated, The objective function is to maximize the probability that the expected sum of weighted distances from the existing nodes to the selected median does not exceed a prespecified given threshold. An analytical algorithm is proposed to get the optimal solution in small-sized networks. Then, by using the central limit theorem, the problem is studied in large-sized networks and reduced to a nonlinear problem. The numerical examples are given to illustrate the efficiency of the proposed methods

Keywords:

Facility location , 1-median problem , probabilistic weights , probabilistic traveling times