| 城市公交查询系统的设计与实现 |
| |
| 引用本文： | 周晖杰.城市公交查询系统的设计与实现[J].应用数学与计算数学学报,2009,23(2):35-41. |
| |
| 作者姓名： | 周晖杰 |
| |
| 作者单位： | 宁波大学科学技术学院,宁波,315212 |
| |
| 摘 要： | 针对含有“公汽、地铁、步行”的复杂公交网络环境,首先对公交问题所提供的数据进行分析,并优化数据的存储结构;其次充分考虑到公交网络客流分配的主要因素一换乘次数、票价、时间,提出了公交网中这三个目标的加权平均最优路径模型及其算法;最后对模型的算法用Matlab软件实现.通过测试,结果显示本系统能快速响应出满足乘客不同需求的公交出行路径。
|
| 关 键 词： | 公交 数据结构 Dijkstra算法 最优线路 |
Design and Implementation of Urban Public Transport Inquiry System |
| |
| Zhou Huijie.Design and Implementation of Urban Public Transport Inquiry System[J].Communication on Applied Mathematics and Computation,2009,23(2):35-41. |
| |
| Authors: | Zhou Huijie |
| |
| Institution: | Zhou Huijie( College of Science and Technology, Ningbo University, Ningbo 315212, China) |
| |
| Abstract: | In the transit network's environment of "bus, subway and on-foot", we firstly analyze the data of B problem and optimize the saving structure of data. Secondly, taking full consideration of the major factors-the transfer times, ticket price and travel time influencing the passenger flow assignment pattern in the transit network, we put forward an optimal path searching algorithm with different weight value in transit network. Finally, we realize its algorithm with Matlab software. An experiment is given to show the system's efficiency and it can quickly respond to meet the demand of passenger. |
| |
| Keywords: | transit network data structure Dijkstra algorithm optimal route |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
