Locating a rectangular barrier facility on the plane: a bi-objective approach

We study the problem of finding a minimax location for a rectangular barrier facility on the plane and simultaneously minimising the interference of the barrier facility to the interactions among the existing facilities using rectilinear distances. This provides an ex post opportunity to modify an existing network or layout while minimising the disruption. The problem is formulated as a bi-objective problem and a mixed integer program is proposed as a solution methodology. A simulated annealing algorithm is presented for an extension of the problem where expropriation or removal of existing facilities is also possible. We consider expropriation or removal of existing facilities only if such policy is necessary or cost-beneficial.