Bike sharing systems via birth-death process and simulation modelling

10 pages•Published: March 21, 2024

Lena Wallwork, Uchechukwu Obinwanne and Wenying Feng

Abstract

In this paper, we present a simulation study for a bike-sharing network. The model is analyzed with the Birth-Death process as well as a multidimensional Markov queueing system. We evaluate the steady-state probability of running out of docking stations or bikes. The results provide guidelines for the setup of the network with optimized system efficiency.

Keyphrases: bike sharing system, birth death process, markov network, simulation

In: Ajay Bandi, Mohammad Hossain and Ying Jin (editors). Proceedings of 39th International Conference on Computers and Their Applications, vol 98, pages 179-188.

Links:	https://easychair.org/publications/paper/bLdp
	https://doi.org/10.29007/zx61

BibTeX entry

@inproceedings{CATA2024:Bike_sharing_systems_via,
  author    = {Lena Wallwork and Uchechukwu Obinwanne and Wenying Feng},
  title     = {Bike sharing systems via birth-death process and simulation modelling},
  booktitle = {Proceedings of 39th International Conference on Computers and Their Applications},
  editor    = {Ajay Bandi and Mohammad Hossain and Ying Jin},
  series    = {EPiC Series in Computing},
  volume    = {98},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/bLdp},
  doi       = {10.29007/zx61},
  pages     = {179-188},
  year      = {2024}}

Download PDF Open PDF in browser