An improved cut-and-solve algorithm for the single-source capacitated facility location problem
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.
KeywordsFacility location Capacitated facility location Single-sourcing Cutting planes Local branching Cut-and-solve
Mathematics Subject Classification90-08 90C10 90C11 90B80
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.
- 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
- 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
- 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