首页> 外文期刊>Transportation Research Part B: Methodological >Multiclass dynamic system optimum solution for mixed traffic of human-driven and automated vehicles considering physical queues
【24h】

Multiclass dynamic system optimum solution for mixed traffic of human-driven and automated vehicles considering physical queues

机译:考虑物理队列的人机和自动化车辆混合交通的多款动态系统最佳解决方案

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

摘要

Dynamic traffic assignment (DTA) is an important method in the long term transportation planning and management processes. However, in most existing system optimum dynamic traffic assignment (SO-DTA), no side constraints are used to describe the dynamic link capacities in a network which is shared by multiple vehicle types. Our motivation is based on the possibility for dynamic system optimum (DSO) to have multiple solutions, which differ in where queues are formed and dissipated in the network. To this end, this paper proposes a novel DSO formulation for the multi-class DTA problem containing both human driven and automated vehicles in single origin-destination networks. The proposed method uses the concept of link based approach to develop a multi-class DTA model that equally distributes the total physical queues over the links while considering explicitly the variations in capacity and backward wave speeds due to class proportions. In the model, the DSO is formulated as an optimization problem considering linear vehicle composition constraints representing the dynamics of the link capacities. Numerical examples are set up to provide some insights into the effects of automated vehicles on the queue distribution as well as the total system travel times. (C) 2021 Elsevier Ltd. All rights reserved.
机译:动态流量分配(DTA)是长期运输规划和管理流程中的一个重要方法。然而,在大多数现有的系统最佳动态流量分配(SO-DTA)中,没有侧约束用于描述由多个车辆类型共享的网络中的动态链路容量。我们的动机基于动态系统的可能性最佳(DSO)具有多种解决方案,其在网络中形成和消散的位置不同。为此,本文提出了一种用于多级DTA问题的新型DSO配方,其中单一原点目的地网络中的人机驱动和自动车辆。所提出的方法使用基于链路的方法的概念来开发多级DTA模型,该模型同样地分布链路上的总物理队列,同时考虑到由于类比例而明确地考虑容量和后向波速度的变化。在模型中,考虑表示表示链路容量的动态的线性车辆组成约束,将DSO配制成优化问题。建立了数值例子,以提供一些对自动车辆对队列分配的影响以及总系统旅行时间的洞察。 (c)2021 elestvier有限公司保留所有权利。

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号