摘要
Log it方法是一种重要的非平衡交通分配方法,但由于需要路径枚举,限制了它在大型路网上的应用。本文提出了一种新的路径生成式Log it交通分配算法。每次迭代中,利用Log it方法在已产生的路径集上进行交通分配,并更新路段交通量及路段运行时间,然后在此基础上利用最短路算法求出新的最短路并更新路径集,如此交替进行,直至不再产生新的最短路,最后完成交通分配。由于不需进行路径枚举,从而使本算法适用于大型路网的交通分配。实际计算表明,该算法是有效和可行的。
This paper presents a novel path-generating Logit traffic assignment algorithm. In each iteration, this algorithm assigns O-D traffic demand to the generated paths set up to now by Logit method and updates links traffic volume as well as links traveling time correspondingly, then generates shortest path according to current links traveling time. Traffic assignment is finished until no new path can be generated. As this algorithm avoids paths enumeration ,so it is suitable for applying to large ,scale road network. Numerical examples show that it is effective and efficient.
出处
《系统工程》
CSCD
北大核心
2006年第2期41-45,共5页
Systems Engineering
基金
国家自然科学基金数学天元基金资助项目(A0224017)
关键词
Logit分配算法
最短路算法
多路径变通分配
交通分配
Logit Assignment Model
Shortest Path Algorithm
Multi-path Traffic Assignment
Traffic Assignment
