Classical p-median location problem under uncertain random environment

In this paper, we investigate the classical p-median location problem on a network in which some vertex weights and distances between vertices are uncertain and meanwhile some are random. The aim is to locate p facilities on vertices of the uncertain random network such that the sum of the weighted distances from each vertex to its closest facility becomes minimum. We propose a procedure to calculate the ideal chance distribution function of the p-median associated with uncertain random network. Finally, we present an algorithm for finding the p-median in an uncertain random network.