Determining an optimal path for forest road construction using Dijkstra's algorithm

摘要

From an economic point of view a well-designed road path with the minimum construction cost is an optimal path that can be found using Dijkstra's algorithm. In this study Dijkstra's algorithm that consisted of nodes and links was used to optimize theroad path in a broadleaved forest. The lower the cost, the greater the chance that the link will get routed. The road construction cost depends on the length of links, longitudinal gradient of links, side slope of the terrain and unit cost of the link construction. In general, the construction cost of each link increased with increasing length of the link, side slope gradient and longitudinal gradient. The total length and mean construction cost of optimal path were 530 m and 18.18 USDnr1, respectively.Based on the analysis, we found that Dijkstra's algorithm is feasible in selecting an optimal path according to the construction cost of forest road.