| 城际公共交通系统最短路算法 |
| |
| 引用本文： | 黄远春,胥耀方,潘海泽. 城际公共交通系统最短路算法[J]. 重庆交通大学学报(自然科学版), 2010, 29(2): 265-268 |
| |
| 作者姓名： | 黄远春 胥耀方 潘海泽 |
| |
| 作者单位： | 上海工程技术大学,城市轨道交通学院,上海,201620;北京交通大学,交通运输学院,北京,100044 |
| |
| 基金项目： | 上海市教育委员会重点学科基金资助项目 |
| |
| 摘 要： | 在借鉴城市公共交通最短路算法的基础上,针对城际网络的特点,研究了城际交通换乘路径的选择问题。以最小换乘次数为首要目标,并以此为基础,综合考虑时间、票价等因素,获取城际交通系统最短路。首先提出一种基于Flord算法的最小换乘矩阵及多条最短路的获取方法,然后利用最小换乘路径进行站线搜索与广义费用计算,获取城际交通的最短路,最后通过算例证明了本算法的可行性。
|
| 关 键 词： | 城际交通 最短路 最小换乘矩阵 广义费用 |
Algorithm for Shortest Path of Intercity Public Transportation System |
| |
| Abstract: | The algorithm for the Shortest Path was proposed based on characteristics of Intercity Public Transportation System. The main aim is at the selection of transfer paths. The least transfer and lowest generalized expense of time and price were solved. This paper firstly presents a way which based on the Floyd algorithm to obtain the least transfer matrix and multiple shortest path,then it calculates the generalized expense of all the least transfer paths by station-line search method. |
| |
| Keywords: | intercity transportation the shortest path least transfer matrix generalized expense |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
