Risk-averse two-stage stochastic programming for the inventory rebalancing of bike-sharing systems

被引:2
作者
Walker, Awnalisa [1 ]
Kwon, Soongeol [2 ]
机构
[1] Binghamton Univ, Dept Syst Sci & Ind Engn, Binghamton, NY 13902 USA
[2] Yonsei Univ, Dept Ind Engn, Seoul 03722, South Korea
关键词
transportation; bike-sharing systems; inventory rebalancing; risk-averse two-stage stochastic programming; conditional value at risk; STATIC REPOSITIONING PROBLEM; ALGORITHM; OPTIMIZATION; RELOCATION; VEHICLES;
D O I
10.1111/itor.13388
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
As the popularity and usage of bike-sharing systems increase, a better decision-making model tailored for the successful operations of bike-sharing systems is needed. This study is motivated to address operator-based inventory rebalancing of bike-sharing systems, and the main objective is to develop a mathematical optimization model designed to derive an optimal daily inventory rebalancing plan. Specifically, this study proposes a risk-averse two-stage stochastic programming to determine optimal initial inventory levels for each station to minimize operational costs for relocating bikes and expected penalty costs due to unmet requests. This study adopts the conditional value at risk to properly measure the risk associated with unmet requests to implement risk-averse stochastic programming. Numerical experiments are conducted based on scenario data generated by empirical distributions fitted to trip data from the Houston BCycle to validate and evaluate the proposed model. The results show that the proposed model can be successfully applied to inventory rebalancing to improve the usability of bike-sharing systems.
引用
收藏
页码:749 / 779
页数:31
相关论文
共 42 条
[1]   Risk-averse two-stage stochastic programs in furniture plants [J].
Alem, Douglas ;
Morabito, Reinaldo .
OR SPECTRUM, 2013, 35 (04) :773-806
[2]   Designing a User Participation-Based Bike Rebalancing Service [J].
Ban, Seonghoon ;
Hyun, Kyung Hoon .
SUSTAINABILITY, 2019, 11 (08)
[3]   Partitioning procedures for solving mixed-variables programming problems [J].
Benders, J. F. .
COMPUTATIONAL MANAGEMENT SCIENCE, 2005, 2 (01) :3-19
[4]  
Birge JR, 2011, SPRINGER SER OPER RE, P3, DOI 10.1007/978-1-4614-0237-4
[5]   Implementing Automatic Benders Decomposition in a Modern MIP Solver [J].
Bonami, Pierre ;
Salvagnin, Domenico ;
Tramontani, Andrea .
INTEGER PROGRAMMING AND COMBINATORIAL OPTIMIZATION, IPCO 2020, 2020, 12125 :78-90
[6]   Dynamic Lookahead Policies for Stochastic-Dynamic Inventory Routing in Bike Sharing Systems [J].
Brinkmann, Jan ;
Ulmer, Marlin W. ;
Mattfeld, Dirk C. .
COMPUTERS & OPERATIONS RESEARCH, 2019, 106 :260-279
[7]   The Static Bike Sharing Rebalancing Problem with Forbidden Temporary Operations [J].
Bruck, Bruno P. ;
Cruz, Fabio ;
Iori, Manuel ;
Subramanian, Anand .
TRANSPORTATION SCIENCE, 2019, 53 (03) :882-896
[8]   The static bike relocation problem with multiple vehicles and visits [J].
Bulhoes, Teobaldo ;
Subramanian, Anand ;
Erdogan, Gunes ;
Laporte, Gilbert .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2018, 264 (02) :508-523
[9]  
Calafiore Giuseppe C., 2017, 2017 IEEE 56th Annual Conference on Decision and Control (CDC), P5684, DOI 10.1109/CDC.2017.8264517
[10]  
Citi Bike, 2019, CIT BIK MONTHL OP RE