| 改进的Dijkstra矩阵算法在城市公交线路选择中的应用 |
| |
| 引用本文： | 邓化宇,李康弟,黄建雄. 改进的Dijkstra矩阵算法在城市公交线路选择中的应用[J]. 上海电力学院学报, 2009, 25(1): 91-93,97 |
| |
| 作者姓名： | 邓化宇 李康弟 黄建雄 |
| |
| 作者单位： | 上海电力学院,数理系,上海,200090 |
| |
| 摘 要： | 利用改进的Dijkstra矩阵算法，对2007年全国大学生数学建模竞赛B题“乘公交，看奥运”进行研究，精确有效地求出了以任意两公交站点之间时间最短、费用最少、换乘次数最少等为目标的最优线路．
|
| 关 键 词： | 初始赋权可达矩阵 Dijkstra矩阵算法 换乘 最优线路 |
| 收稿时间： | 2008-04-25 |
Application of the Improved Dijkstra's Matrix Algorithm in Choosing Best-routing for Pubilc Transportation System |
| |
| DENG Hua-yu,LI Kang-di and 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 |
| |
| Authors: | DENG Hua-yu LI Kang-di HUANG Jian-xiong |
| |
| Affiliation: | Dept.of Mathematics and Physics;Shanghai University of Electric Power;Shanghai 200090;China |
| |
| 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. |
| |
| Keywords: | primitive weight matrices Dijkstra matrix algorithm transfer best routes |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《上海电力学院学报》浏览原始摘要信息 |
|
点击此处可从《上海电力学院学报》下载全文 |
