摘要
依据对公交乘客出行心理调查的统计结果,指出换乘次数最少是乘客出行时考虑的首要因素。描述了传统的Dijkstra算法,并分析了Dijkstra算法不适合公交网络最优路径选择的原因。最后根据公交乘客可以步行小段距离再转车的实际情况,提出一种基于换乘次数最少的公交最短路径改进算法。
This paper according as statlstical result about psychology inquisition of passengers trip, pointed out that the least trabsfer is the most important when passengers go out. The paper de.riled the traditional Dijkstra algorithm, then analyzed the reason Dijkstra algorithm is not fit to optimum route selection of putdie transportation network. Finally, according as the fact that passengers walking to turntable usually, bring fore, ard a public transportation optimum route amelioration algorithan on the least transfer.
出处
《经济地理》
CSSCI
北大核心
2005年第5期673-676,共4页
Economic Geography
关键词
公交网络
换乘次数
最优路径算法
public travr~
portatlon network
trarkster time
optimum route algorithm
