首页 | 本学科首页   官方微博 | 高级检索  
     

支持步行换乘的公交出行最优算法设计实现
引用本文:杨永平,陈红顺,汤建.支持步行换乘的公交出行最优算法设计实现[J].计算机与现代化,2016,0(5):90.
作者姓名:杨永平  陈红顺  汤建
基金项目:北京师范大学青年科研项目(2013052)
摘    要:较少换乘和快速到达是公交换乘算法的目标。本文基于现有的公交站点和公交线路建立换乘查询,以耗时最少为方案选择依据,兼顾换乘次数最少,建立基础通达表,用以支持实时公交步行换乘查询。一对源 目标站点可提供K种换乘方案,为用户提供时间、换乘车次、站点数、乘车距离、花费、步行距离等信息。实践表明,本算法查询结果符合用户期望。

关 键 词:公交换乘    步行换乘    最短时间    通达表  />  
收稿时间:2016-05-25

An Optimal Algorithm for Bus Trip Supporting Walking Transfer
YANG Yong ping,CHEN Hong shun,TANG Jian.An Optimal Algorithm for Bus Trip Supporting Walking Transfer[J].Computer and Modernization,2016,0(5):90.
Authors:YANG Yong ping  CHEN Hong shun  TANG Jian
Abstract:Less transfer and quick arrival is the goal of bus travel. In this paper, we use the existing bus station and bus lines, and consider the characteristics of public transportation network stability, establish the basic transfer table on base of time consuming and transfer times on which supports real time walking transfer query. A pair of source and target sites can provide K transfer schemes with multiple attributes, including estimated time, pass nodes list, travel distance, cost, walking distance, etc. Practice shows that the results of the algorithm meet the user expectations.
Keywords:public transfer  walking transfer  best times  arrival table  
点击此处可从《计算机与现代化》浏览原始摘要信息
点击此处可从《计算机与现代化》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号