A decomposition approach for facility location and relocation problem with uncertain number of future facilities

In this paper, we discuss two challenges of long term facility location problem that occur simultaneously; future demand change and uncertain number of future facilities. We introduce a mathematical model that minimizes the initial and expected future weighted travel distance of customers. Our model allows relocation for the future instances by closing some of the facilities that were located initially and opening new ones, without exceeding a given budget. We present an integer programming formulation of the problem and develop a decomposition algorithm that can produce near optimal solutions in a fast manner. We compare the performance of our mathematical model against another method adapted from the literature and perform sensitivity analysis. We present numerical results that compare the performance of the proposed decomposition algorithm against the exact algorithm for the problem.

► Present an IP model that considers uncertainty in future demand and facility locations. ► Developed a decomposition algorithm that can produce solutions in a fast manner. ► Numerical results to show a significant time gain of our method over the exact approach.