随机流量交通网络可靠性近似算法的对比分析  

A Comparative Analysis of Approximatel Algorithm on Reliability Evaluation of Stochastic-Flow Traffic Network

作　　者：温冬海[1] 寇飞 王晓丽[1] 张利分[1] 

机构地区：[1]长沙理工大学交通运输学院 [2]嘉兴市世纪交通工程咨询监理有限公司

出　　处：《山西科技》2007年第2期101-102,105,共3页Shanxi Science and Technology

摘　　要：与二态网络相比,随机流量交通网络更适于描述现实生活中的交通系统。但是现实交通网络可靠性的精确计算是非常难的,为此,需要寻求一个有效的近似算法。针对这一方面的研究,目前已有许多计算网络可靠度的算法。文章介绍了几种典型算法(ORDER-M算法、ORDER-MⅡ算法、GC算法)的来源和思想,并提出了进一步的研究方向。Compared with two modes network, the stochastic - flow traffic network is more suitable for describing the transportation system in the real life. But the precise computation of realistic traffic network reliability is NP difficult, therefore, we need to seek an effective approximate method. In view of the research on this aspect, there have been many algorithms to compute networks reliability. This article introduces the origins and thoughts of several typical algorithms （ORDER - M algorithm, ORDER- MⅡ algorithm, GC algorithm）. The article finally proposes the further research direction.

关 键 词：随机流量 交通网络 可靠度 ORDER—M算法 ORDER—MⅡ算法 GC算法 

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