The Potential of Flexible Reservations in a Car Sharing System With an Auction Scheme
Mireia Roca-Riu, Monica Menendez
IEEE Access · 2019
doi:10.1109/access.2019.2948064 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
In the last 20 years car sharing has been a growing trend in personal mobility. Multiple aspects of these systems have been already discussed: different forms of car sharing, user’s preferences and behavior, or benefits estimation. Nevertheless, the management of these systems needs to be continuously improved to remain a competitive alternative. In this work, we propose a reservation scheme to manage rental reservations of a two-way station-based car sharing system. It allows the operator to better plan the necessary vehicles at each station, and encourages the drivers to make better use of the existing vehicles, by showing flexibility in the starting rental time. The reservation scheme is organized with an auction, where drivers bet for their preferred rental start time. Drivers participating in the auction are offered a reduced rental fare, which is then complemented with the reservation fee that results from the auction. The auction is solved under Vickrey-Clarke-Groves (VCG) mechanism for combinatorial auctions, which guarantees the desired properties for the operator and a fair assignment for the drivers. The proposed scheme is tested on instances inspired by the Mobility car sharing system in Zürich, Switzerland. The results show that operators could decrease their fleets with low to no impacts on the overall rental revenues, especially when drivers show flexibility in their rental start times. For certain levels of demand price elasticity, even positive impacts on the overall rental revenues can be expected. Moreover, reservation fees are proven to partially compensate for the decrease in rental revenues provided to the auction users.
Abstract licence: CC BY-NC-ND
References48
40 more references, whose wording the paper’s licence keeps private.
All 48 referencesReads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.