Indexed on: 21 Mar '17Published on: 21 Mar '17Published in: arXiv - Mathematics - Optimization and Control
In this paper we introduce a new variant for the p-median facility location problem in which it is assumed that the exact position of the potential facilities is unknown. Instead, each of the facilities must belong to a convex region around their initial estimated positions. In this problem, two main decisions have to be made simultaneously: the determination of the potential facilities that must be opened to serve the demands of the customers and the location of the open facilities into their neighborhoods, at global minimum cost. We present several MINLP formulations for a wide family of objective functions which are usual in Location Analysis: ordered median functions. We also describe two math-heuristic approaches for solving the problem. The results of an extensive computational experience are reported.