基于Frank-Wolfe算法的路径交通量求解方法

Solution for Route Traffic Flows Based on Frank-Wolfe Algorithm

针对用户均衡交通分配问题,提出一种可以避免穷举网络中的所有路径的基于Frank-W olfe算法的路径交通量求解方法。它在已知一组满足用户均衡规则的基于终点的路段交通量和交通网络中各个OD(origin destination)对间的最短路集合的前提下,运用一个算法确定出一组满足用户均衡规则的路径交通量。文中通过算例说明该方法是有效的,并通过比较指出该方法在存储内存、计算结果以及计算速度方面优于其他基于路径算法。

Facing the problem of user equilibrium traffic assignment, a solution for the route traffic flow based on the FrankWolfe algorithm was to avoid enumerating all routes of the network. Under the conditions that a group of destination-based link traffic flows satisfying the user equilibrium and the shortest-path set of each OD （origin-destination） pair of the traffic network were known, a group of user equilibrium path traffic flows can be figured out by the proposed algorithm, and it was proved effective by numerical example. Compared with other methods, the proposed method is superior in memory requirement, calculating results, and computational speed.