基于终点的路径交通量求解方法

为求解用户均衡交通分配问题,提出了一种可以避免穷举网络中的所有路径的路径交通量求解方法。该方法是基于路段算法的扩展,利用改进的F rankW o lfe算法求解出满足用户均衡规则的基于终点的路段交通量,并通过最短路算法确定出此时交通网络中各个OD(orig in destination)对间的最短路集合,再运用所确定出的路段交通量及最短路集构造出一组满足用户均衡规则的路径交通量。通过算例说明了该方法的有效性,并通过比较分析说明了该方法所需计算内存比其他算法要少,且计算速度要快。

Destination-based approach for routing traffic flows in traffic assignment problems

An extension of the link-based algorithm for the user equilibrium traffic assignment problem(TAP) was developed which avoids explicit route enumeration of the traffic networks.The approach first determines the destination-based link traffic flows for the user equilibrium TAP and the shortest-path set for each OD(Origin-Destination) pair which are then used to construct a group of route traffic flows.The analysis shows that the routed traffic flows thus obtained form a solution for the user equilibrium TAP.Comparison of numerical results between the present approach and some existing algorithms shows that the current approach has improved computation speeds and memory requirements.