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

TY - JOUR

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

AU - Gadegaard, Sune Lauth

AU - Klose, Andreas

AU - Nielsen, Lars Relund

PY - 2018

Y1 - 2018

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

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

KW - Capacitated facility location

KW - Cut-and-solve

KW - Cutting planes

KW - Facility location

KW - KNAPSACK POLYTOPE

KW - LAGRANGEAN RELAXATION

KW - Local branching

KW - OPTIMIZATION

KW - PRICE ALGORITHM

KW - SEARCH

KW - SOURCE CONSTRAINTS

KW - Single-sourcing

UR - https://www.scopus.com/pages/publications/85042286914

U2 - 10.1007/s13675-017-0084-4

DO - 10.1007/s13675-017-0084-4

M3 - Journal article

SN - 2192-4406

VL - 6

SP - 1

EP - 27

JO - EURO Journal on Computational Optimization

JF - EURO Journal on Computational Optimization

IS - 1

ER -