In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse case of facility location problem with equality measure considers modifying the weights of vertices with a given budget constraint, such that the difference between the maximum and minimum weights of vertices allocated to the given facilities is reduced as much as possible. Two algorithms with time complexity O(nlogn) are presented for the inverse and reverse 2-facility location problems with equality measures. Computational results show their superiority with respect to the linear programming models.

Type of Study: Research paper |
Subject:
General

Rights and permissions | |

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License. |