The principle of “first-come-first-served” (FCFS) has been widely adopted in the deployment 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, especially 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 rational 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 disaggregate 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.

为了公平起见，在汽车共享服务（CSS）的部署中广泛采用了“先到先服务”（FCFS）的原则来管理服务请求。大多数关于CSS的研究都没有明确地模拟共享汽车的供需交互，特别是在出现供不应求的情况下。这项研究制定了不同FCFS机制下单向CSS的供求动态，并将它们嵌入到有限理性的动态用户均衡（BR-DUE）问题中。建议使用两种分解的FCFS机制来提高共享汽车的利用率，因为在离散时域中使用相同的CSS供给。为了准确地捕获时空上CSS的选择，提出了一种路径扩展策略，以在分解FCFS机制下应对不同的等待时间。路径扩展策略一致地桥接了聚集-分解分析，并被合并到自适应列生成算法中，以解决双峰超级网络中的BR-DUE问题。数值例子表明，FCFS机制对供求动态和CSS的选择有重大影响。