RT - Journal Article
T1 - Inverse and Reverse 2-facility Location Problems with Equality Measures on a Network
JF - IJMSI
YR - 2023
JO - IJMSI
VO - 18
IS - 1
UR - http://ijmsi.ir/article-1-1543-en.html
SP - 211
EP - 225
K1 - Inverse facility location
K1 - Reverse facility location
K1 - Balanced allocation
K1 - Equality measure.
AB - 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.
LA eng
UL http://ijmsi.ir/article-1-1543-en.html
M3 10.52547/ijmsi.18.1.211
ER -