本文已被：浏览 730次 下载 784次
投稿时间：2008-04-25
投稿时间：2008-04-25
中文摘要: 利用改进的Dijkstra矩阵算法,对2007年全国大学生数学建模竞赛B题"乘公交,看奥运"进行研究,精确有效地求出了以任意两公交站点之间时间最短、费用最少、换乘次数最少等为目标的最优线路.
中文关键词: 初始赋权可达矩阵 Dijkstra矩阵算法 换乘 最优线路
Abstract: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.
文章编号：20090123 中图分类号： 文献标志码：
基金项目:
引用文本：
邓化宇,李康弟,黄建雄.改进的Dijkstra矩阵算法在城市公交线路选择中的应用[J].上海电力大学学报,2009,25(1):91-93,97.
DENG Hua-yu,LI Kang-di,HUANG Jian-xiong.Application of the Improved Dijkstra's Matrix Algorithm in Choosing Best-routing for Pubilc Transportation System[J].Journal of Shanghai University of Electric Power,2009,25(1):91-93,97.
邓化宇,李康弟,黄建雄.改进的Dijkstra矩阵算法在城市公交线路选择中的应用[J].上海电力大学学报,2009,25(1):91-93,97.
DENG Hua-yu,LI Kang-di,HUANG Jian-xiong.Application of the Improved Dijkstra's Matrix Algorithm in Choosing Best-routing for Pubilc Transportation System[J].Journal of Shanghai University of Electric Power,2009,25(1):91-93,97.