首页> 外文期刊>Transportation Research Part B: Methodological >System-optimal dynamic traffic assignment with and without queue spillback: Its path-based formulation and solution via approximate path marginal cost
【24h】

System-optimal dynamic traffic assignment with and without queue spillback: Its path-based formulation and solution via approximate path marginal cost

机译:具有和不具有队列溢出功能的系统最优动态流量分配:通过近似路径边际成本的基于路径的公式化和解决方案

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

摘要

The knowledge of path marginal cost (PMC) is central to system-optimal dynamic traffic assignment (SO-DTA) problems. In this paper, we propose a method to approximate PMC in general networks when traffic dynamics are modeled by either the point-queue or the kinematic wave traffic flow model. This study examines in detail the flow interactions between downstream and upstream bottleneck links, and shows that the changes in cumulative flows on all the network links caused by an arbitrary flow perturbation can be computed. This offers a way to approximate PMC, which is incorporated in the solution of the least marginal cost problem, a central component of the path-based SO-DTA problem. The approximation scheme allows us to solve path-based SO-DTA problems for general networks with and without queue spillback and/or departure time choices. Numerical examples are provided to demonstrate the effectiveness of the proposed method, and the results show that the SO state produces considerably lower total network cost, shorter congestion duration, and smaller travel delay on bottleneck links than those of produced by the user-optimal state, particularly when the departure time choice is considered.
机译:路径边际成本(PMC)的知识对于系统最佳动态流量分配(SO-DTA)问题至关重要。在本文中,我们提出了一种在通过点排队或运动波交通流模型对交通动态进行建模时,通用网络中PMC的近似方法。这项研究详细研究了上游和下游瓶颈链路之间的流相互作用,并表明可以计算由任意流量扰动引起的所有网络链路上累积流量的变化。这提供了一种近似PMC的方法,该方法已合并到最小边际成本问题的解决方案中,这是基于路径的SO-DTA问题的核心部分。近似方案使我们能够解决带有和不带有队列溢出和/或出发时间选择的一般网络的基于路径的SO-DTA问题。数值实例证明了该方法的有效性,结果表明,与用户最优状态相比,SO状态产生的总网络成本低得多,拥塞持续时间更短,瓶颈链路的传输延迟更短,特别是在考虑出发时间选择时。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号