Geographic Decomposition of the Shortest Path Problem, with an Application to the Traffic Assignment Problem
提出一种适用于松散连接网络的最短路径问题地理分解算法，可应用于Frank-Wolfe算法求解交通分配问题。对华盛顿特区1287节点、3752弧的交通分配问题数值实验表明，该分解能降低计算机内存需求或程序运行时间。
An algorithm, which can be applied to loosely connected networks, is given for geographically decomposing the shortest path problem. The algorithm is applicable to the traffic assignment problem when it is solved as a series of shortest path problems by the Frank-Wolfe algorithm. Numerical results for a large 1287 node, 3752 arc traffic assignment problem for Washington, D.C., indicate that using geographical decomposition can reduce computer memory storage requirements or program run time.