The two-echelon stochastic multi-period capacitated location-routing problem

Given the emergence of two-echelon distribution systems in several practical contexts, this paper tackles, at the strategic level, a distribution network design problem under uncertainty. This problem is defined as the two-echelon stochastic multi-period capacitated location-routing problem (2E-SM-CLRP). It con-siders a network partitioned into two capacitated distribution echelons: each echelon involves a specific location-assignment-transportation schema that must cope with the future demand. It aims to decide the number and location of warehousing/storage platforms (WPs) and distribution/fulfillment platforms (DPs), and on the capacity allocated from first echelon to second echelon platforms. In the second ech-elon, the goal is to construct vehicle routes that visit ship-to locations (SLs) from operating distribution platforms under a stochastic and time-varying demand and varying costs. This problem is modeled as a two-stage stochastic program with integer recourse, where the first-stage includes location and capacity decisions to be fixed at each period over the planning horizon, while routing decisions of the second echelon are determined in the recourse problem. We propose a logic-based Benders decomposition ap-proach to solve this model. In the proposed approach, the location and capacity decisions are taken by solving the Benders master problem. After these first-stage decisions are fixed, the resulting sub-problem is a capacitated vehicle-routing problem with capacitated multiple depots (CVRP-CMD) that is solved by a branch-cut-and-price algorithm. Computational experiments show that instances of realistic size can be solved optimally within a reasonable time and provide relevant managerial insights on the impact of the stochastic and multi-period settings on the 2E-CLRP.(c) 2022 Elsevier B.V. All rights reserved.