A Greedy Facility Location Algorithm Analyzed Using Dual Fitting
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Parallelization of the scatter search for the p-median problem
Parallel Computing - Special issue: Parallel computing in logistics
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Heuristic Solutions for Locating Health Resources
IEEE Intelligent Systems
Capacity constrained assignment in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems
Expert Systems with Applications: An International Journal
Hi-index | 0.01 |
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.