Author
Abstract
This work is motivated by free-floating car-sharing systems. In these systems, free-floating cars share public parking space with a much larger number of private cars. We propose an adapted model, which also includes free-floating car reservations. The service area is divided into N zones. The capacity of each zone is the number of parking spaces of the public space, also of order N. In the model, $$M_N \sim sN$$ M N ∼ s N type 1 particles, move between N sites whose dynamics also depend on a random environment. The environment is made up of numerous other particles which enter and leave each site independently. The environment and the type 1 particles interact due to the finite capacity CN of each site. The main feature of the model is that, at each site, the environment evolves on a faster timescale than the type 1 particles. It yields that, in the limit, a site behaves as a M/M/CN/CN loss queue, disturbed by a small number of type 1 particles. A phase transition is obtained between an underloaded regime where the type 1 particles can enter a site with probability 1 and an overloaded regime where a type 1 particle cannot enter a site with some positive probability depending on the parameters of the environment. We prove an averaging principle in a large-scale system. In the overloaded regime, when the system becomes large, the limiting stationary number of empty slots and the limiting stationary number of type 1 particles are independent, with geometric distributions whose parameters have explicit expressions. It is used to show that the operator can increase the size of the car-sharing fleet without reducing the number of available public parking spaces, even if they are scarce. As a result, a dimensioning problem concerning the optimal fleet size is solved: the more shared cars, the better the system.
Suggested Citation
Christine Fricker & Hanene Mohamed & Alessia Rigonat, 2025.
"Stochastic averaging and mean-field for a large system with fast varying environment with applications to free-floating car-sharing,"
Queueing Systems: Theory and Applications, Springer, vol. 109(4), pages 1-35, December.
Handle:
RePEc:spr:queues:v:109:y:2025:i:4:d:10.1007_s11134-025-09953-2
DOI: 10.1007/s11134-025-09953-2
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:queues:v:109:y:2025:i:4:d:10.1007_s11134-025-09953-2. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.