An improved cut-and-solve algorithm for the single-source capacitated facility location problem

  • Sune Lauth Gadegaard
  • Andreas Klose
  • Lars Relund Nielsen
Original Paper

Abstract

In this paper, we present an improved cut-and-solve algorithm for the single-source capacitated facility location problem. The algorithm consists of three phases. The first phase strengthens the integer program by a cutting plane algorithm to obtain a tight lower bound. The second phase uses a two-level local branching heuristic to find an upper bound, and if optimality has not yet been established, the third phase uses the cut-and-solve framework to close the optimality gap. Extensive computational results are reported, showing that the proposed algorithm runs 10–80 times faster on average compared to state-of-the-art problem-specific algorithms.

Keywords

Facility location Capacitated facility location Single-sourcing Cutting planes Local branching Cut-and-solve 

Mathematics Subject Classification

90-08 90C10 90C11 90B80 

Notes

Acknowledgements

The authors are grateful to Mr. Zhen Yang for providing the code, enabling us to compare the two algorithms, and to Professor Kim Allan Andersen for insightful comments and suggestions.

References

  1. Ahuja R, Orlin J, Pallottino S, Scaparra M, Scutellà M (2004) A multi-exchange heuristic for the single-source capacitated facility location problem. Manag Sci 50(6):749–760CrossRefGoogle Scholar
  2. Avella P, Boccia M, Salerno S (2011) A computational study of dicut reformulation for the single source capacitated facility location problem. Stud Inf Univ 9(3):21–42Google Scholar
  3. Balas E, Zemel E (1978) Facets of the knapsack polytope from minimal covers. SIAM J Appl Math 34(1):119–148CrossRefGoogle Scholar
  4. Barceló J, Casanovas J (1984) A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur J Oper Res 15(2):212–226CrossRefGoogle Scholar
  5. Barceló J, Fernández E, Jörnsten K (1991) Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem. Eur J Oper Res 53(1):38–45CrossRefGoogle Scholar
  6. Barceló J, Hallefjord Å, Fernández E, Jörnsten K (1990) Lagrangean relaxation and constraint generation procedures for capacitated plant location problems with single sourcing. Oper Res Spektrum 12(2):79–88CrossRefGoogle Scholar
  7. Bitran G, Chandru V, Sempolinski D, Shapiro J (1981) Inverse optimization: an application to the capacitated plant location problem. Manag Sci 27(10):1120–1141CrossRefGoogle Scholar
  8. Boccia M, Sforza A, Sterle C, Vasilyev I (2008) A cut and branch approach for the capacitated p-median problem based on Fenchel cutting planes. J Math Modell Algorithms 7(1):43–58CrossRefGoogle Scholar
  9. Boyd EA (1993) Generating Fenchel cutting planes for Knapsack polyhedra. SIAM J Optim 3(4):734–750CrossRefGoogle Scholar
  10. Ceselli A, Righini G (2005) A branch-and-price algorithm for the capacitated p-median problem. Networks 45(3):125–142CrossRefGoogle Scholar
  11. Chen C, Ting C (2008) Combining Lagrangian heuristic and ant colony system to solve the single source capacitated facility location problem. Transp Res Part E Logist Transp Rev 44(6):1099–1122CrossRefGoogle Scholar
  12. Climer S, Zhang W (2006) Cut-and-solve: an iterative search strategy for combinatorial optimization problems. Artif Intell 170(8):714–738CrossRefGoogle Scholar
  13. Contreras I, Díaz J (2008) Scatter search for the single source capacitated facility location problem. Ann Oper Res 157(1):73–89CrossRefGoogle Scholar
  14. Cornuejols G, Sridharan R, Thizy J (1991) A comparison of heuristics and relaxations for the capacitated plant location problem. Eur J Oper Res 50(3):280–297CrossRefGoogle Scholar
  15. Correia I, Gouveia L, Saldanha-da Gama L (2010) Discretized formulations for capacitated location problems with modular distribution costs. Eur J Oper Res 204(2):237–244CrossRefGoogle Scholar
  16. Díaz J, Fernández E (2002) A branch-and-price algorithm for the single source capacitated plant location problem. J Oper Res Soc 53:728–740CrossRefGoogle Scholar
  17. Fischetti M, Lodi A (2003) Local branching. Math Progr 98(1–3):23–47CrossRefGoogle Scholar
  18. Fischetti M, Polo C, Scantamburlo M (2004) A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem. Networks 44(2):61–72CrossRefGoogle Scholar
  19. Gadegaard S, Klose A, Nielsen L (2016) A “cut-and-solve” solver for the single source capacitated facility location problem. GitHub, source code (v1.2.0). https://github.com/SuneGadegaard/SSCFLPsolver
  20. Geoffrion A (1974) Lagrangean relaxation for integer programming. In: Approaches to integer programming. Vol. 2 of Mathematical Programming Studies. Springer, Berlin, pp 82–114Google Scholar
  21. Gu Z, Nemhauser G, Savelsbergh M (1998) Lifted cover inequalities for 0–1 integer programs: computation. INFORMS J Comput 10(4):427–437CrossRefGoogle Scholar
  22. Holmberg K, Rönnqvist M, Yuan D (1999) An exact algorithm for the capacitated facility location problems with single sourcing. Eur J Oper Res 113(3):544–559CrossRefGoogle Scholar
  23. Kaparis K, Letchford A (2010) Separation algorithms for 0–1 knapsack polytopes. Math Progr 124(1–2):69–91CrossRefGoogle Scholar
  24. Karp R (1972) Reducibility among combinatorial problems. In: Miller R, Thatcher J, Bohlinger J (eds) Complexity of computer computations., The IBM research symposia seriesSpringer, Berlin, pp 85–103CrossRefGoogle Scholar
  25. Klincewicz J, Luss H (1986) A Lagrangian relaxation heuristic for capacitated facility location with single-source constraints. J Oper Res Soc 37:495–500CrossRefGoogle Scholar
  26. Klose A, Görtz S (2007) A branch-and-price algorithm for the capacitated facility location problem. Eur J Oper Res 179(3):1109–1125CrossRefGoogle Scholar
  27. Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0–1 knapsack problem. Manag Sci 45(3):414–424CrossRefGoogle Scholar
  28. Neebe A, Rao M (1983) An algorithm for the fixed-charge assigning users to sources problem. J Oper Res Soc 34:1107–1113CrossRefGoogle Scholar
  29. Nemhauser G, Wolsey L (1988) Integer and combinatorial optimization. Wiley, New YorkCrossRefGoogle Scholar
  30. Pirkul H (1987) Efficient algorithms for the capacitated concentrator location problem. Comput Oper Res 14(3):197–208CrossRefGoogle Scholar
  31. Rönnqvist M, Tragantalerngsak S, Holt J (1999) A repeated matching heuristic for the single-source capacitated facility location problem. Eur J Oper Res 116(1):51–68CrossRefGoogle Scholar
  32. Sridharan R (1993) A Lagrangian heuristic for the capacitated plant location problem with single source constraints. Eur J Oper Res 66(3):305–312CrossRefGoogle Scholar
  33. Weismantel R (1997) On the 0/1 knapsack polytope. Math Progr 77(3):49–68CrossRefGoogle Scholar
  34. Yang Z, Chu F, Chen H (2012) A cut-and-solve based algorithm for the single-source capacitated facility location problem. Eur J Oper Res 221(3):521–532CrossRefGoogle Scholar

Copyright information

© EURO - The Association of European Operational Research Societies 2017

Authors and Affiliations

  1. 1.Department of Economics and Business Economics, School of Business and Social SciencesAarhus UniversityAarhus VDenmark
  2. 2.Department of Mathematics, Science and TechnologyAarhus UniversityAarhus CDenmark

Personalised recommendations