| 公交网络换乘问题的一种实现 |
| |
| 引用本文： | 苏爱华,施法中. 公交网络换乘问题的一种实现[J]. 工程图学学报, 2005, 26(4): 55-59 |
| |
| 作者姓名： | 苏爱华 施法中 |
| |
| 作者单位： | 北京航空航天大学机械工程及自动化学院,北京,100083 |
| |
| 摘 要： | 公交换乘问题是公共交通信息查询的重要内容。针对公交网络换乘问题构造了公共交通网络模型。基于该模型,提出了基于改进Dijkstra算法的公交网络最短路径问题的求解。将求解最短路径获得的站点作为搜索站点,并将这些站点及经过这些站点的线路构成换乘矩阵,结合换乘次数的要求,给出了换乘的实现算法,确定可行的换乘方案。
|
| 关 键 词： | 计算机应用 换乘矩阵 最短路径 公交网络 |
| 文章编号： | 1003-0158（2005）04-0055-05 |
| 收稿时间： | 2004-12-20 |
| 修稿时间： | 2004-12-20 |
Optimal Route Choice of Public Traffic Network Based on Shortest Path Searching |
| |
| SU Ai-hua,SHI Fa-zhong. Optimal Route Choice of Public Traffic Network Based on Shortest Path Searching[J]. Journal of Engineering Graphics, 2005, 26(4): 55-59 |
| |
| Authors: | SU Ai-hua SHI Fa-zhong |
| |
| Abstract: | Public traffic transfer is an important problem to public traffic querying. A model of public traffic network with nodes representing stations and directed arcs showing traffic routes is presented. Candidate change stops are verified from the nodes that compose the shortest path and the routes that pass through these nodes. After comparing various feasible options with different times of midway changing, the optimal route with minimum times of changing is taken. |
| |
| Keywords: | computer application transfer matrix shortest path public traffic network |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
