Skip to main content
SpringerLink
Log in

A Scatter Search Algorithm for the Uncapacitated Facility Location Problem

  • Conference paper
  • First Online:
Intelligent Computing & Optimization (ICO 2021)

Part of the book series: Lecture Notes in Networks and Systems ((LNNS,volume 371))

Included in the following conference series:

Abstract

Facility Location Problems (FLP) are complex combinatorial optimization problems whose general goal is to locate a set of facilities that serve a particular set of customers with minimum cost. Being NP-Hard problems, using exact methods to solve large instances of these problems can be seriously compromised by the high computational times required to obtain the optimal solution. To overcome this difficulty, a significant number of heuristic algorithms of various types have been proposed with the aim of finding good quality solutions in reasonable computational times. We propose a Scatter Search approach to solve effectively the Uncapacitated Facility Location Problem (UFLP). The algorithm was tested on the standard testbed for the UFLP obtained state-of-the-art results. Comparisons with current best-performing algorithms for the UFLP show that our algorithm exhibits excellent performance.

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 149.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 199.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. Michel, L., Hentenryck, P.V.: A simple tabu search for warehouse location. Eur. J. Oper. Res. 157, 576–591 (2004)

    Article  MathSciNet  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  3. 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 

  4. Glover, F.: Tabu search—part I. ORSA J. Comput. 1, 190–206 (1989)

    Article  Google Scholar 

  5. Glover, F.: Tabu search—part II. ORSA J. Comput. 2, 4–32 (1990)

    Article  Google Scholar 

  6. Pullan, W.: A population based hybrid meta-heuristic for the uncapacitated facility location problem. In: Proceedings of the first ACM/SIGEVO Summit on Genetic and Evolutionary Computation - GEC 2009, p. 475. ACM Press, New York (2009)

    Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Atta, S., Mahapatra, P.R.S., Mukhopadhyay, A.: Solving uncapacitated facility location problem using monkey algorithm. In: Bhateja, V., Coello Coello, C.A., Satapathy, S.C., Pattnaik, P.K. (eds.) Intelligent Engineering Informatics. AISC, vol. 695, pp. 71–78. Springer, Singapore (2018). https://doi.org/10.1007/978-981-10-7566-7_8

    Chapter  Google Scholar 

  9. Kratica, J., Tošic, D.: Solving the simple plant location problem by genetic algorithm. RAIRO-Oper. Res. 35, 127–142 (2001)

    Article  MathSciNet  Google Scholar 

  10. Gen, M., Tsujimura, Y., Ishizaki, S.: Optimal design of a star-LAN using neural networks. Comput. Ind. Eng. 31, 855–859 (1996)

    Article  Google Scholar 

  11. Vaithyanathan, S., Burke, L., Magent, M.: Massively parallel analog tabu search using neural networks applied to simple plant location problems. Eur. J. Oper. Res. 93, 317–330 (1996)

    Article  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  13. Guignard, M.: A Lagrangean dual ascent algorithm for simple plant location problems. Eur. J. Oper. Res. 46, 73–83 (1988)

    Article  MathSciNet  Google Scholar 

  14. Laguna, M., Marti, R.: Scatter search: methodology and implementations in C. Oper. Res. Comput. Sci. Interfaces Ser. 24, 1–283 (2003)

    MATH  Google Scholar 

Download references

Acknowledgement

This work has been supported by national funds through FCT – Fundação para a Ciência e Tecnologia through project UIDB/04728/2020.

Author information

Authors and Affiliations

  1. CIICESI, Escola Superior de Tecnologia e Gestão, Politécnico do Porto, Porto, Portugal

    Telmo Matos

Authors
  1. Telmo Matos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Telmo Matos .

Editor information

Editors and Affiliations

  1. Faculty of Electrical & Electronic Engineering, MERLIN Research Centre, Ton Duc Thang University, Hồ Chí Minh City, Vietnam

    Pandian Vasant

  2. Faculty of Electrical Engineering and Computer Science, VŠB TU Ostrava, Ostrava-Poruba, Czech Republic

    Ivan Zelinka

  3. Faculty of Engineering Management, Poznan University of Technology, Poznan, Poland

    Gerhard-Wilhelm Weber

Rights and permissions

Reprints and permissions

Copyright information

© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Matos, T. (2022). A Scatter Search Algorithm for the Uncapacitated Facility Location Problem. In: Vasant, P., Zelinka, I., Weber, GW. (eds) Intelligent Computing & Optimization. ICO 2021. Lecture Notes in Networks and Systems, vol 371. Springer, Cham. https://doi.org/10.1007/978-3-030-93247-3_48

Download citation

Publish with us

Policies and ethics

Search

Navigation