Mean field analysis for inhomogeneous bike sharing systems

Christine Fricker; Nicolas Gast; Hanene Mohamed

doi:10.46298/dmtcs.3006

Christine Fricker ; Nicolas Gast ; Hanene Mohamed - Mean field analysis for inhomogeneous bike sharing systems

dmtcs:3006 - Discrete Mathematics & Theoretical Computer Science, January 1, 2012, DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12) - https://doi.org/10.46298/dmtcs.3006

Mean field analysis for inhomogeneous bike sharing systemsArticle

Authors: Christine Fricker ¹; Nicolas Gast ^2,³; Hanene Mohamed ⁴

1 Networks, Algorithms and Probabilities
2 Middleware efficiently scalable
3 Ecole Polytechnique Fédérale de Lausanne
4 Modélisation aléatoire de Paris X

In the paper, bike sharing systems with stations having a finite capacity are studied as stochastic networks. The inhomogeneity is modeled by clusters. We use a mean field limit to compute the limiting stationary distribution of the number of bikes at the stations. This method is an alternative to analytical methods. It can be used even if a closed form expression for the stationary distribution is out of reach as illustrated on a variant. Both models are compared. A practical conclusion is that avoiding empty or full stations does not improve overall performance.

https://doi.org/10.46298/dmtcs.3006

Source: HAL:hal-01086055v1

Volume: DMTCS Proceedings vol. AQ, 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)

Section: Proceedings

Published on: January 1, 2012

Imported on: January 31, 2017

Keywords: [INFO.INFO-PF] Computer Science [cs]/Performance [cs.PF],[MATH.MATH-OC] Mathematics [math]/Optimization and Control [math.OC],[MATH.MATH-PR] Mathematics [math]/Probability [math.PR]

Licence: Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)

Bibliographic References

17 Documents citing this article

Giovanni Ceccarelli;Guido Cantelmo;Marialisa Nigro;Constantinos Antoniou, 2023, Learning from Imbalanced Datasets: The Bike-Sharing Inventory Problem Using Sparse Information, Algorithms, 16, 7, pp. 351, 10.3390/a16070351, https://doi.org/10.3390/a16070351.

Francisco Prieto-Castrillo;Rosa M. Benito;Javier Borondo, Studies in computational intelligence (Print), Understanding Imbalance Mechanisms in Shared Mobility Systems, pp. 757-768, 2022, 10.1007/978-3-030-93413-2_62.

Huthaifa I. Ashqar;Mohammed Elhenawy;Hesham A. Rakha;Leanna House, 2022, Quality of Service Measure for Bike Sharing Systems, Maryland Shared Open Access Repository (USMAI Consortium), 23, 9, pp. 15841-15849, 10.1109/tits.2022.3145669, http://hdl.handle.net/11603/26207.

William A. Massey;Emmanuel Ekwedike;Robert C. Hampshire;Jamol J. Pender, 2022, A transient symmetry analysis for the M/M/1/k queue, Queueing Systems, 103, 1-2, pp. 1-43, 10.1007/s11134-022-09849-5.

Héctor R. Gómez Márquez;Rafael López Bracho;Adrian Ramirez-Nafarrate, 2021, A simulation-optimization study of the inventory of a bike-sharing system: The case of Mexico City Ecobici’s system, Case Studies on Transport Policy, 9, 3, pp. 1059-1072, 10.1016/j.cstp.2021.01.014.

Quan-Lin Li;Rui-Na Fan, 2021, A mean-field matrix-analytic method for bike sharing systems under Markovian environment, arXiv (Cornell University), 309, 2, pp. 517-551, 10.1007/s10479-021-04140-x, https://arxiv.org/abs/1610.01302.

Shuang Tao;Jamol Pender, 2020, A STOCHASTIC ANALYSIS OF BIKE-SHARING SYSTEMS, arXiv (Cornell University), 35, 4, pp. 781-838, 10.1017/s0269964820000297, https://arxiv.org/abs/1708.08052.

Ahmed Abdelmoumene Kadri;Imed Kacem;Karim Labadi, 2018, Lower and upper bounds for scheduling multiple balancing vehicles in bicycle-sharing systems, Soft Computing, 23, 14, pp. 5945-5966, 10.1007/s00500-018-3258-y.

Xi Cheng;Yang Gao, 2018, The Optimal Monthly Strategy Pricing of Free-Floating Bike Sharing Platform, Modern economy (Online), 09, 02, pp. 318-338, 10.4236/me.2018.92021, https://doi.org/10.4236/me.2018.92021.

Cheng Feng;Jane Hillston;Daniël Reijsbergen, 2017, Moment-based availability prediction for bike-sharing systems, Edinburgh Research Explorer (University of Edinburgh), 117, pp. 58-74, 10.1016/j.peva.2017.09.004, http://hdl.handle.net/20.500.11820/f219e851-6d49-45e3-9393-924bb48dc571.

Christine Fricker;Danielle Tibi, 2017, Equivalence of ensembles for large vehicle-sharing models, arXiv (Cornell University), 27, 2, 10.1214/16-aap1219, https://arxiv.org/abs/1507.07792.

Quan-Lin Li;Rui-Na Fan;Zhi-Yong Qian, arXiv (Cornell University), A Nonlinear Solution to Closed Queueing Networks for Bike Sharing Systems with Markovian Arrival Processes and Under an Irreducible Path Graph, pp. 118-140, 2017, 10.1007/978-3-319-68520-5_8, https://arxiv.org/abs/1707.07551.

Ariel Waserhole;Vincent Jost, 2016, Pricing in vehicle sharing systems: optimization in queuing networks with product forms, EURO journal on transportation and logistics (Print), 5, 3, pp. 293-320, 10.1007/s13676-014-0054-4, https://doi.org/10.1007/s13676-014-0054-4.

Christine Fricker;Nicolas Gast, 2016, Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity, EURO Journal on Transportation and Logistics, 5, 3, pp. 261-291, 10.1007/s13676-014-0053-5, https://doi.org/10.1007/s13676-014-0053-5.

Christine Fricker;Nicolas Servel, 2015, Two-choice regulation in heterogeneous closed networks, arXiv (Cornell University), 82, 1-2, pp. 173-197, 10.1007/s11134-015-9465-7, https://arxiv.org/abs/1405.5997.

Joseph Y J Chow;Hamid Reza Sayarshad, 2014, Symbiotic network design strategies in the presence of coexisting transportation networks, Transportation research. Part B: methodological, 62, pp. 13-34, 10.1016/j.trb.2014.01.008.

Saralees Nadarajah;Vicente Garibay Cancho;Edwin M. M. Ortega, 2013, The geometric exponential Poisson distribution, Statistical Methods & Applications, 22, 3, pp. 355-380, 10.1007/s10260-013-0230-y.

Sources : OpenCitations, OpenAlex & Crossref

Share and export

Consultation statistics

This page has been seen 426 times.

This article's PDF has been downloaded 546 times.