首页> 中文期刊> 《浙江大学学报(理学版)》 >考虑多方式换乘的公交网络最优路径算法

考虑多方式换乘的公交网络最优路径算法

         

摘要

In the traditional optimal path algorithm of the public transportation network, they only consider the in situ transfer, which leading to the missing of some travel path. For example, passengers can often walk or ride to the adjacent stop and take another bus to make an optimal path. By analyzing transferring mode in real life, this paper describes the full path of passengers, abstracts the key transfer point according to the connections among bus lines and spatial relationships of bus stops, then establishes a matrix of public transport network, and finally calculate the optimal path with the least transferring in multi-mode transferring or the shortest time, providing passengers more flexible travel options.%在传统的公交网络最优路径算法中,往往只考虑了原地换乘,这样就导致了部分出行路径的缺失.例如,在现实生活中,乘客常常可以通过步行或骑自行车到相邻站点再换乘公交车的方式来实现最优出行.通过对换乘方式的分析,描述了乘客出行的完整路径;根据公交线路的关联情况和公交站点的空间位置关系,抽象出了关键换乘点;并依据关键换乘点的定义对公交网络进行了变换,继而建立起公交网络通达矩阵;最后在此基础上计算出考虑多方式换乘的换乘次数最少、所需时间最短的公交出行路径,为乘客提供更灵活的出行选择.

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号