| 公共交通枢纽换乘算法设计 |
| |
| 引用本文： | 陶兵进,林奕星.公共交通枢纽换乘算法设计[J].城市公共交通,2012(8):26-28. |
| |
| 作者姓名： | 陶兵进 林奕星 |
| |
| 作者单位： | 大连理工大学建设工程学部,大连,116024 |
| |
| 摘 要： | 对公共交通枢纽换乘算法设计,换乘分为直达线路,一次换乘,二次换乘,换乘算法的具体设计分为两个步骤1、构造并求解换乘矩阵,获得公交换乘方案(即从起点到终点最少换乘次数,及换乘站点).2、根据最少换乘次数,缩小求解范围,求解起始站点与目标站点间的最短路径,进而得到最佳路径.
|
| 关 键 词： | 公共交通 换乘 算法设计 |
Public Transport Hub Transfer Algorithm Design |
| |
| Tao Bingjin
,
Lin Yixing.Public Transport Hub Transfer Algorithm Design[J].Urban Public Transport,2012(8):26-28. |
| |
| Authors: | Tao Bingjin Lin Yixing |
| |
| Institution: | Tao Bingjin Lin YixingFaculty of Infrastructure Engineering Dalian University of Technology,Dalian ,116024,China |
| |
| Abstract: | For public transportation hub transfer algorithm design, transfer includes direct line, one times transfer and two times. The algorithm design is divided into two steps I, build the transfer matrix and find solution, get transfer plans for bus （that is, from start to destination, find the plans that need the least change times and passing sites） .2, According to transfer times, narrow scope of solution, solving the starting sites and target site of the shortest path, and then we get the best path. |
| |
| Keywords: | public transport transfer Algorithm design |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
