Solving Capacitated Facility Location Problem Using Lagrangian Decomposition and Volume Algorithm

Abstract EN

In this research, we will focus on one variant of the problem: the capacitated facility location problem (CFLP).

In many formulations of the CFLP, it is assumed that each demand point can be supplied by only one open facility, which is the simplest case of the problem.

We consider the case where each demand point can be supplied by more than one open facility.

We first investigate a Lagrangian relaxation approach.

Then, we illustrate in the problem decomposition how to introduce tighter constraints, which solve the CFLP faster while achieving a better quality solution as well.

At the same time, we apply the volume algorithm to improve both the lower and the upper bound on the optimum solution of the original problem for the large problem size.