摘要
随着便携式移动设备广泛和深入的应用,相比传统查询方式,基于便携设备的公交查询将显示出其灵活性。分析了用最短路径算法Dijkstra实现基于便携式移动设备的公交查询的缺陷,结合网络路由扩散算法,提出了一种更合适的公交线路查询算法,并通过处理多样化线路、选择换乘代价来优化查询结果。将该算法应用于实际公交网络进行实验,与传统方案进行比较分析,该算法具有较快的响应速度,取得了较好的效果。
Compared with the traditional ways, the city public traffic inquiry based on the portable will present its flexibility with wide and deep application of portable devices. The weakness of realizing the city public traffic inquiry based on the portable mobile devices by using Dijkstra Algorithm is analyzed. And a more suitable way is presented by combining flooding algorithm, and its result is optimized through dealing with various routes and choosing transfer-cost. Finally, when the algorithm is experimented in actual public traffic network, compared with the traditional ways, a quicker response speed and good results are achieved.
出处
《计算机工程与设计》
CSCD
北大核心
2008年第23期6124-6126,6129,共4页
Computer Engineering and Design
基金
湖南省教育厅基金项目(05C245)
湖南省重点学科建设基金项目。
关键词
城市公共交通
线路查询
换乘
扩散路由算法
便携设备
city public traffic
inquiry of route
transfer
flooding algorithm
portable devices
