| 交通网络最短路径并行算法研究综述 |
| |
| 引用本文： | 倪安宁,隽志才,高林杰.交通网络最短路径并行算法研究综述[J].公路交通科技,2006,23(12):128-132. |
| |
| 作者姓名： | 倪安宁 隽志才 高林杰 |
| |
| 作者单位： | 1. 吉林大学,交通学院,吉林,长春,130022
2. 上海交通大学,管理学院交通运输研究所,上海,200052 |
| |
| 基金项目： | 国家自然科学基金资助项目(50378042,50338030,70371022) |
| |
| 摘 要： | 首先回顾了最短路径并行算法的国内外研究进展,对当前的最短路径并行算法进行分类。接着讨论了交通网络分析中最短路径并行算法常用的两种实现策略以及各自的优缺点;分析了影响网络分割策略并行算法性能的3个主要因素:最短路径算法选择、网络分割及终止检测方法。最后就实际交通网络中最短路径并行算法需进一步研究的问题给出了建议。
|
| 关 键 词： | 最短路径 并行算法 网络分割 |
| 文章编号： | 1002-0268(2006)12-0128-05 |
| 收稿时间： | 2005-06-13 |
| 修稿时间： | 2005年6月13日 |
An Overview of Research on Parallel Shortest Path Algorithm in Transportation Network |
| |
| NI An-ning,JUAN Zhi-cai,GAO Lin-jie.An Overview of Research on Parallel Shortest Path Algorithm in Transportation Network[J].Journal of Highway and Transportation Research and Development,2006,23(12):128-132. |
| |
| Authors: | NI An-ning JUAN Zhi-cai GAO Lin-jie |
| |
| Institution: | 1.College of Transportation, Jilin University, Jilin Changchun 130022, China; 2. Institute of Transportation Studies, School of Management, Shanghai Jiaotong University, Shanghai 200052, China |
| |
| Abstract: | The state-of-the-art of parallel shortest path algorithm at home and abroad is reviewed.The existing parallel shortest path(algorithms) are classified systemically.The two strategies frequently used to realize parallel shortest path algorithms in transportation(network,)network duplication strategy and network partition strategy,are discussed as well as their individual advantages and(disadvantages.)(Further,)three major factors,shortest path algorithm,network decomposition and termination detection,which affect the performance of parallel shortest path algorithm greatly are analyzed in-depth.Finally conclusions and recommendations for further research of parallel shortest path algorithm in actual transportation network are suggested. |
| |
| Keywords: | shortest path parallel algorithm network partition |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
