.png){kind=icon}
返回
A heuristic algorithm for network equilibration
.png){kind=icon}
PRE
AI
DOI：10.1016/j.amc.2005.04.094.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, a heuristic algorithm, different from the Frank-Wolfe and its modified methods, is introduced for network equilibration. By using the column generation technique and the network equilibrium conditions, the new method need not enumerate initially all feasible paths for all origin/destination (O/D) pairs, but can give all paths used between each O/D pair and the path flows accordingly while the new algorithm obtains an optimal traffic assignment. Some convergence issues of the new method is discussed in this paper. Numerical experiments show that the new method is efficient and robust. (c) 2005 Elsevier Inc. All rights reserved.
Keyword:
equilibration algorithm
non-linear programming
traffic assignment
user-optimized problem
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
查看更多内容