LAUSR

This paper concerns a general inverse p-median location problem on the k-dimensional real space where the aim is to change (increase or reduce) the weights and coordinates of the existing customer points at the minimum total cost subject to given modification bounds so that a set of p predetermined facility points becomes an optimal p-median location under the new weights and coordinates. A modified firefly algorithm is proposed to solve the problem under the rectilinear, Chebyshev and Euclidean distance norms. By computational experiments, the high efficiency of the algorithm is illustrated.