Hostname: page-component-745bb68f8f-b95js Total loading time: 0 Render date: 2025-01-10T21:43:05.678Z Has data issue: false hasContentIssue false

Mean-field analysis of stochastic networks with reservation

Published online by Cambridge University Press:  06 January 2025

Christine Fricker*
Affiliation:
DI-ENS, CNRS, INRIA de Paris
Hanene Mohamed*
Affiliation:
MODAL’X, UMR CNRS 9023, UPL, Université Paris Nanterre
*
*Postal address: 48 rue Barrault, 75013 Paris, France. Email: christine.fricker@inria.fr
**Postal address: 200 avenue de la République, 92000 Nanterre, France. Email: hanene.mohamed@parisnanterre.fr

Abstract

The problem of reservation in a large distributed system is analyzed via a new mathematical model. The target application is car-sharing systems. This model is motivated by the large station-based car-sharing system in France called Autolib’. This system can be described as a closed stochastic network where the nodes are the stations and the customers are the cars. The user can reserve a car and a parking space. We study the evolution of the system when the reservation of parking spaces and cars is effective for all users. The asymptotic behavior of the underlying stochastic network is given when the number N of stations and the fleet size M increase at the same rate. The analysis involves a Markov process on a state space with dimension of order $N^2$. It is quite remarkable that the state process describing the evolution of the stations, whose dimension is of order N, converges in distribution, although not Markov, to a non-homogeneous Markov process. We prove this mean-field convergence. We also prove, using combinatorial arguments, that the mean-field limit has a unique equilibrium measure when the time between reserving and picking up the car is sufficiently small. This result extends the case where only the parking space can be reserved.

Type
Original Article
Copyright
© The Author(s), 2025. Published by Cambridge University Press on behalf of Applied Probability Trust

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Aghajani, R., Robert, P. and Sun, W. (2018). A large scale analysis of unreliable stochastic networks. Ann. Appl. Prob. 28, 851887.CrossRefGoogle Scholar
Baccelli, F., Foss, S. and Shneer, V. (2024). Migration–contagion processes. Adv. Appl. Prob. 56, b1b2.CrossRefGoogle Scholar
Billingsley, P. (1999). Convergence of Probability Measures, 2nd edn. John Wiley, New York.CrossRefGoogle Scholar
Boldrini, C., Bruno, R. and Conti, M. (2016). Characterising demand and usage patterns in a large station-based car sharing system. In Proc. 2016 IEEE Conf. Computer Communications Workshops, pp. 572577.CrossRefGoogle Scholar
Bourdais, C. and Fricker, C. (2015). A stochastic model for car-sharing systems. Preprint, arXiv:1504.03844.Google Scholar
Bourdais, C., Fricker, C. and Mohamed, H. (2020). A mean field analysis of a stochastic model for reservation in car-sharing systems. ACM SIGMETRICS Performance Evaluation Rev. 48, 1820.Google Scholar
Boyac, B., Zografos, K. G. and Geroliminis, N. (2015). An optimization framework for the development of efficient one-way car-sharing systems. Europ. J. Operat,. Res. 240, 718733.CrossRefGoogle Scholar
Deng, Y., Gupta, A. and Shroff, N. B. (2020). Fleet sizing and charger allocation in electric vehicle sharing systems. IFAC J. Syst. Control. 22, 100210.CrossRefGoogle Scholar
Fricker, C. and Gast, N. (2016). Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity. Euro J. Transportation Logistics 5, 261291.CrossRefGoogle Scholar
Fricker, C., Gast, N. and Mohamed, H. (2012). Mean field analysis for inhomogeneous bike sharing systems. Discrete Math. Theoret. Comp. Sci. 365376.Google Scholar
Fricker, C., Mohamed, H., Popescu, T. and Trépanier, M. (2021). Stochastic modelling of free-floating car-sharing systems. Research report, CIRRELT.Google Scholar
Fricker, C. and Tibi, D. (2017). Equivalence of ensembles for large vehicle-sharing models. Ann. Appl. Prob. 27, 883916,CrossRefGoogle Scholar
Gibbens, R. J., Hunt, P. J. and Kelly, F. P. (1990). Bistability in communication networks. Disorder Phys. Syst. 113128.Google Scholar
Graham, C. and Méléard, S. (1993). Propagation of chaos for a fully connected loss network with alternate routing. Stoch. Process. Appl. 44, 159180.CrossRefGoogle Scholar
Kaspi, M., Raviv, T. and Tzur, M. (2014). Parking reservation policies in one-way vehicle sharing systems. Transport. Res. B 62, 3550.CrossRefGoogle Scholar
Kaspi, M., Raviv, T., Tzur, M. and Galili, H. (2016). Regulating vehicle sharing systems through parking reservation policies: Analysis and performance bounds. Europ. J. Operat. Res. 251, 969987.CrossRefGoogle Scholar
Martirosyan, D. and Robert, P. (2020). The equilibrium states of large networks of Erlang queues. Adv. Appl. Prob. 52, 617654.CrossRefGoogle Scholar
Nourinejad, M., Zhu, S., Bahrami, S. and Roorda, M. J (2015). Vehicle relocation and staff rebalancing in one-way carsharing systems. Transport. Res. E 81, 98113.CrossRefGoogle Scholar
Robert, P. (2003). Stochastic Networks and Queues. Springer, New York.CrossRefGoogle Scholar
Sznitman, A.-S. (1991). Topics in propagation of chaos. In Ecole d’été de probabilités de Saint-Flour XIX-1989, 165–251.CrossRefGoogle Scholar
Waserhole, A. (2013). Vehicle sharing system pricing optimization. Doctoral thesis, Université Grenoble Alpes.Google Scholar
Wikipedia. Autolib’. Available at: https://en.wikipedia.org/wiki/Autolib.Google Scholar