A new algorithm to consider critical length of grades in raster-based least-cost path analysis
- PDF / 5,906,404 Bytes
- 9 Pages / 595.276 x 790.866 pts Page_size
- 85 Downloads / 209 Views
ORIGINAL PAPER
A new algorithm to consider critical length of grades in raster-based least-cost path analysis Sina Abolhoseini 1
&
Ali Asghar Alesheikh 1
Received: 21 October 2019 / Accepted: 11 September 2020 / Published online: 28 September 2020 # Saudi Society for Geosciences 2020
Abstract A new raster-based least-cost path analysis algorithm is proposed in this article that considers the critical length of grades as a parameter-governing factor that ascertains whether a path is traversable in hilly terrains. Our proposed algorithm uses a speed prediction model to predict the speed of trucks after each path segment based on an initial speed, gradient value, and length of the segment. We also consider earthwork operations, slope thresholds, and moving-window models. After applying the proposed algorithm to real-world data, a traversable path is obtained; previous studies cannot guarantee such a capability. By comparing this proposed algorithm with the latest least-cost path algorithm, we found that it offers a longer path in upward slopes to compensate for the speed of trucks. Speed profiles also reveal that trucks cannot traverse paths suggested by the existing algorithm in hilly terrains, and they stop in the middle of the road. However, in the proposed algorithm, vehicles traverse the path while compensating for speed on upward slopes. This algorithm can be used by road designers in GIS software. Keywords Geographic Information Systems . Least-cost path analysis . Critical length of grades . Digital elevation model
Introduction Least-cost path analysis (LCPA) is a technique of finding a sequence of cells between two cells, designated as origin and destination, with the least possible cost in a raster space (Shirabe 2016). This technique is broadly used in real-world applications such as finding a suitable corridor for highways (Scaparra et al. 2014), power lines (Bagli et al. 2011), and pipelines (Feldman et al. 1995). The LCPA finds least-cost paths by considering a hypothetical network on a raster. In this hypothetical network, one node is considered for each cell center, and one edge for each pair of connected cells links the nodes to each other at the center of the cells. A 4-cell Rook’s pattern, an 8-cell Queen’s pattern, and a 16-cell Knight’s pattern are used to determine the connected cells (Baek and Choi 2017a). A 4cell Rook’s pattern considers four orthogonal adjacent neighbors for each cell, which is used in most GIS software. An 8Responsible Editor: Biswajeet Pradhan * Sina Abolhoseini [email protected] 1
Faculty of Geodesy and Geomatics Engineering, K. N. Toosi University of Technology, Tehran, Iran
cell Queen’s pattern connects each cell with its adjacent eight neighbors in orthogonal and diagonal directions. In a 16-cell Knight’s pattern, non-adjacent cells are also considered to support more moving angles (Antikainen 2013). The LCPA can be used to find alignments for roads or railways (Choi and Nieto 2011; Yildirim and Bediroglu 2019). Roads and railways should be designed by c
Data Loading...
