Skip to main content
SpringerLink
Log in

Studies on the Performance of a Heuristic Algorithm for Static and Transportation Facility Location Allocation Problem

  • Conference paper
High Performance Computing and Applications

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5938))

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Owen, S.H., Daskin, M.S.: Strategic facility location: A review. European Journal of Operational Research 111(3), 423–447 (1998)

    Article  MATH  Google Scholar 

  2. Gu, W., Wang, X., Geng, L.: STFLS: A Heuristic Method for Static and Transportation Facility Location Allocation in Large Spatial Datasets. In: Proceedings of the 22th Canadian Conference on Artificial Intelligence, pp. 211–214 (2009)

    Google Scholar 

  3. Longley, P., Batty, M.: Advanced Spatial Analysis: The CASA Book of GIS. ESRI (2003)

    Google Scholar 

  4. Church, R.L., ReVelle, C.S.: Theoretical and computational links between the p-median location set-covering and the maximal covering location problem. Geographical Analysis 8, 406–415 (1976)

    Article  Google Scholar 

  5. Pacheco, J., Casado, S., Alegre, J.F.: Heuristic Solutions for Locating Health Resources. IEEE Intelligent Systems 23(1), 57–63 (2008)

    Article  Google Scholar 

  6. Daskin, M.S.: Network and Discrete Location: Models Algorithms and Applications. Wiley, Chichester (1995)

    Book  MATH  Google Scholar 

  7. Leong Hou, U., Yiu, M. L., Mouratidis, K., Mamoulis, N.: Capacity Constrained Assignment in Spatial Databases. In: Proceedings of ACM-SIGMOD international conference on Management of data, pp. 15-28 (2008)

    Google Scholar 

  8. Wong, R.C., Tao, Y., Fu, A.W., Xiao, X.: On efficient spatial Matching. In: Proceedings of International Conference on Very Large Data Bases (VLDB), pp. 579–590 (2007)

    Google Scholar 

  9. Marianov, V., Serra, D.: Probabilistic maximal covering location–allocation for congested system. Journal of Regional Science 38, 401–424 (1998)

    Article  Google Scholar 

  10. Marianov, V., Serra, D.: Location–allocation of multiple-server service centers with constrained queues or waiting times. Annals of Operations Research 111, 35–50 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  11. Marianov, V., Rios, M., Icaza, M.J.: Facility location for market capture when users rank facilities by shorter travel and waiting times. European Journal of Operational Research 191, 32–44 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  12. Willoughby, K.A.: A mathematical programming analysis of public transit systems. Omega 30, 137–142 (2002)

    Article  Google Scholar 

  13. Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: A greedy facility location algorithm analyzed using dual fitting. In: Goemans, M.X., Jansen, K., Rolim, J.D.P., Trevisan, L. (eds.) RANDOM 2001 and APPROX 2001. LNCS, vol. 2129, pp. 127–137. Springer, Heidelberg (2001)

    Google Scholar 

  14. Teitz, M.B., Bart, P.: Heuristic methods for estimating generalized vertex median of a weighted graph. Operations Research 16, 955–961 (1968)

    Article  MATH  Google Scholar 

  15. Densham, P.J., Rushton, G.: Strategies for solving large location-allocation problems by heuristic methods. Environment and Planning A, 24, 280–304 (1992)

    Article  Google Scholar 

  16. Hansen, P., Mladenović, N.: Variable Neighborhood Search for the p-Median. Location Science 5, 207–226 (1997)

    Article  MATH  Google Scholar 

  17. Rolland, E., Schilling, D.A., Current, J.R.: An Efficient Tabu Search Procedure for the p Median Problem. European Journal of Operational Research 96, 329–342 (1996)

    Article  Google Scholar 

  18. Garcıa-López, F., Melián-Batista, B., Moreno-Pérez, J.A., Moreno-Vega, J.M.: Parallelization of the Scatter Search for the p-Median Problem. Parallel Computing 29(5), 575–589 (2003)

    Article  Google Scholar 

  19. Gu, W., Wang, X., Geng, L.: GIS-FLSolution: A Spatial Analysis Platform for Static and Transportation Facility Location Allocation Problem. In: Proceedings of the 18th International Symposium on Methodologies for Intelligent Systems, pp. 453–462 (2009)

    Google Scholar 

  20. Han, J., Kamber, M., Tung, A.K.H.: Spatial Clustering Methods in Data Mining: A Survey. In: Miller, H., Han, J. (eds.) Geographic Data Mining and Knowledge Discovery. Taylor and Francis, Abington (2001)

    Google Scholar 

  21. Ghoseiri, K., Ghannadpour, S.F.: Solving Capacitated P-Median Problem using Genetic Algorithm. In: Proceedings of International Conference on Industrial Engineering and Engineering Management (IEEM), pp. 885–889 (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Geomatics Engineering, University of Calgary, Calgary, AB, Canada

    Wei Gu & Xin Wang

Authors
  1. Wei Gu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Xin Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Computer Engineering and Science, Shanghai University, 200072, Shanghai, P.R. China

    Wu Zhang  & Weiqin Tong  & 

  2. Schulich School of Engineering, University of Calgary, T2N 1N4, Calgary, AB, Canada

    Zhangxin Chen

  3. Department of Mathematics, University of Wyoming, 1000 University Avenue, 82071-3036, Laramie, WY, USA

    Craig C. Douglas

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gu, W., Wang, X. (2010). Studies on the Performance of a Heuristic Algorithm for Static and Transportation Facility Location Allocation Problem. In: Zhang, W., Chen, Z., Douglas, C.C., Tong, W. (eds) High Performance Computing and Applications. Lecture Notes in Computer Science, vol 5938. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11842-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11842-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11841-8

  • Online ISBN: 978-3-642-11842-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation