Origin-Based Algorithm for the Traffic Assignment Problem
Origin-Based Algorithm for the Traffic Assignment Problem
复制标题
DOI：
10.1287/trsc.36.4.398.549
复制
发表时间：
2002-11
期刊：
影响因子：
--
通讯作者：
H. Bar-Gera
中科院分区：
文献类型：
--
作者：
H. Bar-Gera
我们提出了一个基于原点的算法的流量分配问题，这是类似于Gallager和Bertsekas提出的算法在电信网络中的路由。除了是基于原点的，该算法是不同的，从其他算法使用到目前为止的交通分配问题的限制，非循环的解决方案，并通过使用的方法比例作为解决方案的变量。投影拟牛顿搜索方向被用来有效地转移流和消除残留流。实验结果表明，该算法具有良好的收敛性能，特别是在需要高精度解的情况下。合理的内存需求使该算法适用于大规模网络。由此产生的解决方案具有即时的路线流解释，从而提供与基于路线的解决方案等效的细节。
We present an origin-based algorithm for the traffic assignment problem, which is similar conceptually to the algorithm proposed by Gallager and Bertsekas for routing in telecommunication networks. Apart from being origin-based, the algorithm is different from other algorithms used so far for the traffic assignment problem by its restriction to acyclic solutions and by the use of approach proportions as solution variables. Projected quasi-Newton search directions are used to shift flows effectively and to eliminate residual flows. Experimental results comparing the proposed algorithm with the state-of-the-practice algorithm of Frankand Wolfe demonstrate the algorithm's excellent convergence performance, especially when highly accurate solutions are needed. Reasonable memory requirements make this algorithm applicable to large-scale networks. The resulting solution has an immediate route flow interpretation, thus providing equivalent detail to route-based solutions.