Analysis of first-come-first-served mechanisms in one-way car-sharing services

The principle of first-come-first-served (FCFS) has been widely adopted in the deploy-ment of car-sharing services (CSS) to manage service requests for the sake of equity. Most studies of CSS do not explicitly model the supply-demand interactions of shared cars, espe-cially when supply insufficiency arises. This study formulates the supply-demand dynamics of one-way CSS under different FCFS mechanisms and embeds them in a boundedly ratio-nal dynamic user equilibrium (BR-DUE) problem. Two disaggregate FCFS mechanisms are suggested to improve the utilization of shared cars given the same CSS supplies in the discrete-time domain. To accurately capture the choice of CSS in space and time, a path expansion strategy is proposed to cope with different waiting times under the disaggre-gate FCFS mechanisms. The path expansion strategy congruently bridges the aggregate-disaggregate analyses and is incorporated in an adaptive column generation algorithm to solve the BR-DUE problem in a bi-modal supernetwork. Numerical examples demonstrate that the FCFS mechanisms have a significant influence on the supply-demand dynamics and choice of CSS. (c) 2021 The Author(s). Published by Elsevier Ltd. This is an open access article under the CC BY license ( http://creativecommons.org/licenses/by/4.0/ )

Automated summary

The study investigates the use of different FCFS mechanisms in car-sharing services to improve the utilization of shared cars, and introduces a path expansion strategy to address varying wait times.