论文标题
在两个阶段的交通分配模型中找到平衡
Finding equilibrium in two-stage traffic assignment model
论文作者
论文摘要
作者描述了一个两阶段的流量分配模型。它包含两个块。第一个块由用于计算对应（需求）矩阵的模型组成，而第二个块是流量分配模型。第一个模型使用运输成本矩阵计算对应关系的矩阵。它表征了从一个区域到另一个区域所需的运动量。第二个模型描述了对应矩阵指定的位移需求的确切需求是沿可能路径分布的。它根据NASH-WardRop平衡（每个驱动程序选择最短的路径）工作。知道沿路径的分布流量的方式，可以计算成本矩阵。在两个阶段模型中的平衡是这两个模型序列中的固定点。本文提出了一种减少发现均衡问题的问题的问题的方法。还提出了一种用于解决获得的优化问题的数值方法。为小镇进行了数值实验。
Authors describe a two-stage traffic assignment model. It contains of two blocks. The first block consists of model for calculating correspondence (demand) matrix, whereas the second block is a traffic assignment model. The first model calculates a matrix of correspondences using a matrix of transport costs. It characterizes the required volumes of movement from one area to another. The second model describes how exactly the needs for displacement, specified by the correspondence matrix, are distributed along the possible paths. It works on the basis of the Nash--Wardrop equilibrium (each driver chooses the shortest path). Knowing the ways of distribute flows along the paths, it is possible to calculate the cost matrix. Equilibrium in a two-stage model is a fixed point in the sequence of these two models. The article proposes a method of reducing the problem of finding the equilibrium to the problem of the convex non-smooth optimization. Also a numerical method for solving the obtained optimization problem is proposed. Numerical experiments were carried out for the small towns.
