Route swapping in dynamic traffic networks
Route swapping in dynamic traffic networks
复制标题
DOI：
10.1016/j.trb.2010.05.005
复制
发表时间：
2011
影响因子：
6.8
通讯作者：
R. Mounce;M. Carey
中科院分区：
文献类型：
--
作者：
R. Mounce;M. Carey
动态交通分配(DTA)模型通常由交通性能模型和路径选择模型组成。交通性能模型描述了交通如何(随时间)沿着连接始发地-目的地(OD)对的路线传播，例如信元传输模型、垂直排队模型和行程时间模型。这是在动态网络加载(DNL)算法中实现的，该算法使用给定的路线流入来计算链路流入(并因此计算链路成本)，然后使用这些流量来计算路线行进时间(并因此计算路线成本)。路由交换流程根据今天(当前迭代)的路由流指定明天(在下一迭代)的路由流。可以通过在DNL算法和路线交换过程之间迭代来寻求动态用户平衡(DUE)，其中网络上的每个旅行者不能通过切换到另一条路线来降低他或她的旅行成本。路由交换过程本身只占用很少的计算时间(尽管对于大型网络来说，路由集生成可能需要非常密集的计算)。然而，路由交换过程的选择对收敛和收敛速度有很大影响。在假设路径代价向量是路径流入向量的单调函数的情况下，详细描述了几种路径交换过程，并考虑了它们是否会导致系统收敛。
A dynamic traffic assignment (DTA) model typically consists of a traffic performance model and a route choice model. The traffic performance model describes how traffic propagates (over time) along routes connecting origin–destination (OD) pairs, examples being the cell transmission model, the vertical queueing model and the travel time model. This is implemented in a dynamic network loading (DNL) algorithm, which uses the given route inflows to compute the link inflows (and hence link costs), which are then used to compute the route travel times (and hence route costs). A route swap process specifies the route inflows for tomorrow (at the next iteration) based on the route inflows today (at the current iteration). A dynamic user equilibrium (DUE), where each traveller on the network cannot reduce his or her cost of travel by switching to another route, can be sought by iterating between the DNL algorithm and the route swap process. The route swap process itself takes up very little computational time (although route set generation can be very computationally intensive for large networks). However, the choice of route swap process dramatically affects convergence and the speed of convergence. The paper details several route swap processes and considers whether they lead to a convergent system, assuming that the route cost vector is a monotone function of the route inflow vector.