| 一种新的路径生成式Logit交通分配算法 |
| |
| 引用本文： | 刘炳全,黄崇超.一种新的路径生成式Logit交通分配算法[J].系统工程,2006,24(2):41-45. |
| |
| 作者姓名： | 刘炳全 黄崇超 |
| |
| 作者单位： | 武汉大学,数学与统计学院,湖北,武汉,430072 |
| |
| 摘 要： | Logit方法是一种重要的非平衡交通分配方法，但由于需要路径枚举，限制了它在大型路网上的应用。本文提出了一种新的路径生成式Logit交通分配算法。每次迭代中，利用Logit方法在已产生的路径集上进行变通分配，并更新路段交通量度路段运行时间，然后在此基础上利用最短路算法求出新的最短路并更新路径集，如此变替进行．直至不再产生新的最短路，最后完成交通分配。由于不需进行路径枚举，从而使本算法适用于大型路网的交通分配。实际计算表明．该算法是有效和可行的。
|
| 关 键 词： | Logit分配算法 最短路算法 多路径交通分配 交通分配 |
| 文章编号： | 1001-4098（2006）02-0041-05 |
| 收稿时间： | 2005-11-25 |
| 修稿时间： | 2005-11-25 |
A Novel Path-generating Logit Traffic Assignment Algorithm |
| |
| LIU Bing-quan,HUANG Chong-chao.A Novel Path-generating Logit Traffic Assignment Algorithm[J].Systems Engineering,2006,24(2):41-45. |
| |
| Authors: | LIU Bing-quan HUANG Chong-chao |
| |
| Abstract: | 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. |
| |
| Keywords: | Logit Assignment Model Shortest Path Algorithm Multi-path Traffic Assignment Traffic Assignment |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
