路径(计算)
快速通道
集合(抽象数据类型)
算法
流量(数学)
数学优化
最短路径问题
约束最短路径优先
还原(数学)
方案(数学)
计算机科学
流量网络
投影(关系代数)
流量(计算机网络)
数学
K最短路径路由
理论计算机科学
几何学
计算机网络
图形
数学分析
程序设计语言
作者
A Chen,R. Jayakrishnan
摘要
In the network traffic assignment problem, it is generally believed that the minimum number of paths defining an equilibrium solution can be obtained by repeatedly equilibrating the set paths generated thus far in each iteration before creating new ones in the column generation phase. This scheme aims to minimize the number of shortest path calculations by only bringing in paths with greater potential to cause a reduction in the objective and at the same time retaining the existing paths in the path set. Using the path-based gradient projection (GP) algorithm, the restricted path equilibrium scheme was tested in two flow update policies: all-at-once and one-at-a-time. Discussed is also the applicability of implementing other known traffic assignment algorithms with these two flow update policies. The GP works well with the one-at-a-time flow update for both large and small networks without the need to employ the restricted path equilibration scheme.
科研通智能强力驱动
Strongly Powered by AbleSci AI