...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>EURO journal of transportation and logistics >Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity
【24h】

Incentives and redistribution in homogeneous bike-sharing systems with stations of finite capacity

机译：具有有限容量站点的同类自行车共享系统中的激励和重新分配

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Bike-sharing systems are becoming important for urban transportation. In these systems, users arrive at a station, pick up a bike, use it for a while, and 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 the randomness of user 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 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 for 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.
机译：自行车共享系统对于城市交通变得越来越重要。在这些系统中，用户到达一个车站，拿起自行车，使用一段时间，然后将其返回到他们选择的另一个车站。每个站点的容量都是有限的：它不能容纳超过其容量的自行车。我们提出了同质自行车共享系统的随机模型，并研究了用户选择的随机性对有问题的站点（即在给定时间没有可用的自行车或没有可用的自行车停放点的站点）数量的影响。返回。我们量化了站点容量的影响，并计算了最小化有问题站点比例方面最佳的机队规模。即使在同质的城市中，系统的性能也很差：问题站点的最小比例约为容量的倒数。我们显示出简单的激励措施，例如建议用户返回两个站点中负载最小的站点，将这种情况以指数方式改善。对于给定的服务质量，我们还计算了卡车必须重新分配自行车的费率。该速率约为站容量的倒数。对于所有考虑的情况，与最佳性能相对应的车队规模是点总数的一半加上更多点，可以根据系统参数以封闭形式计算更多点的值。它对应于循环中自行车的平均数量。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号