A heuristic method for solving large-scale multi–facility location problems is presented. The method is analogous to Cooper’s method [3], using the authors’ single facility location method [20] as a parallel subroutine, and reassigning customers to facilities using the heuristic of Nearest Center Reclassification. Numerical results are reported.

In this paper we formalize and initiate the study of heterogeneous k-facility location without money, a problem akin to the classical k-facility location problem but encompassing a richer model and featuring multi-parameter agents. In particular, we consider truthful mechanisms without money for the problem in which heterogeneous (i.e. serving different purposes) facilities have to be located a...

“Green logistics” is a popular catchword, not only in public and among companies, but also in academia. In this paper we apply the concept of green logistics to the facility location problem: Optimizing the locations of facilities in the general pmedian model. This is based on CO2 emissions generated through transportation rather than traditional cost measures, such as physical transportation c...

In this paper we present a 1.52-approximation algorithm for the metric uncapacitated facility location problem, and a 2-approximation algorithm for the metric capacitated facility location problem with soft capacities. Both these algorithms improve the best previously known approximation factor for the corresponding problem, and our soft-capacitated facility location algorithm achieves the inte...

In facility location games, one aims at designing a mechanism to decide the facility location based on the addresses reported by all agents. In the standard facility location game, each agent wants to minimize the distance from the facility, while in the obnoxious facility game, each agent prefers to be as far away from the facility as possible. In this paper we revisit the two games on a line ...

In this paper we consider the following obnoxious facility location problem: given a set S of n points in the plane, and two special points a and b, find the 1-corner polygonal chain (also known as boomerang) connecting a and b such that its minimum distance to S is maximized. In other words: find the widest empty polygonal chain of two edges having extremes anchored at a and b. We present a ne...

http://dx.doi.org/10.1016/j.tre.2014.01.01

Hub facility location problem looks to find the most appropriate location for deploying such facilities. An important factor in such a problem is the pool of potential locations from which the optimal locations must be selected. The present research was performed to address two key objectives: identifying the factors contributing to the selection locations for hub establishment, and presenting ...