首页> 外文期刊>Transportation Research Procedia >Time Dependent Travel Speed Vehicle Routing and Scheduling on a Real Road Network: The Case of Torino
【24h】

Time Dependent Travel Speed Vehicle Routing and Scheduling on a Real Road Network: The Case of Torino

机译:真实道路网络上与时间有关的行车速度车辆调度与调度:以都灵为例

获取原文
           

摘要

Vehicle routing and scheduling play a crucial role in the distribution chain. Although this research area has been broadly studied in the literature, there is still a lack of models closely representing real life problems. Most of the models proposed address constant travel times between nodes, without taking into account rush hours traffic congestion. In real applications in urban contexts the increasing of travel times due to congestion effects cannot be neglected. Models dealing with time dependent travel times work with simplified step functions, discretizing the time horizon in small time intervals. Even if this approach is broadly used, assuming travel times varying with discrete jumps is a strong approximation of real world conditions which evolve continuously. Another strong approximation adopted in the literature is that travel time (or speed) is computed on direct links, while in the real world vehicles travels on a road network, in which Euclidean distances do not hold anymore. In this paper, a vehicle routing problem (VRP) on a real road network with time dependent travel speed expressed by a polynomial function is addressed. Despite the difficulty to work with these kind of function, in this way congestion evolution behavior may be more precisely represented. In real situations, it is common to face different congestion peaks during the day, each one of which generally has different characteristics. Morning peaks are very sharp, i.e. congestion level rapidly increase reaching its maximum value which last for a short time after what congestion rapidly decrease, while evening peaks are generally much more spread across a longer time period and congestion variations are much more smoothed. Step functions, commonly used in practice, cannot represent at all realistic situations and peaks; linear functions may acceptable represents sharp peaks but not wider once. Polynomials, indeed, are able to better describe each type of peak. An application on Torino road network is presented. Speed evolution laws on main arcs are computed basing on real data obtained from an analysis carried out on averaged travel speed measured by an electronic system with 5minutes intervals over two weeks. Small streets for which this data are not available are supposed to have a constant travel speed. Computational results show that taking advantage on the available information on different rush hour peaks intensity and spread on different arcs, it is possible to obtain better vehicle routing and scheduling plan.
机译:车辆的路线和调度在分销链中起着至关重要的作用。尽管该研究领域已在文献中进行了广泛的研究,但仍然缺少能代表现实生活问题的模型。提出的大多数模型都解决了节点之间的恒定旅行时间,而没有考虑高峰时间的交通拥堵。在城市环境中的实际应用中,不能忽略由于拥堵效应而导致的出行时间增加。处理与时间有关的旅行时间的模型具有简化的阶跃函数,可以在较小的时间间隔内离散时间范围。即使广泛使用此方法,假设旅行时间随离散跳变而变化,也可以很好地逼近不断变化的现实世界条件。文献中采用的另一个强有力的近似值是,行驶时间(或速度)是在直接链接上计算的,而在现实世界中,车辆是在道路网络上行驶的,其中欧几里得距离不再成立。在本文中,解决了具有多项式函数表示的随时间变化的行驶速度的真实道路网络上的车辆路径问题。尽管难以使用此类功能,但可以更精确地表示拥塞演变行为。在实际情况下,白天通常会遇到不同的拥堵高峰,每个高峰通常都有不同的特征。早晨的高峰非常尖锐,即拥塞水平迅速增加,达到最高值,并在拥挤迅速减少之后持续很短的时间,而晚上的高峰通常分布在更长的时间范围内,并且拥塞变化更加平滑。在实践中通常使用的阶跃函数不能代表所有现实情况和峰值。线性函数可以接受,代表尖峰,但一次不宽。实际上,多项式能够更好地描述每种类型的峰。介绍了在都灵公路网上的应用。主电弧上的速度演变定律是根据真实数据计算得出的,该真实数据是通过对电子系统在两周内间隔5分钟的平均行进速度进行分析而获得的。无法获得此数据的小街道应该具有恒定的行驶速度。计算结果表明,利用关于不同高峰时间强度和在不同弧线上分布的可用信息,可以获得更好的车辆路线和调度计划。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号