TY - JOUR
T1 - A crowdsourced dynamic repositioning strategy for public bike sharing systems
AU - Wang, I. Lin
AU - Hou, Chen Tai
N1 - Publisher Copyright:
© 2022, American Institute of Mathematical Sciences. All rights reserved.
PY - 2022/3
Y1 - 2022/3
N2 - Public bike sharing systems have become the most popular shared economy application in transportation. The convenience of this system depends on the availability of bikes and empty racks. One of the major challenges in operating a bike sharing system is the repositioning of bikes between rental sites to maintain sufficient bike inventory in each station at all times. Most systems hire trucks to conduct dynamic repositioning of bikes among rental sites. We have analyzed a commonly used repositioning scheme and have demonstrated its ineffectiveness. To realize a higher quality of service, we proposed a crowdsourced dynamic repositioning strategy: first, we analyzed the historical rental data via the random forest algorithm and identified important factors for demand forecasting. Second, considering 30-minute periods, we calculated the optimal bike inventory via integer programming for each rental site in each time period with a sufficient crowd for repositioning bikes. Then, we proposed a minimum cost network flow model in a time-space network for calculating the optimal voluntary rider flows for each period based on the current bike inventory, which is adjusted according to the forecasted demands. The results of computational experiments on real-world data demonstrate that our crowd-sourced repositioning strategy may reduce unmet rental demands by more than 30% during rush hours compared to conventional trucks.
AB - Public bike sharing systems have become the most popular shared economy application in transportation. The convenience of this system depends on the availability of bikes and empty racks. One of the major challenges in operating a bike sharing system is the repositioning of bikes between rental sites to maintain sufficient bike inventory in each station at all times. Most systems hire trucks to conduct dynamic repositioning of bikes among rental sites. We have analyzed a commonly used repositioning scheme and have demonstrated its ineffectiveness. To realize a higher quality of service, we proposed a crowdsourced dynamic repositioning strategy: first, we analyzed the historical rental data via the random forest algorithm and identified important factors for demand forecasting. Second, considering 30-minute periods, we calculated the optimal bike inventory via integer programming for each rental site in each time period with a sufficient crowd for repositioning bikes. Then, we proposed a minimum cost network flow model in a time-space network for calculating the optimal voluntary rider flows for each period based on the current bike inventory, which is adjusted according to the forecasted demands. The results of computational experiments on real-world data demonstrate that our crowd-sourced repositioning strategy may reduce unmet rental demands by more than 30% during rush hours compared to conventional trucks.
UR - http://www.scopus.com/inward/record.url?scp=85121977389&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85121977389&partnerID=8YFLogxK
U2 - 10.3934/naco.2021049
DO - 10.3934/naco.2021049
M3 - Article
AN - SCOPUS:85121977389
SN - 2155-3289
VL - 12
SP - 31
EP - 46
JO - Numerical Algebra, Control and Optimization
JF - Numerical Algebra, Control and Optimization
IS - 1
ER -