基于有效路径集合的节点间连通度估计方法研究  

Researches on Estimations of Connectivity Reliability of an OD Pair Based on the Effective Path Sets

作　　者：王英杰[1,2] 程琳[1] 王炜[1] 

机构地区：[1]东南大学交通学院,南京210096 [2]沈阳市规划设计研究院,沈阳110015

出　　处：《武汉理工大学学报（交通科学与工程版）》2009年第5期960-963,共4页Journal of Wuhan University of Technology（Transportation Science & Engineering）

基　　金：国家自然科学基金项目资助(批准号:50578037)

摘　　要：对交通网络而言,节点间并非所有路径都作为出行者备选路径.与纯网络连通可靠性评价方法考虑节点间的所有可能路径不同,文中把节点间有效路径集合作为评价载流交通网络节点间连通可靠性的依据.节点间的有效路径集合可以通过Dial算法得到,在得到节点间有效路径集合后,利用BDD算法得到有效路径集合的不交化表示,进而得到节点间连通度的精确值.As for treat those nectivity es the transport network, not all the paths are chosen by the travelers. paths composed of effective links as the available paths of an OD pair. timations of pure networks where all the paths are taken into account, Diff we o this article, we erent from connly consider the effective paths of an OD pair in the connectivity estimations of transport network. The effective paths of an OD pair can be determined by the Dial algorithm. Having determined the effective paths of an OD pair, we get the disjoint expressions of the effective paths, and then calculate the precise value of the connectivity of an OD pair.

关 键 词：连通度 有效路径 DIAL算法 BDD算法 

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