A distribution map for the one-median location problem on a network

In this paper we consider the Weber (one-median) location problem on a network. The weights at the nodes are drawn from a multivariate normal distribution. We find the probability that the optimal location is at each of the nodes. This set of probabilities is the distribution map. The methodology is illustrated on two networks of 20 nodes each.