改进的Dijkstra矩阵算法在城市公交线路选择中的应用  

Application of the Improved Dijkstra's Matrix Algorithm in Choosing Best-routing for Pubilc Transportation System

作　　者：邓化宇[1] 李康弟[1] 黄建雄[1] 

机构地区：[1]上海电力学院数理系,上海200090

出　　处：《上海电力学院学报》2009年第1期91-93,97,共4页Journal of Shanghai University of Electric Power

摘　　要：利用改进的Dijkstra矩阵算法,对2007年全国大学生数学建模竞赛B题"乘公交,看奥运"进行研究,精确有效地求出了以任意两公交站点之间时间最短、费用最少、换乘次数最少等为目标的最优线路.Based on the improved Dijkstra＇s matrix algorithm, the paper efficiently and more exactly solves the problem B of CUMCM 2007：Public Transportation Route Selection Problem,which obtains the best routes by respectively considering the shortest time, the least expense, the shortest public traffic transfer between any two given bus stops.

关 键 词：初始赋权可达矩阵 Dijkstra矩阵算法 换乘 最优线路 

分 类 号：O151.21[理学—数学]