Local search heuristic for k-median and facility location problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
| Hi-index | 0.00 |
This paper solves a static and transportation facility location allocation problem defined as follows: given a set of locations Loc and a set of demand objects D located in Loc , the goal is to allocate a set of static facilities S and a set of transportation facilities T to the locations in Loc , which minimizes both the average travelling distance from D to S and the maximum transportation travelling distance between D and S through T . The problem is challenging because two types of facilities are involved and cooperate with each other. In this paper, we propose a static and transportation facility location allocation algorithm, called STFLS, to solve the problem. The method uses two steps of searching for static facility and transportation facility locations Experiments demonstrate the efficiency and practicality of the algorithm.