[论文解读] Incentives and regulations in bike-sharing systems with stations of finite capacity

Christine Fricker, Nicolas Gast|arXiv (Cornell University)|Jan 5, 2012

Urban Transport and Accessibility被引用 26

一句话总结

本文提出了一种针对有限容量站点的共享单车系统的随机模型，用于分析存在问题的站点（即缺少自行车或停靠位的站点）。研究表明，即使在同质化城市中，存在问题站点的最小比例也与站点容量成反比，但通过简单的激励措施（如建议用户将自行车停放到两个站点中负载最少的一个）可使性能提升一个指数因子。

ABSTRACT

Bike-sharing systems are becoming important for urban transportation. In such systems, users arrive at a station, take a bike and use it for a while, then return it to another station of their choice. Each station has a finite capacity: it cannot host more bikes than its capacity. We propose a stochastic model of an homogeneous bike-sharing system and study the effect of users random choices on the number of problematic stations, i.e., stations that, at a given time, have no bikes available or no available spots for bikes to be returned to. We quantify the influence of the station capacities, and we compute the fleet size that is optimal in terms of minimizing the proportion of problematic stations. Even in a homogeneous city, the system exhibits a poor performance: the minimal proportion of problematic stations is of the order of (but not lower than) the inverse of the capacity. We show that simple incentives, such as suggesting users to return to the least loaded station among two stations, improve the situation by an exponential factor. We also compute the rate at which bikes have to be redistributed by trucks to insure a given quality of service. This rate is of the order of the inverse of the station capacity. For all cases considered, the fleet size that corresponds to the best performance is half of the total number of spots plus a few more, the value of the few more can be computed in closed-form as a function of the system parameters. It corresponds to the average number of bikes in circulation.

研究动机与目标

• 建立用户随机选择对有限容量站点共享单车系统中站点可用性影响的模型。
• 量化在用户随机行为下，存在问题站点（无自行车或无停靠位）的最小比例。
• 确定使存在问题站点比例最小化的最优车队规模。
• 评估用户激励措施在减少系统失衡方面的有效性。
• 计算为维持服务品质所需的卡车再分配率。

提出的方法

• 使用同质共享单车系统的随机模型，模拟用户到达、自行车使用和还车行为。
• 将站点建模为具有用户随机选择取车和还车位置的有限容量队列。
• 利用稳态概率分析系统性能，计算存在问题站点的比例。
• 引入一种简单的激励机制：建议用户将自行车还至两个站点中负载较轻的一个。
• 推导出最优车队规模的闭式表达式，其值约为总停靠位数的一半，外加一个较小的修正项。
• 计算所需卡车再分配率，其值与站点容量成反比。

实验结果

研究问题

• RQ1 在具有有限容量站点的同质化共享单车系统中，存在问题站点的最小可实现比例是多少？
• RQ2 用户在还车选择上的随机性如何影响系统失衡和站点可用性？
• RQ3 简单的用户激励措施能在多大程度上减少存在问题的站点数量？
• RQ4 使存在问题站点比例最小化的最优车队规模是多少？
• RQ5 为维持给定的服务质量水平，所需的卡车再分配率是多少？

主要发现

• 存在问题站点的最小比例与站点容量的倒数同阶，且无法低于此界限。
• 简单的激励措施（如建议用户将自行车还至两个站点中负载最轻的一个）可使系统性能提升一个指数因子。
• 最优车队规模约为总停靠位数的一半，外加一个等于流通中自行车平均数量的修正项。
• 所需卡车再分配率与站点容量成反比，表明小容量站点需要更高的再分配频率。
• 即使在同质化城市中，由于用户随机选择带来的固有失衡，系统性能仍表现不佳，凸显了主动管理的必要性。