Skip to main content
SpringerLink
Log in

Deterministic and Randomized Heuristic Algorithms for Uncapacitated Facility Location Problem

  • Conference paper
  • First Online:
Information and Decision Sciences

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 701))

Abstract

A well-known combinatorial optimization problem, known as the Uncapacitated Facility Location Problem (UFLP) is considered in this paper. Given a set of customers and a set of potential facilities, the objective of UFLP is to open a subset of the potential facilities such that sum of the opening cost for opened facilities and the service cost of customers is minimized. In this paper, deterministic and randomized heuristic algorithms are presented to solve UFLP. The effectivenesses of the proposed algorithms are tested on UFLP instances taken from the OR-Library. Although the proposed deterministic algorithm gives optimal results for most of the instances, the randomized algorithm achieves optimal results for all the instances of UFLP considered in this paper including those for which the deterministic algorithm fails to achieve the optimal solutions.

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 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.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

References

  1. Krarup, J., Pruzan, P.M.: The simple plant location problem: survey and synthesis. Eur. J. Oper. Res. 12(1), 36–81 (1983)

    Article  MathSciNet  Google Scholar 

  2. Balinski, M.: On finding integer solutions to linear programs. Technical Report, DTIC Document (1964)

    Google Scholar 

  3. Erlenkotter, D.: A dual-based procedure for uncapacitated facility location. Oper. Res. 26(6), 992–1009 (1978)

    Article  MathSciNet  Google Scholar 

  4. Al-Sultan, K., Al-Fawzan, M.: A tabu search approach to the uncapacitated facility location problem. Ann. Oper. Res. 86, 91–103 (1999)

    Article  MathSciNet  Google Scholar 

  5. Sun, M.: Solving the uncapacitated facility location problem using tabu search. Comput. Oper. Res. 33(9), 2563–2589 (2006)

    Article  MathSciNet  Google Scholar 

  6. Kratica, J., Tošic, D., Filipović, V., Ljubić, I.: Solving the simple plant location problem by genetic algorithm. RAIRO Oper. Res. 35(01), 127–142 (2001)

    Article  MathSciNet  Google Scholar 

  7. Khumawala, B.M.: An efficient branch and bound algorithm for the warehouse location problem. Manag. Sci. 18(12), B–718 (1972)

    Article  MathSciNet  Google Scholar 

  8. Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to NP-completeness (1979)

    Google Scholar 

  9. Lenstra, J., Kan, A.R.: Complexity of Packing, Covering and Partitioning Problems. Econometric Institute (1979)

    Google Scholar 

  10. Akinc, U., Khumawala, B.M.: An efficient branch and bound algorithm for the capacitated warehouse location problem. Manag. Sci. 23(6), 585–594 (1977)

    Article  MathSciNet  Google Scholar 

  11. Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. Ann. Discrete Math. 1, 79–97 (1977)

    Article  MathSciNet  Google Scholar 

  12. Shmoys, D.B., Tardos, É., Aardal, K.: Approximation algorithms for facility location problems. In: Proceedings of the Twenty-Ninth Annual ACM Symposium on Theory of Computing, pp. 265–274. ACM (1997)

    Google Scholar 

  13. Guha, S., Khuller, S.: Greedy strikes back: improved facility location algorithms. J. Algorithms 31(1), 228–248 (1999)

    Article  MathSciNet  Google Scholar 

  14. Ghosh, D.: Neighborhood search heuristics for the uncapacitated facility location problem. Eur. J. Oper. Res. 150(1), 150–162 (2003)

    Article  MathSciNet  Google Scholar 

  15. Resende, M.G., Werneck, R.F.: A hybrid multistart heuristic for the uncapacitated facility location problem. Eur. J. Oper. Res. 174(1), 54–68 (2006)

    Article  MathSciNet  Google Scholar 

  16. Beltran-Royo, C., Vial, J.P., Alonso-Ayuso, A.: Solving the uncapacitated facility location problem with semi-Lagrangian relaxation. Stat. Oper. Res., Rey Juan Carlos University, Mostoles, Madrid, España (2007)

    Google Scholar 

  17. Lazic, N., Frey, B.J., Aarabi, P.: Solving the uncapacitated facility location problem using message passing algorithms. In: International Conference on Artificial Intelligence and Statistics, pp. 429–436 (2010)

    Google Scholar 

  18. Monabbati, E.: An application of a Lagrangian-type relaxation for the uncapacitated facility location problem. Jpn. J. Ind. Appl. Math. 31(3), 483–499 (2014)

    Article  MathSciNet  Google Scholar 

  19. Ardjmand, E., Amin-Naseri, M.R.: Unconscious search-a new structured search algorithm for solving continuous engineering optimization problems based on the theory of psychoanalysis. In: Proceedings of Advances in Swarm Intelligence, pp. 233–242. Springer (2012)

    Google Scholar 

  20. Beasley, J.E.: OR-library: distributing test problems by electronic mail. J. Oper. Res. Soc. 1069–1072 (1990)

    Article  Google Scholar 

  21. Hoefer, M.: UflLib, benchmark instances for the uncapacitated facility location problem (2003). http://www.mpi-inf.mpg.de/departments/d1/projects/benchmarks/UflLib

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, University of Kalyani, Nadia, Kalyani, 741235, West Bengal, India

    Soumen Atta, Priya Ranjan Sinha Mahapatra & Anirban Mukhopadhyay

Authors
  1. Soumen Atta
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Priya Ranjan Sinha Mahapatra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Anirban Mukhopadhyay
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Soumen Atta .

Editor information

Editors and Affiliations

  1. Department of Computer Science and Engineering, PVP Siddhartha Institute of Technology, Vijayawada, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. Departamento de Engenharia Mecânica, Universidade do Porto, Porto, Portugal

    Joao Manuel R.S. Tavares

  3. Department of Electronics and Communication Engineering, SRMGPC, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

  4. School of Computer Application, KIIT University, Bhubaneswar, Odisha, India

    J. R. Mohanty

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Atta, S., Mahapatra, P.R.S., Mukhopadhyay, A. (2018). Deterministic and Randomized Heuristic Algorithms for Uncapacitated Facility Location Problem. In: Satapathy, S., Tavares, J., Bhateja, V., Mohanty, J. (eds) Information and Decision Sciences. Advances in Intelligent Systems and Computing, vol 701. Springer, Singapore. https://doi.org/10.1007/978-981-10-7563-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-7563-6_22

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-7562-9

  • Online ISBN: 978-981-10-7563-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation