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

被引:23
|
作者
Ben Mohamed, Imen [1 ,4 ]
Klibi, Walid [2 ]
Sadykov, Ruslan [3 ,4 ]
Sen, Halil [5 ]
Vanderbeck, Francois [3 ,4 ,6 ]
机构
[1] Emlyon Business Sch, AIM Res Ctr Quantitat Methods Business Quant, Ecully, France
[2] Kedge Business Sch, Ctr Excellence Supply Chain CESIT, Bordeaux, France
[3] Univ Bordeaux, Math Inst Bordeaux IMB, Bordeaux, France
[4] RealOpt, Inna Bordeaux Sud Ouest, Bordeaux, France
[5] Mapotempo, Bordeaux, France
[6] Atoptima, Bordeaux, France
关键词
Supply chain management; Two-echelon distribution; Location-routing; Stochastic and multi-period settings; Benders decomposition; CHAIN NETWORK DESIGN; FACILITY LOCATION; EXACT ALGORITHM; VEHICLE; MODELS; DELIVERY; POINTS; BRANCH; BOUNDS; LEVEL;
D O I
10.1016/j.ejor.2022.07.022
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
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.
引用
收藏
页码:645 / 667
页数:23
相关论文
共 50 条
  • [41] Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem
    Fernando Afonso Santos
    Alexandre Salles da Cunha
    Geraldo Robson Mateus
    Optimization Letters, 2013, 7 : 1537 - 1547
  • [42] Branch-and-price algorithms for the Two-Echelon Capacitated Vehicle Routing Problem
    Santos, Fernando Afonso
    da Cunha, Alexandre Salles
    Mateus, Geraldo Robson
    OPTIMIZATION LETTERS, 2013, 7 (07) : 1537 - 1547
  • [43] A GRASPxELS approach for the capacitated location-routing problem
    Duhamel, Christophe
    Lacomme, Philippe
    Prins, Christian
    Prodhon, Caroline
    COMPUTERS & OPERATIONS RESEARCH, 2010, 37 (11) : 1912 - 1923
  • [44] A Multi-Start Evolutionary Local Search for the Two-Echelon Location Routing Problem
    Nguyen, Viet-Phuong
    Prins, Christian
    Prodhon, Caroline
    HYBRID METAHEURISTICS, 2010, 6373 : 88 - 102
  • [45] A Memetic Algorithm for the Capacitated Location-Routing Problem
    Kechmane, Laila
    Nsiri, Benayad
    Baalal, Azeddine
    INTERNATIONAL JOURNAL OF ADVANCED COMPUTER SCIENCE AND APPLICATIONS, 2016, 7 (06) : 219 - 226
  • [46] An Exact Method for the Capacitated Location-Routing Problem
    Baldacci, Roberto
    Mingozzi, Aristide
    Calvo, Roberto Wolfler
    OPERATIONS RESEARCH, 2011, 59 (05) : 1284 - 1296
  • [47] Artificial bee colony algorithm with variable neighborhood search and path relinking for two-echelon location-routing problem
    Chen, Jiu-Mei
    Zeng, Bo
    Jisuanji Jicheng Zhizao Xitong/Computer Integrated Manufacturing Systems, CIMS, 2014, 20 (05): : 1228 - 1236
  • [48] A Sustainable Multimodal Transport System: The Two-Echelon Location-Routing Problem with Consolidation in the Euro-China Expressway
    Lu, Yue
    Lang, Maoxiang
    Yu, Xueqiao
    Li, Shiqi
    SUSTAINABILITY, 2019, 11 (19)
  • [49] Heuristic algorithms for the capacitated location-routing problem and the multi-depot vehicle routing problem
    Escobar, John Willmer
    4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2014, 12 (01): : 99 - 100
  • [50] A two-phase heurist algorithm for the capacitated location-routing problem
    Zhen, Tong
    Zhang, Qiuwen
    Journal of Information and Computational Science, 2009, 6 (04): : 1823 - 1830