Research Article: Extensions to least-cost path algorithms for roadway planning

Abstract

Finding a least-cost-path in a raster data format is a useful function in geographical information systems. However, existing algorithms are often inadequate for practical roadway planning. This paper improves conventional algorithms by including the considerations of spatial distances, anisotropic costs and the presence of bridges and tunnels in the paths. This new algorithm is implemented in JAVA to run with actual remote sensing and DEM data. The experimental results show that this approach produces realistic least-cost paths for practical roadway planning.

DOI: 10.1080/1365881031000072645

Extracted Key Phrases

10 Figures and Tables

Cite this paper

@article{Yu2003ResearchAE, title={Research Article: Extensions to least-cost path algorithms for roadway planning}, author={Chaoqing Yu and Jay Lee and Mandy J. Munro-Stasiuk}, journal={International Journal of Geographical Information Science}, year={2003}, volume={17}, pages={361-376} }