首页> 外文期刊>Transportation research >A linear program for optimal integration of shared autonomous vehicles with public transit
【24h】

A linear program for optimal integration of shared autonomous vehicles with public transit

机译:线性计划,可实现共享自动驾驶汽车与公共交通的最佳整合

获取原文
获取原文并翻译 | 示例
           

摘要

Use of shared autonomous vehicles (SAVs) for last-mile transportation can improve transit use and reduce road congestion. We investigate the problem of optimal integration of SAVs with transit. By optimal, we mean that transit should be used instead of or to complement SAVs only when it reduces the total system travel time. Although greater use of transit reduces congestion, transit often increases travel time due to frequent stops and transfers. By using a continuous approximation to passenger and vehicle movements, we formulate the problem as a linear program using the link transmission model for traffic flow. One of the main challenges is associating passenger movement with vehicles that can have different destinations (e.g. a transit stop). Although the mathematical program is linear, it nevertheless has a large number of variables. We find a suboptimal solution using a rolling horizon method, which greatly reduces the required computation time. We also demonstrate an example of a possibly unfair passenger-to-vehicle ordering, and propose a first-come-first-served greedy algorithm to match passengers. A suite of experimental results on the Sioux Falls network show that using transit decreases total system travel time, especially when SAV fleet sizes are small. Transit also decreases the time travelers spend waiting, but tends to increase in-vehicle travel time. The methodology could be useful both for future SAV operators and for planners seeking to predict the effects of SAVs on traffic congestion.
机译:在最后一英里的运输中使用共享自动驾驶汽车(SAV)可以改善运输使用并减少道路拥堵。我们调查了SAV与运输的最佳整合问题。最佳而言,我们的意思是仅在减少总系统行驶时间时才应使用运输代替或补充SAV。尽管更多地使用大众运输减少了交通拥堵,但由于频繁的停靠和换乘,大众运输通常会增加旅行时间。通过使用乘客和车辆运动的连续逼近,我们使用交通流量的链路传输模型将问题表达为线性程序。主要挑战之一是将乘客出行与可能有不同目的地(例如中转站)的车辆相关联。尽管数学程序是线性的,但它仍然具有大量变量。我们发现使用滚动水平方法的次优解决方案,这大大减少了所需的计算时间。我们还演示了一个可能的乘客到车辆订购不公平的示例,并提出了先到先得的贪婪算法来匹配乘客。苏福尔斯(Sioux Falls)网络上的一组实验结果表明,使用运输减少了系统的总行驶时间,尤其是在SAV机队规模较小的情况下。过境还可以减少旅行者等待的时间,但往往会增加车载旅行时间。该方法对于将来的SAV运营商和寻求预测SAV对交通拥堵的影响的计划者都可能有用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号