中国管理信息化
中國管理信息化
중국관리신식화
CHINA MANAGEMENT INFORMATIONIZATION
2009年
15期
54-56
,共3页
Dijkstra算法%道路权重%通行能力%可达性
Dijkstra算法%道路權重%通行能力%可達性
Dijkstra산법%도로권중%통행능력%가체성
Optimum Access Algorithm%Weight of Route%Traffic Capability%Accessibility
在交通路网中,寻找任意两点间最优路径是出行导航的基本功能.除了最优路径算法自身性能外,道路权重的选择也直接决定了寻径结果的优劣.现有最优路径算法通常以通行能力为道路权重,其可能导致不合理的寻径结果,同时也不具有全局负载均衡的能力.因此本文以Dijkstra算法为例,引入可达性概念作为道路权重,从而弥补以通行能力为道路权重的缺陷.
在交通路網中,尋找任意兩點間最優路徑是齣行導航的基本功能.除瞭最優路徑算法自身性能外,道路權重的選擇也直接決定瞭尋徑結果的優劣.現有最優路徑算法通常以通行能力為道路權重,其可能導緻不閤理的尋徑結果,同時也不具有全跼負載均衡的能力.因此本文以Dijkstra算法為例,引入可達性概唸作為道路權重,從而瀰補以通行能力為道路權重的缺陷.
재교통로망중,심조임의량점간최우로경시출행도항적기본공능.제료최우로경산법자신성능외,도로권중적선택야직접결정료심경결과적우렬.현유최우로경산법통상이통행능력위도로권중,기가능도치불합리적심경결과,동시야불구유전국부재균형적능력.인차본문이Dijkstra산법위례,인입가체성개념작위도로권중,종이미보이통행능력위도로권중적결함.
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 de- termines 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 defi- ciencies caused by traffic capacity as the route weight.
