首页> 外文期刊>Transportation research >Automated taxis' dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times
【24h】

Automated taxis' dial-a-ride problem with ride-sharing considering congestion-based dynamic travel times

机译:考虑基于拥堵的动态出行时间的共享出租车自动计程车问题

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

摘要

In this paper, we study the dial-a-ride problem of ride-sharing automated taxis (ATs) in an urban road network, considering the traffic congestion caused by the ATs. This shared automated mobility system is expected to provide a seamless door-to-door service for urban travellers, much like what the existing transportation network companies (TNC) do, but with decreased labour cost and more flexible relocation operations due to the vehicles' automation. We propose an integer non-linear programming (INLP) model that optimizes the routing of the ATs to maximize the system profit, depending on dynamic travel times, which are a non-linear function of the ATs' flows. It is important to involve traffic congestion in such a routing problem since for a growing number of ATs circulating in the city their number will lead to delays. The model is embedded within a rolling horizon framework, which divides a typical day into several horizons to deal with the real-time travel demand. In each horizon, the routing model is solved with the demand at that interval and assuring the continuity of the trips between horizons. Nevertheless, each horizon model is hard to solve given its number of constraints and decision variables. Therefore, we propose a solution approach based on a customized Lagrangian relaxation algorithm, which allows identifying a near-optimal solution for this difficult problem. Numerical experiments for the city of Delft, The Netherlands, are used to demonstrate the solution quality of the proposed algorithm as well as obtaining insights about the AT system performance. Results show that the solution algorithm can solve the proposed model for hard instances. Ride-sharing makes the AT system more capable to provide better service regarding delay time and the number of requests that can be attended by the system. The delay penalty on the profit objective function is an effective control parameter on guaranteeing the service quality while maintaining system profitability.
机译:在本文中,我们考虑了由自动驾驶出租车引起的交通拥堵情况,研究了城市道路网络中的自动驾驶出租车的自动拨号问题。这种共享的自动出行系统有望像现有的交通网络公司(TNC)一样为城市旅客提供无缝的门到门服务,但是由于车辆的自动化,劳动力成本降低了,搬迁操作更加灵活。我们提出了一种整数非线性规划(INLP)模型,该模型根据动态行程时间优化AT的路由,以最大化系统利润,动态行程时间是AT流量的非线性函数。将交通拥堵纳入此类路由问题非常重要,因为随着城市中越来越多的AT流通,它们的数量将导致延误。该模型嵌入滚动视野框架中,该框架将典型的一天分为几个视野,以处理实时旅行需求。在每个视域中,均以该间隔的需求求解路由模型,并确保视域之间的行程连续性。然而,鉴于其约束和决策变量的数量,每个水平模型都很难解决。因此,我们提出了一种基于自定义拉格朗日松弛算法的解决方案方法,该方法允许针对此难题确定近似最优的解决方案。在荷兰代尔夫特市进行​​的数值实验用于证明所提出算法的解决方案质量,并获得有关AT系统性能的见解。结果表明,该求解算法可以解决所提出的硬实例模型。拼车使AT系统在延迟时间和系统可以处理的请求数量方面更有能力提供更好的服务。利润目标函数的延迟惩罚是保证服务质量同时保持系统利润的有效控制参数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号