A supervised learning-driven heuristic for solving the facility location and production planning problem

In this study, we propose a supervised learning-driven (SLD) heuristic to solve the capacitated facility location and production planning (CFLPP) problem. Using the solution values derived from linear programming relaxation, Dantzig–Wolfe decomposition, and column generation as features, the SLD heuristic uses a supervised learning approach (i.e., naïve Bayes) to derive an offline-learned oracle on the optimal solution patterns. The oracle and the incumbent feasible solution obtained by a time-oriented decomposition method (i.e., relax-and-fix) are then used to guide a sampling procedure to iteratively create numerous smaller-sized subproblems, which are solved by the relax-and-fix method to gradually improve the solution for the CFLPP problem. Computational results show that the SLD heuristic achieves better solution qualities than the commercial CPLEX solver and several state-of-the-art methods.