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

Authors:
Wei Gu;Xin Wang
Affiliations:
Department of Geomatics Engineering, University of Calgary, Calgary, AB, Canada;Department of Geomatics Engineering, University of Calgary, Calgary, AB, Canada
Venue:
HPCA'09 Proceedings of the Second international conference on High Performance Computing and Applications
Year:
2009

Citing 7
Cited 1

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
On efficient spatial matching

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
STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets

Canadian AI '09 Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence
GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem

ISMIS '09 Proceedings of the 18th International Symposium on Foundations of Intelligent Systems

Solving large immobile location-allocation by affinity propagation and simulated annealing. Application to select which sporting event to watch

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.01

Visualization

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.