A robust rolling horizon framework for empty repositioning

被引:4
作者
Bakir, Ilke [1 ]
Erera, Alan [2 ]
Savelsbergh, Martin [2 ]
机构
[1] Univ Groningen, Fac Econ & Business, Dept Operat, Groningen, Netherlands
[2] Georgia Inst Technol, H Milton Stewart Sch Ind & Syst Engn, Atlanta, GA USA
关键词
Empty repositioning; Robust optimization; Time-expanded networks; Sharing group policies; DYNAMIC-PROGRAMMING ALGORITHM; FLEET MANAGEMENT; SPOKE NETWORK; OPTIMIZATION; ALLOCATION; MODEL; APPROXIMATION; SCALE; REDISTRIBUTION; UNCERTAINTY;
D O I
10.1016/j.trc.2022.103903
中图分类号
U [交通运输];
学科分类号
08 ; 0823 ;
摘要
Naturally imbalanced freight flows force transportation service providers to reposition empty resources. When constructing empty repositioning plans, the cost of repositioning empty resources needs to be weighed against the cost of corrective actions in case of unavailable resources. This is especially challenging given the uncertainty of future demand. We design and implement a robust rolling horizon framework for constructing effective empty repositioning plans. An extensive computational study demonstrates the benefits of explicitly accounting for uncertainty in future demand by using robust optimization, and pragmatically controlling the level of conservatism in hedging against this uncertainty. We also investigate practical strategies for reducing the complexity of managing the repositioning of empty resources in transportation service networks covering huge geographic areas.
引用
收藏
页数:22
相关论文
共 69 条
[1]   A Lagrangian heuristic and GRASP for the hub-and-spoke network system with economies-of-scale and congestion [J].
Alkaabneh, Faisal ;
Diabat, Ali ;
Elhedhli, Samir .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2019, 102 :249-273
[2]   A Network Partitioning Algorithmic Approach for Macroscopic Fundamental Diagram-Based Hierarchical Traffic Network Management [J].
An, Kang ;
Chiu, Yi-Chang ;
Hu, Xianbiao ;
Chen, Xiaohong .
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS, 2018, 19 (04) :1130-1139
[3]   Two-stage robust network row and design under demand uncertahty [J].
Atamtuerk, Alper ;
Zhang, Muhong .
OPERATIONS RESEARCH, 2007, 55 (04) :662-673
[4]   Improving the performance of rail yards through dynamic reassignments of empty cars [J].
Bektas, Tolga ;
Crainic, Teodor Gabriel ;
Morency, Vincent .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2009, 17 (03) :259-273
[5]   Robust convex optimization [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICS OF OPERATIONS RESEARCH, 1998, 23 (04) :769-805
[6]   Robust solutions of Linear Programming problems contaminated with uncertain data [J].
Ben-Tal, A ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2000, 88 (03) :411-424
[7]   Retailer-supplier flexible commitments contracts: A robust optimization approach [J].
Ben-Tal, Aharon ;
Golany, Boaz ;
Nemirovski, Arkadi ;
Vial, Jean-Philippe .
Manufacturing and Service Operations Management, 2005, 7 (03) :248-271
[8]   Adjustable robust solutions of uncertain linear programs [J].
Ben-Tal, A ;
Goryashko, A ;
Guslitzer, E ;
Nemirovski, A .
MATHEMATICAL PROGRAMMING, 2004, 99 (02) :351-376
[9]   A robust optimization approach to inventory theory [J].
Bertsimas, D ;
Thiele, A .
OPERATIONS RESEARCH, 2006, 54 (01) :150-168
[10]   The price of robustness [J].
Bertsimas, D ;
Sim, M .
OPERATIONS RESEARCH, 2004, 52 (01) :35-53