A modified directional bat algorithm for extensive inverse p-facility maxian location problems on networks

This paper deals with an extensive variant of the inverse p-facility maxian location problem on networks in which the set of vertices is considered as the existing client points and the aim is to modify (augment or reduce) 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 a p-facility maxian location of the perturbed network. A novel modified directional bat algorithm, as a meta-heuristic approach, is developed to solve the problem under the bottleneck-type Hamming, sum-type Hamming, rectilinear and Chebyshev cost norms. Through computational tests, the effectiveness of the proposed algorithm is shown.