.png){kind=icon}
返回
Reduced gradient algorithm for user equilibrium traffic assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1080/23249935.2020.1722279.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A path-based algorithm is developed for the static traffic assignment problem (TAP). In each iteration, it decomposes the problem into origin-destination (OD) pairs and solves each subproblem separately using the Wolfe reduced gradient (RG) method. This method reduces the dimensions of each single-OD subproblem by selecting a basic path between the OD pair and reformulating the subproblem in terms of the nonbasic paths. A column generation technique is included to avoid path enumeration in large scale networks. Also, some speed-up techniques are designed to improve the computational efficiency. The algorithm shifts flows from costlier paths to cheaper paths; however, the amount of flow shifted from a costlier path is proportional to not only the travel time but also the flow on the path. It is applied to the Philadelphia and Chicago test problems, while different strategies for choosing the basic paths are examined. The RG algorithm shows an excellent convergence to relative gaps of the order of 1.0E-14 when compared against several reference TAP algorithms.
Keyword:
Traffic assignment problem
reduced gradient method
path-based algorithm
large scale network
期刊
IF:
3.1
论文数:
939
被引数:
2.2K
机构
引用论文
.png){kind=icon}
分享收藏
查看更多内容