基于矩阵分析的公共交通网络最优路径算法  

Optimal Routing Algorithm for Public Traffic Network Based on Matrix Analysis

作　　者：何迪[1] 严余松[1] 郭守儆[2] 郝光[1] 

机构地区：[1]西南交通大学交通运输学院,四川成都610031 [2]西南交通大学土木工程学院,四川成都610031

出　　处：《西南交通大学学报》2007年第3期315-319,共5页Journal of Southwest Jiaotong University

摘　　要：为了更符合实际情况,即充分考虑换乘次数是乘客选择公共交通网络的决定因素,运行时间是其重要因素,分析了乘客心理特征,用G IS技术建立了公共交通网络模型,构建了适合公共交通分析的直达矩阵和最小换乘矩阵.在此基础上,结合路段、节点运行时间,提出了公共交通网络最优路径算法,并用一个简单的算例对算法进行了说明.In order to tally with the actual situation further, i. e. , transfer times are a determining factor and travel time is an important factor in passengers＇ choice of a route in a public traffic network, the psychological characteristics of passengers were analyzed, a public traffic network model based on GIS （geographical information system） was established, and the path-planning matrix and the least transfer matrix used to the analysis of public traffic were constructed. On the basis of the above works, an optimal routing algorithm for public traffic networks was proposed by considering the link travel time and the time at bus stops. Finally, a simple example was given to show this algorithm.

关 键 词：公共交通网络 地理信息系统 最佳路径 

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