a novel algorithm for general minimum cost inverse obnoxious median location optimization on graphs

This paper deals with an extensive variant of the inverse obnoxious p-median location problem on graphs in which the set of vertices is considered as the existing client points and the aim is to modify the underlying vertex weights and the arc lengths at the minimum overall cost with respect to the modification bounds so that a given set of p vertices, denoting the predetermined facility sites, becomes an obnoxious p-median location of the perturbed graph. a novel modified directional bat algorithm, as a metaheuristic approach, is developed to solve the problem under the rectilinear cost norm.