检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西南交通大学交通运输与物流学院,成都610031
出 处:《交通运输系统工程与信息》2013年第2期158-163,共6页Journal of Transportation Systems Engineering and Information Technology
基 金:国家自然科学基金(61104175)
摘 要:研究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.
关 键 词:城市交通 配流 有效路段 LOGIT模型 DIAL算法 交通网络 容错系数
分 类 号:TP18[自动化与计算机技术—控制理论与控制工程] U491[自动化与计算机技术—控制科学与工程]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.188