蒙特卡罗方法和ORDER算法在网络可靠度计算中的对比  

Comparison of Monte Carlo Simulation and ORDER Algorithm in Calculation of Network Reliability

作　　者：岳焱超[1] 马建勋[1] 郜健[1] 张硕英[1] 张玲玲[1] 

机构地区：[1]西安交通大学土木工程系,陕西西安710049

出　　处：《重庆交通大学学报（自然科学版）》2013年第S1期776-778,共3页Journal of Chongqing Jiaotong University(Natural Science)

基　　金：国家自然科学基金面上项目(51178390);中央高校基本科研业务费专项资金资助项目(xjj2013012)

摘　　要：对蒙特卡罗方法和ORDER算法在计算某中等规模的桥梁网络连通可靠度方面进行了对比。结果表明:OR-DER算法可以获得更精确的计算结果,而蒙特卡罗方法在计算速度上有优势。计算结果有助于政府管理者更好地了解桥梁网络状态。Monte Carlo simulation and ORDER algorithm were used and compared in getting the connectivity reliability for a medium-sized bridge network.The results show that ORDER algorithm can give more accurate bounds of connectivity reliability for network with higher reliable components,while the computation time of Monte Carlo simulation is shorter than ORDER algorithm.The results can assist the government officers understand the bridge network status better.

关 键 词：网络 连通可靠度 蒙特卡罗方法 ORDER算法 

分 类 号：U442[建筑科学—桥梁与隧道工程]