求解Logit随机网络配流问题的改进Dial算法  

Improved Dial's Algorithm for Logit-based Stochastic Traffic Network Assignment Problem

作　　者：四兵锋[1] 张好智[1] 高自友[1] 

机构地区：[1]北京交通大学交通运输学院,北京100044

出　　处：《中国公路学报》2009年第1期78-83,共6页China Journal of Highway and Transport

基　　金：国家重点基础研究发展计划("九七三"计划)项目(2006CB705500);国家自然科学基金项目(70631001)

摘　　要：分析了用Dial算法求解城市交通网络随机配流问题产生错误的根本原因,并根据路径费用信息重新定义有效路径;在此基础上,提出了利用路段费用信息判定有效路径的必要条件,并结合网络拓扑排序方法,提出了改进的Dial算法;最后,采用北京市轨道交通网络的基础数据,对2种算法进行了比较。结果表明:改进的Dial算法不仅保留了原算法的优越性,而且避免了结果出现异常,其计算效果明显优于原算法。The reason for the drawback that Dial＇s algorithm was used to solve urban Logit-based stochastic traffic network assignment was analyzed. Considering the link travel cost information, efficient path was redefined and based on it, the necessary condition of efficient path judged by link travel cost information was presented simultaneously. An improved algorithm combined with topological sort algorithm was proposed. Finally, a numerical example based on Beijing subway network was used to illustrate the application of the proposed algorithm and two algorithms were compared. The results show that the improved algorithm removes the limitation of original algorithm, in which path enumeration is not required and a similar computing efficiency with the original algorithm is guaranteed; it is evidently better than the original algorithm.

关 键 词：交通工程 交通网络 DIAL算法 配流 LOGIT模型 

分 类 号：U491.13[交通运输工程—交通运输规划与管理]