Inverse 2- Center Location Problem for Unweighted Tree Networks: Case Study

This paper studies inverse 2- center location problem by increasing and decreasing the edge length on unweighted tree networks. The goal is to increase and decrease the edge lengths at minimum total cost subject to given modification bounds such that predetermined vertices becomes absolute 2-center. In order to demonstrate the practical application of this issue, we consider Bojnord urban network and two important fire stations of the city as center locations. Moreover, an example is generated for computational analysis. The results show when predetermined vertices are close to ends of tree, a higher cost is imposed as well as in most cases it is impossible.