| 交通路网中最优路径算法的道路权重选择 |
| |
| 引用本文： | 白尘.交通路网中最优路径算法的道路权重选择[J].中国会计电算化,2009(15):54-56. |
| |
| 作者姓名： | 白尘 |
| |
| 作者单位： | 北京科技大学经济管理学院,中国北京100083 |
| |
| 摘 要： | 在交通路网中，寻找任意两点间最优路径是出行导航的基本功能。除了最优路径算法自身性能外，道路权重的选择也直接决定了寻径结果的优劣。现有最优路径算法通常以通行能力为道路权重，其可能导致不合理的寻径结果，同时也不具有全局负载均衡的能力。因此本文以Dijkstra算法为例，引入可达性概念作为道路权重，从而弥补以通行能力为道路权重的缺陷。
|
| 关 键 词： | Dijkstra算法 道路权重 通行能力 可达性 |
The Selection of the Route Weight for Optimum Path Algorithm in the Transportation Network |
| |
| Authors: | BAI Chen |
| |
| Institution: | BAI Chen (School of Economics and Management, University of Science and Technology Beijing, Beijing 100083, P. R. China) |
| |
| Abstract: | Searching for the optimum path between any two points in the traffic net is the basic foundation of travel navigation. In addition to its own performance of the optimal path algorithm, the selection of the route weight directly determines the result of the merits of routing. Currently, the traffic capacity is usually used as the route weight in the optimal path algorithms, which may lead to unreasonable results and can＇t achieve the overall load balancing. Therefore, in this paper, Dijkstra algorithm being as an example, the Accessibility is introduced as the road weight to make up those deficiencies caused by traffic capacity as the route weight. |
| |
| Keywords: | Optimum Access Algorithm Weight of Route Traffic Capability Accessibility |
| 本文献已被 维普 等数据库收录！ |
|
