最短路径算法在路网模型中的研究与实现  

Research and Implementation of the Shortest Path Algorithm in Road Network Model

作　　者：董文科[1] 赵俊三[1] 杨哲[1] 陈雷[1] 

机构地区：[1]昆明理工大学国土资源工程学院,昆明650093

出　　处：《价值工程》2016年第1期88-90,共3页Value Engineering

摘　　要：传统的基于距离的路网模型以车辆通过的距离为权值计算最短路径,该模型无法满足基于时间的计算。要解决时间路网模型的设计问题,应该在基于距离的最短路径研究中,将动态的阻抗系数在计算机中表示出来,在算法实现过程中,解决如何在不同情况下调用不同的阻抗系数来选择相应情况下最合适的时间最短路径问题。The traditional network model based on distance calculates the shortest path with the distance that the vehicle travels as the weights, and it can＇t meet the calculation based on time. In order to solve the design of the time road network model, we need to show the dynamic impedance coefficient in the computer in the shortest path based on distance. In the process of algorithm implementation, the problems of calling different resistance coefficients in different situation to select the most proper time-saving path in the corresponding cases shall be solved.

关 键 词：路网模型 DIJKSTRA算法 A＊(A Star)算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]