基于图论的最低风险水平线路方案自动搜索算法  

Automatically algorithm for searching the lowest risk level route scheme based on graph theory

作　　者：李军[1] 徐志胜[1] 宋占峰[1] 杨峰[1] 吴恩琦[1] 

机构地区：[1]中南大学土木工程学院,湖南长沙410075

出　　处：《铁道科学与工程学报》2016年第4期619-625,共7页Journal of Railway Science and Engineering

基　　金：国家自然科学基金资助项目(50708117);交通运输建设科技项目(20113187851460)

摘　　要：以计算机图论为基础,研究线路方案拓扑关系,提出采用有向图网络表征线路局部方案间网络拓扑关系。借鉴图论最短路径问题思想,构建一种最低风险水平线路方案搜索算法,实现在高速公路线路风险全局最优的条件下,自动搜索出一条整体风险水平最低的推荐方案。Based on computer graph theory and the study of route plan＇s topology relationship,directed graph network is proposed to characterize the topology relationship between local scheme by the author.By using the shortest path problem of graph theory,a line search algorithm is proposed with the lowest risk level.In highway route risk of the global optimal conditions,it can automatically search out a recommendation with the lowest over-all risk level.

关 键 词：高速公路 线路方案优选 有向网络 最低风险水平 自动搜索算法 

分 类 号：U412[交通运输工程—道路与铁道工程]