Approximation of Queues in Bike-Sharing Systems With Finite Docks

Xiang PENG; Jingyan  WANG; Yong ZHANG

doi:10.7307/ptt.v37i2.752

Authors

Xiang PENG Soochow University, Business School
Jingyan WANG Suzhou Gusu District Natural Resources Planning and Research Centre
Yong ZHANG Soochow University, School of Rail Transportation

DOI:

https://doi.org/10.7307/ptt.v37i2.752

Keywords:

finite-docked bike-sharing system, throughput rate, approximation algorithm, closed queueing network

Abstract

This paper presents a closed queuing network model to address bike queues in bike-sharing systems with finite docks. The model tackles issues of bike spillover and user attrition due to fully occupied docks and bike shortages at stations. The objective is to determine throughput rates and other performance metrics for these systems. To overcome computational challenges, we propose an approximation algorithm based on the developed model. Our analysis reveals intrinsic properties of bike-sharing systems with finite docks: (i) The effective system throughput rate increases with bike fleet size and eventually converges to a ceiling value. (ii) Adding more docks at stations can unnecessarily increase or even decrease the effective throughput rate. (iii) Under certain conditions, the system can reach a self-balancing state, avoiding bike surpluses or deficiencies at each station and maximising throughput. (iv) Users can successfully return bikes with a limited number of tries, provided there is at least one station on their route with a non-zero probability of having available docks. A small-scale artificial example and a case study demonstrate the accuracy and applicability of the approximation algorithm and the properties of the systems.

References

Meddin R, DeMiao P. The bike-sharing world map. 2022. URL https://www.metrobike.net/

Fricker C, Gast N. Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. EURO J. Transport. Logist. 2016;5(3):261-291. DOI: 10.1007/s13676-014-0053-5.

Laporte G, Meunier F, Calvo RW. Shared mobility systems: an updated survey. Ann. Oper. Res. 2018;271(1):105-126. DOI: 10.1007/s10479-018-3076-8.

Capital Bikeshare. Capital Bikeshare member survey report, 2014.

Sohn K. Multi-objective optimization of a road diet network design. Transport. Res. A. 2011;45(6):499-511. DOI: 10.1016/j.tra.2011.03.005.

Lin JJ, Yu CJ. A bikeway network design model for urban areas. Transport. 2013;40(1):1-24. DOI: 10.1007/s11116-012-9409-6.

Liu HX, Szeto WY, Long JC. Bike network design problem with a path-size logit-based equilibrium constraint: Formulation, global optimization, and matheuristic. Transport. Res. E: Logist. Transport. Rev. 2019;127(7):284-307. DOI: 10.1016/j.tre.2019.05.010.

Hyland M, Hong Z, de Farias Pinto HKR, Chen Y. Hybrid cluster-regression approach to model bikeshare station usage. Transport. Res. A. 2018;115:71-89. DOI: 10.1016/j.tra.2017.11.009.

Celebi DY, Rüsün A, Işik H. Bike sharing system design with capacity allocations. Transport. Res. B. 2018;114:86-98. DOI: 10.1016/j.trb.2018.05.018.

Mix R, Hurtubia R, Raveau S. Optimal location of bike-sharing stations: A built environment and accessibility approach. Transport. Res. A. 2022;160:126-142. DOI: 10.1016/j.tra.2022.03.022.

Shu J, et al. Models for effective deployment and redistribution of bikes within public bike-sharing systems. Oper. Res. 2013;61(6):1346-1359. DOI: 10.1287/opre.2013.1215.

Fu CY, et al. Bike-sharing inventory management for market expansion. Transport. Res. B. 2022;162:28-54. DOI: 10.1016/j.trb.2022.05.009.

Gammelli D, et al. Predictive and prescriptive performance of bike-sharing demand forecasts for inventory management. Transp. Res. C. 2022;138:103571. DOI: 10.1016/j.trc.2022.103571.

Xu C, et al. Investigating spatial interdependence in e-bike choice using spatially autoregressive model. Promet – Traffic&Transportation. 2017;29(4):351-362. DOI: 10.7307/ptt.v29i4.2144.

Haider Z, Nikolaev A, Kang JE, Kwon C. Inventory rebalancing through pricing in public bike sharing systems. Eur. J. Oper. Res. 2018;270(1):103-117. DOI: 10.1016/j.ejor.2018.02.053.

Zhang S, et al. Dynamic demand forecast and assignment model for bike-and-ride system. Promet – Traffic & Transportation. 2019;31(6):621-632. DOI: 10.7307/ptt.v31i6.3197.

Jaber A, Csonka B. How do land use, built environment and transportation facilities affect bike-sharing trip destinations? Promet – Traffic&Transportation. 2023;35(1):119-132. DOI: 10.7307/ptt.v35i1.67.

Shui CS, Szeto WY. Dynamic green bike repositioning problem–A hybrid rolling horizon artificial bee colony algorithm approach. Transport. Res. D. 2018;60:119-136. DOI: 10.1016/j.trd.2017.06.023.

Huang D, et al. A static bike repositioning model in a hub-and-spoke network framework. Transport. Res. E. 2020;141(9):102031. DOI: 10.1016/j.tre.2020.102031.

Neumann-Saavedra BA, Mattfeld DC. Hewitt M. Assessing the operational impact of tactical planning models for bike-sharing redistribution. Transport. Res. A. 2021;150:216-235. DOI: 10.1016/j.tra.2021.06.003.

Lv C, et al. A two-echelon fuzzy clustering based heuristic for large-scale bike sharing repositioning problem. Transport. Res. B. 2022;160:54-75. DOI: 10.1016/j.trb.2022.04.003.

Shui CS, Szeto WY. A review of bike-sharing service planning problems. Transport. Res. C. 2020;117:102648. DOI: 10.1016/j.trc.2020.102648.

George DK, Xia CH. Fleet-sizing and service availability for a vehicle rental system via closed queueing networks. Eur. J. Oper. Res. 2011;211(1):198-207. DOI: 10.1016/j.ejor.2010.12.015.

Li QL, Fan RN, Qian ZY. A nonlinear solution to closed queueing networks for bike sharing systems with Markovian arrival processes and under an irreducible path graph. 12th International Conference on Queueing Theory and Network Applications. 2017;118-140. DOI: 10.1007/978-3-319-68520-5_8.

Bolch G, Greiner S, de Meer H, Trivedi KS. Queueing networks and Markov chains: Modeling and performance evaluation with computer science applications. John Wiley & Sons. 2006.

Vishkaei B, et al. Balancing public bike sharing system using inventory critical levels in queuing network. Comput. Ind. Eng. 2020;141:106277.1-106277.10. DOI: 10.1016/j.cie.2020.106277.

Ross SM. Introduction to probability models. Amsterdam; Boston, Academic Press. 2010.

Reiser M, Lavenberg SS. Mean-value analysis of closed multi-chain queuing networks. J. Acm. 1980;27(2):313-322. DOI: 10.1145/322186.322195.

Jiang L. On scheduling model and algorithm of urban public bike system, Lanzhou: Lanzhou Jiaotong University. 2017.