| 用于最短路算法的公交网络模型构建 |
| |
| 引用本文： | 温金辉,刘伟铭.用于最短路算法的公交网络模型构建[J].交通标准化,2011(8):177-179. |
| |
| 作者姓名： | 温金辉 刘伟铭 |
| |
| 作者单位： | 华南理工大学土木与交通学院,广东,广州,510640 |
| |
| 摘 要： | 公共交通线路网络的复杂化使乘客难于选择最优的出行线路。用于最短路算法的公交网络模型,解决了有向图难以承载票价和换乘这两个出行要素的问题,有效地把公交出行要素包含在弧中,使得最短路算法可以直接根据这些要素搜索最优出行方案。
|
| 关 键 词： | 最短路 公交网络 公交换乘 |
Public Transit Network Modeling for Shortest Path Algorithm |
| |
| WEN Jin-hui,LIU Wei-ming.Public Transit Network Modeling for Shortest Path Algorithm[J].Communications Standardization,2011(8):177-179. |
| |
| Authors: | WEN Jin-hui LIU Wei-ming |
| |
| Institution: | WEN Jin-hui,LIU Wei-ming(School of Civil Engineering and Transportation,South China University of Tech.,Guangzhou 510640,China) |
| |
| Abstract: | It is difficult for passengers to choose an optimize travel route in a complicate public transit network.A new public transit network model for shortest path algorithm solved the issue that it is difficult to describe travel price and transfer count in a directed graph.The model carried out the key travel factors effectively,therefore the shortest path algorithm could search the optimize solution directly based on them. |
| |
| Keywords: | shortest path public transit network public transit transfer |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
