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

Travel route query model based on the shortest time for the public transport

作　　者：夏伯男[1] 吴雪莹[1] 姚春龙[1] 

机构地区：[1]大连工业大学信息科学与工程学院,辽宁大连116034

出　　处：《大连工业大学学报》2011年第2期152-155,共4页Journal of Dalian Polytechnic University

摘　　要：很多经典的公交路径查询算法都把焦点放在行驶路径最短搜索上,而忽略了越来越影响人们出行时间花费的等车和换车上。本文利用有向带权图建立了一种综合考虑等车、换乘和运行时间的最短时间公交出行路径查询模型,通过灵活的权值设定策略优化查询目标。实验表明,提出的模型有效、实用,具有很好的灵活性。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.

关 键 词：公共交通 乘车路径 搜索算法 最短时间 

分 类 号：TP311[自动化与计算机技术—计算机软件与理论]