最短路径问题的优化算法研究  

The research of optimization algorithm in the shortest path problem

作　　者：校景中[1] 肖丽[1] 

机构地区：[1]西南民族大学计算机科学与技术学院,成都610041

出　　处：《西南民族大学学报（自然科学版）》2012年第3期449-452,共4页Journal of Southwest Minzu University(Natural Science Edition)

摘　　要：最短路径问题是图论中一个最基本的问题,已经有很多学者对其做出过大量的研究.然而随着智能交通、通讯系统的不断发展,出现了越来越多的具有大规模性质的复杂网络结构,与传统的最短路径问题相比,这类问题具有规模更大的数据量,并且对算法执行效率要求更高.首先研究与分析了传统串行A*算法,针对A*算法的缺陷进行改进,提出了优化.The shortest path problem in graph theory is a fundamental problem, and a number of scholars have made extensive studies on it. However, as intelligent transportation and communication systems continue to evolve, there has been more and more network structures of large-scale nature, and compared with the traditional shortest path problem, this problem has a larger amount of data and the algorithm, the implementation of higher efficiency requirements.

关 键 词：A＊ 最短路径 效率 

分 类 号：O224[理学—运筹学与控制论]