中文摘要：

研究Logit随机网络配流模型及实现模型求解的Dial算法,针对原模型及算法的缺陷,通过引入路段长度相关的容错系数指标重新定义有效路径的判定条件,在此基础上提出一种改进的Dial算法,并应用于Logit随机网络配流模型中.改进算法在不降低原算法精度下不仅保留了原算法的无需路径枚举、计算效率高等优越性,而且满足实际出行者偏好在较短路段上＂迂回＂选择潜在有效路段的特点.最后通过一个路网实例对2种算法的配流结果进行了对比.结果表明,改进的算法避免了原算法缺陷导致的结果异常,配流效果更加符合实际,其计算效果明显优于原算法.

英文摘要：

This paper analyzes the multi-path Logit assignment model and the classical Dial＇ s algorithm. To overcome the drawback in existing model and algorithm, an improved algorithm is presented. The efficient 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 links with short distance among urban traffic travellers is satisfied. A numerical example based on a traffic road network is used to illustrate the application of proposed algorithm and two algorithms are then compared. Results show that the improved algorithm is able to eliminate the abnormal behavior of the original algorithm with more feasible and reasonable traffic flow assignment results. It is evident that the proposed algorithm is more effective than the original one.