Studies on the performance of a heuristic algorithm for static and transportation facility location allocation problem

Abstract

Static and transportation facility location allocation problem (STAFLA) is a new problem in facility location research. It tries to find out optimal locations of static and transportation facilities to serve an objective area with minimum costs. STFLS [2], a heuristic algorithm, has been proposed to solve STAFLA problem successfully and used into real applications. In this paper, an extended formalization of STAFLA problem is given first. Then the thorough analysis on the computing performance of the algorithm STFLS is discussed. Experiments have been conducted to demonstrate the efficiency and practicality of STFLS. © 2010 Springer-Verlag.