| 公交最短路径算法与网络通达性指标的计算 |
| |
| 引用本文： | 李彬,杨超.公交最短路径算法与网络通达性指标的计算[J].同济大学学报(自然科学版),1997,25(6):651-655. |
| |
| 作者姓名： | 李彬 杨超 |
| |
| 作者单位： | 同济大学道路与交通工程系!上海．200092 |
| |
| 摘 要： | 研究了公交单一票价乘客路线选择的影响，给出了求两交通小区间公交最短行时间和公交最短路径的算法，并在公交客流始终点ＯＤ分布矩陈的基础上，对公交网络通达性进行了深入的研究，可用于公交网络优化评价与方案抉择。
|
| 关 键 词： | 公交网络 公交最短路径 通达性 |
Algorithm to Obtain the Shortest Bus Route and the Calculation of Bus Network's Accessibility |
| |
| Li Bin, Yang Chao, Yang Peikun.Algorithm to Obtain the Shortest Bus Route and the Calculation of Bus Network''s Accessibility[J].Journal of Tongji University(Natural Science),1997,25(6):651-655. |
| |
| Authors: | Li Bin Yang Chao Yang Peikun |
| |
| Abstract: | In this paper, we study how the public transportation single-pricerule affects passengers to choose bus routes, and suggest an algorithm to find theshortest bus route and the shortest travel time between two zones. Based onpassenger OD distribution matrix, we also study the bus network's accessibility,which can be used to evaluate bus network and to provide alternatives. |
| |
| Keywords: | Bus network Shortest bus route Accessibility |
| 本文献已被 CNKI 维普 等数据库收录！ |
