论文部分内容阅读
为求解用户均衡交通分配问题,提出了一种可以避免穷举网络中的所有路径的路径交通量求解方法。该方法是基于路段算法的扩展,利用改进的F rankW o lfe算法求解出满足用户均衡规则的基于终点的路段交通量,并通过最短路算法确定出此时交通网络中各个OD(orig in destination)对间的最短路集合,再运用所确定出的路段交通量及最短路集构造出一组满足用户均衡规则的路径交通量。通过算例说明了该方法的有效性,并通过比较分析说明了该方法所需计算内存比其他算法要少,且计算速度要快。
In order to solve the problem of balanced traffic assignment for users, a method to solve the problem of traffic volume is proposed, which can avoid all paths in exhaustive networks. This method is based on the extension of link algorithm, and uses the improved F rankWolfe algorithm to solve the terminal-based traffic volume that satisfies the user equilibrium rule. At the same time, the OD (orig in destination) Pairs of the shortest path set, and then use the determined traffic volume and the shortest path set constructed a group to meet the user equilibrium rules of the path traffic. An example is given to illustrate the effectiveness of the method. The comparative analysis shows that the method requires less memory than other algorithms and can be calculated faster.