首页> 中文期刊> 《大连工业大学学报》 >基于最短时间的公交乘车路径查询模型

基于最短时间的公交乘车路径查询模型

         

摘要

Many of the classic bus path query algorithm has focused on driving the shortest path and never cared the changing and waiting. In this paper, a minimum time based on travel route query model for the public transport considering the transfer time, wait time and run time, is proposed by using directed graph with weights, and the query objective can be optimized through flexible strategies assigning weights. The results show that the model is effective, practical and has good flexibility.%很多经典的公交路径查询算法都把焦点放在行驶路径最短搜索上,而忽略了越来越影响人们出行时间花费的等车和换车上.本文利用有向带权图建立了一种综合考虑等车、换乘和运行时间的最短时间公交出行路径查询模型,通过灵活的权值设定策略优化查询目标.实验表明,提出的模型有效、实用,具有很好的灵活性.

著录项

相似文献

  • 中文文献
  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号