| 动态最佳交通路径的一种高效算法 |
| |
| 引用本文： | 李雷,陈天滋.动态最佳交通路径的一种高效算法[J].江苏大学学报(自然科学版),2004,25(3):252-256. |
| |
| 作者姓名： | 李雷 陈天滋 |
| |
| 作者单位： | 江苏大学计算机科学与通信工程学院,江苏,镇江,212013 |
| |
| 基金项目： | 信息产业部科研基金资助项目(2003XK320014) |
| |
| 摘 要： | 基于建立交通网络图区域的概念，为简化地图的复杂度，提出了一种高效的最佳交通路径的计算方法．在该算法中，依据特征点远小于内点的原则，将地图分成若干个地理位置上的区域，并同时建立额外的特征点区域．利用该特征点区域，可将整幅地图中各个区域的信息进行关联．通过对地图进行区域划分和区域处理，并预先存储各区域边界特征点间最佳交通路径的耗费总值，以及特征点区域上各点间的最佳交通路径，该算法就可以满足动态计算实时性的要求．
|
| 关 键 词： | 最佳交通路径 道路交通网 区域 算法 |
| 文章编号： | 1671-7775(2004)03-0252-05 |
| 修稿时间： | 2003年11月2日 |
A high-efficient algorithm of dynamic optimum transportation route |
| |
| LI Lei,CHEN Tian-zi.A high-efficient algorithm of dynamic optimum transportation route[J].Journal of Jiangsu University:Natural Science Edition,2004,25(3):252-256. |
| |
| Authors: | LI Lei CHEN Tian-zi |
| |
| Abstract: | Based on the concept of building the regional transportation network map and simplifying the complexity of the map, an efficient algorithm for optimum transportation route is proposed.In this algorithm,the map is divided into certain regions according to the principle of characteristic points being smaller than inner points, and meanwhile an extra region of characteristic points is built.The information of the region in the whole map can be related by using the region of characteristic points mentioned (above.) Through regional dividing, regional relating, and pre-storage of the total costs of optimum transportation route between the characteristic points on the border of each region and the optimum transportation route between the points in the characteristic points region,the algorithm can meet the simultaneous requirement of dynamic calculation. |
| |
| Keywords: | optimum transportation route road net region algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
