Dynamic Intra-Cell Repositioning in Free-Floating Bike-Sharing Systems Using Approximate Dynamic Programming

Xue Luo (), Li Li (), Lei Zhao () and Jianfeng Lin ()
Additional contact information
Xue Luo: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Li Li: Department of Automation, Tsinghua University, Beijing 100084, China
Lei Zhao: Department of Industrial Engineering, Tsinghua University, Beijing 100084, China
Jianfeng Lin: Riding Artificial Intelligence Team, Meituan, Beijing 100102, China

Transportation Science, 2022, vol. 56, issue 4, 799-826

Abstract: In bike-sharing systems, the spatiotemporal imbalance of bike flows leads to shortages of bikes at some locations and overages at some others, depending on the time of the day, resulting in user dissatisfaction. Repositioning needs to be performed timely to deal with the spatiotemporal imbalance and to meet user demand in time. In this paper, we study the dynamic intra-cell repositioning of bikes by a single mover in free-floating bike-sharing systems. Considering that users can drop off bikes almost anywhere in free-floating systems, we study the simultaneous reposition of bikes among gathering points and collection of bikes scattered along the paths between gathering points under stochastic demands at both the gathering points and along the paths. We formulate the problem as a Markov decision process (MDP), design a policy function approximation (PFA) algorithm, and apply the optimal computing budget allocation method (OCBA) to search for the optimal policy parameters. We perform a comprehensive numerical study using test instances constructed based on the real data set of a major free-floating bike-sharing company in China, which demonstrates the outperformance of the proposed PFA policy against the benchmark policies and the practical implications on the value of repositioning and the impact of bike scatteredness.

Keywords: free-floating bike-sharing systems; spatiotemporal imbalance; dynamic repositioning; bike scatteredness; approximate dynamic programming (search for similar items in EconPapers)
Date: 2022
References: Add references at CitEc
Citations:

Downloads: (external link)
http://dx.doi.org/10.1287/trsc.2021.1122 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:ortrsc:v:56:y:2022:i:4:p:799-826

Access Statistics for this article

More articles in Transportation Science from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().