Logit随机网络配流模型的改进Dial算法.pdfVIP

第13卷 第2期 交通运输系统工程与信息 Vol郾13 No郾2 2013 年4 月 Journal of Transportation Systems Engineering and Information Technology April 2013 文章编号: 1009鄄6744 (2013)02鄄0158鄄06 Logit 随机网络配流模型的改进 Dial算法 * 杨摇 泳,严余松 ,户佐安,马摇 毅 (西南交通大学 交通运输与物流学院,成都610031) 摘要:摇 研究Logit 随机网络配流模型及实现模型求解的Dial 算法,针对原模型及算法 的缺陷,通过引入路段长度相关的容错系数指标重新定义有效路径的判定条件,在此基 础上提出一种改进的Dial算法,并应用于Logit 随机网络配流模型中.改进算法在不降 低原算法精度下不仅保留了原算法的无需路径枚举、计算效率高等优越性,而且满足实 际出行者偏好在较短路段上“迂回冶选择潜在有效路段的特点.最后通过一个路网实例 对2种算法的配流结果进行了对比.结果表明,改进的算法避免了原算法缺陷导致的结 果异常,配流效果更加符合实际,其计算效果明显优于原算法. 关键词:摇 城市交通;配流;有效路段;Logit模型;Dial算法;交通网络;容错系数 中图分类号:摇 TP18,U491 文献标识码:摇 A Improved Dial爷s Algorithm for Logit鄄Based Stochastic Traffic Assignment Model YANG Yong,YAN Yu鄄song,HU Zuo鄄an,MA Yi (School of Transportation and Logistics,Southwest Jiaotong University,Chengdu610031,China) Abstract:摇 This paper analyzes the multi鄄path Logit assignment model and the classical Dial爷s algorithm. Toovercomethedrawbackinexistingmodelandalgorithm,animprovedalgorithmispresented. Theefficient path condition is modified based on a quantitative correction coefficient on individual path. The improved algorithm retains the main advantages of original algorithm,in which the path enumeration is not required and a similar computing efficiency with the original algorithm is guaranteed. Meanwhile,the preference to potential valid road linkswith short distance amongurbantraffictravellersis satisfied. A numerical example based on a traffic road network is used to illustrate the application of proposed algorithm and two