Skip to main content
SpringerLink
Log in

A Simple Dual-RAMP Algorithm for the Capacitated Facility Location Problem

  • Conference paper
  • First Online:
Book cover Learning and Intelligent Optimization (LION 2019)

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

Included in the following conference series:

Abstract

Facility Location embodies a class of problems concerned with locating a set of facilities to serve a geographically distributed population of customers at minimum cost. We address the classical Capacitated Facility Location Problem (CFLP) in which the assignment of facilities to customers must ensure enough facility capacity and all the customers must be served. This is a well-known NP-hard problem in combinatorial optimization that has been extensively studied in the literature. Due to the difficulty of the problem, significant research efforts have been devoted to developing advanced heuristic methods aimed at finding high-quality solutions in reasonable computational times. We propose a Relaxation Adaptive Memory Programming (RAMP) approach for the CFLP. Our method combines lagrangean subgradient search with an improvement method to explore primal-dual relationships to create advanced memory structures that integrate information from both primal and dual solution spaces. The algorithm was tested on the standard ORLIB dataset and on other very large-scale instances for the CFLP. Our approach efficiently found the optimal solution for all ORLIB instances and very competitive results for the large-scale ones. Comparisons with current best-performing algorithms for the CFLP show that our RAMP algorithm exhibits excellent results.

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 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Current, J., Daskin, M., Schilling, D.: Discrete Network Location Models. Springer-Verlag, Berlin (2001)

    MATH  Google Scholar 

  2. Jacobsen, S.K.: Heuristics for the capacitated plant location model. Eur. J. Oper. Res. 12, 253–261 (1983)

    Article  Google Scholar 

  3. Kuehn, A., Hamburger, M.: A heuristic program for locating warehouses. Manage. Sci. 9, 643–666 (1963)

    Article  Google Scholar 

  4. Cornuéjols, G., Sridharan, R., Thizy, J.: A comparison of heuristics and relaxations for the capacitated plant location problem. Eur. J. Oper. Res. 50, 280–297 (1991)

    Article  Google Scholar 

  5. Guignard, M., Spielberg, K.: A direct dual method for the mixed plant location problem with some side constraints. Math. Program. 17, 198–228 (1979)

    Article  MathSciNet  Google Scholar 

  6. Bilde, O., Krarup, J.: Sharp lower bounds and efficient algorithms for the simple plant location problem. In: Annals of Discrete Mathematics, pp. 79–97 (1977)

    Chapter  Google Scholar 

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

    Article  MathSciNet  Google Scholar 

  8. Avella, P., Boccia, M., Sforza, A., Vasil’ev, I.: An effective heuristic for large-scale capacitated facility location problems. J. Heuristics 15, 597–615 (2008)

    Article  Google Scholar 

  9. Lorena, L., Senne, E.: Improving traditional subgradient scheme for Lagrangean relaxation: an application to location problems. Int. J. Math. Algorithms 1, 133–151 (1999)

    MATH  Google Scholar 

  10. Beasley, J.E.: Lagrangean heuristics for location problems. Eur. J. Oper. Res. 65, 383–399 (1993)

    Article  Google Scholar 

  11. Sridharan, R.: The capacitated plant location problem. Eur. J. Oper. Res. 87, 203–213 (1995)

    Article  Google Scholar 

  12. Van Roy, T.: A cross decomposition algorithm for capacitated facility location. Eur. J. Oper. Res. 34, 145–163 (1986)

    Article  MathSciNet  Google Scholar 

  13. Bornstein, C.T.: An ADD/DROP procedure for the capacitated plant location problem. Pesqui. Operacional 24, 151–162 (2003)

    Article  Google Scholar 

  14. Bornstein, C.T.C., Azlan, H.H.B.: The use of reduction tests and simulated annealing for the capacitated plant location problem. Locat. Sci. 6, 67–81 (1998)

    Article  Google Scholar 

  15. Lai, M.-C., Sohn, H., Tseng, T.-L. (Bill), Chiang, C.: A hybrid algorithm for capacitated plant location problem. Expert Syst. Appl. 37 8599–8605 (2010)

    Article  Google Scholar 

  16. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numer. Math. 4, 238–252 (1962)

    Article  MathSciNet  Google Scholar 

  17. Sastry, K., Goldberg, D.E., Kendall, G.: Genetic algorithms. In: Search Methodologies, pp. 93–117. Springer US, Boston (2014)

    Google Scholar 

  18. Glover, F., Laguna, M.: Tabu Search (1997)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  20. Feo, T., Resende, M.: Greedy randomized adaptive search procedures. J. Glob. Optim. 134, 109–134 (1995)

    Article  MathSciNet  Google Scholar 

  21. Sun, M.: A tabu search heuristic procedure for the capacitated facility location problem. J. Heuristics 18, 91–118 (2012)

    Article  Google Scholar 

  22. Kennington, J.L., Helgason, R.V.: Algorithms for network programming. John Wiley & Sons Inc., New York (1980)

    MATH  Google Scholar 

  23. Ronaldo Silva, V.F.: Um Algoritmo GRASP Híbrido para o Problema de Localização Capacitada de Custo Fixo, (2007)

    Google Scholar 

  24. Guastaroba, G., Speranza, M.G.: Kernel search for the capacitated facility location problem. J. Heuristics 18, 877–917 (2012)

    Article  Google Scholar 

  25. Guastaroba, G., Speranza, M.G.: Kernel search: an application to the index tracking problem. Eur. J. Oper. Res. 217, 54–68 (2012)

    Article  MathSciNet  Google Scholar 

  26. Venables, H., Moscardini, A.: Ant based heuristics for the capacitated fixed charge location problem. In: Dorigo, M., Birattari, M., Blum, C., Clerc, M., Stützle, T., Winfield, A.F.T. (eds.) ANTS 2008. LNCS, vol. 5217, pp. 235–242. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-87527-7_22

    Chapter  Google Scholar 

  27. Levanova, T., Tkachuk, E.: Development of a bee colony optimization algorithm for the capacitated plant location problem. In: II International Conference Optimization and Applications (OPTIMA-2011), pp. 153–156, Petrovac, Montenegro (2011)

    Google Scholar 

  28. Cabrera, G., Cabrera, E., Soto, R., Rubio, L.J.M., Crawford, B., Paredes, F.: A hybrid approach using an artificial bee algorithm with mixed integer programming applied to a large-scale capacitated facility location problem. Math. Probl. Eng. 2012, 14 (2012)

    Article  Google Scholar 

  29. Rego, C.: RAMP: a new metaheuristic framework for combinatorial optimization. In: Rego, C., Alidaee, B. (eds.) Metaheuristic Optimization via Memory and Evolution: Tabu Search and Scatter Search, pp. 441–460. Kluwer Academic Publishers (2005)

    Google Scholar 

  30. Rego, C., Mathew, F., Glover, F.: RAMP for the capacitated minimum spanning tree problem. Ann. Oper. Res. 181, 661–681 (2010)

    Article  MathSciNet  Google Scholar 

  31. Gamboa, D.: Adaptive Memory Algorithms for the Solution of Large Scale Combinatorial Optimization Problems, Ph.D. Thesis (in Portuguese) (2008)

    Google Scholar 

  32. Matos, T., Gamboa, D.: Dual-RAMP for the capacitated single allocation hub location problem. In: Gervasi, O., et al. (eds.) ICCSA 2017, Part II. LNCS, vol. 10405, pp. 696–708. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-62395-5_48

    Chapter  Google Scholar 

  33. Matos, T., Maia, F., Gamboa, D.: Improving traditional dual ascent algorithm for the uncapacitated multiple allocation hub location problem: a RAMP approach. In: Nicosia, G., Pardalos, P., Giuffrida, G., Umeton, R., Sciacca, V. (eds.) LOD 2018. LNCS, vol. 11331, pp. 243–253. Springer, Cham (2019)

    Chapter  Google Scholar 

  34. Matos, T., Maia, F., Gamboa, D.: A simple dual-RAMP algorithm for the uncapacitated multiple allocation hub location problem. In: 18th International Conference on Hybrid Intelligent Systems (HIS 2018) in Portugal, 2018, pp. 331–339 (2020)

    Google Scholar 

  35. Daskin, M.M.S.: Network and Discrete Location: Models, Algorithms, and Applications. Wiley, New York (1995)

    Book  Google Scholar 

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

    Article  Google Scholar 

  37. Avella, P., Boccia, M.: A cutting plane algorithm for the capacitated facility location problem. Comput. Optim. Appl. 43, 39–65 (2009)

    Article  MathSciNet  Google Scholar 

  38. Beasley, J.E.: An algorithm for solving large capacitated warehouse location problems. Eur. J. Oper. Res. 33, 314–325 (1988)

    Article  MathSciNet  Google Scholar 

  39. Avella, P., Boccia, M., Sforza, A., Vasilev, I.: An effective heuristic for large-scale capacitated facility location problems - draft available from the authors upon request. J. Heuristics 15, 597–615 (2006)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CIICESI – Center for Research and Innovation in Business Sciences and Information Systems, School of Technology and Management, Polytechnic of Porto, Porto, Portugal

    Telmo Matos, Óscar Oliveira & Dorabela Gamboa

Authors
  1. Telmo Matos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Óscar Oliveira
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Dorabela Gamboa
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Telmo Matos , Óscar Oliveira or Dorabela Gamboa .

Editor information

Editors and Affiliations

  1. Technical University of Crete, Chania, Greece

    Nikolaos F. Matsatsinis

  2. Technical University of Crete, Chania, Greece

    Yannis Marinakis

  3. Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL, USA

    Panos Pardalos

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Matos, T., Oliveira, Ó., Gamboa, D. (2020). A Simple Dual-RAMP Algorithm for the Capacitated Facility Location Problem. In: Matsatsinis, N., Marinakis, Y., Pardalos, P. (eds) Learning and Intelligent Optimization. LION 2019. Lecture Notes in Computer Science(), vol 11968. Springer, Cham. https://doi.org/10.1007/978-3-030-38629-0_20

Download citation

Publish with us

Policies and ethics

Search

Navigation