Research Article: Extensions to least-cost path algorithms for roadway planning
The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 29,065
Mitchell, J. S. B., Mount, D. M., & Papadimitriou, C. H. (1987) · SIAM Journal on Computing · doi:10.1137/0216045 · Cited by 720
Research works printed but not linked: 20
- BEMMELEN, J., VAN, QUAK W., HEKKEN, M. VAN and OOSTEROM, P. VAN. Vector vs. Raster-based algorithms for cross country movement planning. Proceedings of Auto Carlo 11. pp.304–317. Bethesda: American Congress on Surveying and Mapping.
- 10.1007/PL00009159 · doi:10.1007/pl00009159
- 10.1080/13658810050024304 · DOI · Paper page
- DOUGLAS D. H., 1994, Cartographica, 31, 37, 10.3138/D327-0323-2JUT-016M · DOI · Paper page
- 10.1016/0034-4257(95)00047-5 · DOI
- 10.1068/a090727 · DOI · Paper page
- 10.1080/136588198241554 · DOI · Paper page
- 10.1016/0004-3702(88)90054-9 · DOI
- O'FLAHERTY C. A., 1967, Highways
- OGLESBY, C. H. and HEWES, L. I. 1963.Highway Engineering, 2nd edition, 256–259. New York: John Wiley and Sons, Inc.
- 10.1016/0925-2312(94)00018-N · DOI
- STEFANAKIS E., 1995, COSIT, 95, 241
- 10.1137/S0097539799352759 · DOI
- 10.1016/S0736-5845(01)00018-7 · doi:10.1016/s0736-5845(01)00018-7
- 10.1111/j.0033-0124.1957.094_2.x · DOI · Paper page
- WEISS M. A., 1995, Algorithm, data structures, and problem solving with C++, 10.1145/219817.606642 · doi:10.1145/219817.606642
- 10.1016/0098-3004(94)90105-8 · DOI
- 10.1080/02693799508902031 · DOI · Paper page
- ZHAN C., 1993, COSIT, 93, 434
- 10.1080/13658810151072912 · doi:10.1080/13658810151072912
Cited by
Least-Cost modelling and landscape ecology: concepts, applications, and opportunities
Etherington, T. R. (2016) · Current Landscape Ecology Reports · doi:10.1007/s40823-016-0006-9 · Cited by 160
Taliaferro, M. S., Schriever, B. A., & Shackley, M. S. (2010) · Journal of Archaeological Science · doi:10.1016/j.jas.2009.10.018 · Cited by 54
Lewis, J. (2021) · Journal of Archaeological Method and Theory · doi:10.1007/s10816-021-09522-w · Cited by 53
Finding least-cost paths across a continuous raster surface with discrete vector networks
Choi, Y., Um, J.-G., & Park, M.-H. (2014) · Cartography and Geographic Information Science · doi:10.1080/15230406.2013.850837 · Cited by 13
Modelling the routes of seasonal transhumance movement in north neuquén (patagonia)
D’Abramo, S. L., Gonzalez, P. N., Perez, S. I., & Bernal, V. (2021) · Human Ecology · doi:10.1007/s10745-021-00246-9 · Cited by 12
“To apply the algorithm, it is necessary to describe the cost surfaces and the departure (start point) and arrival (end point) places (Yu et al. 2003).”
Method
Metadata
- Authors
- YU, C., LEE, J., & MUNRO-STASIUK, M. J.
- Venue
- International Journal of Geographical Information Science
- Publisher
- Informa UK Limited
- Published
- 2003-04
- Volume
- 17
- Issue
- 4
- Pages
- 361-376
- ISSN
- 0269-3798 (ISSN-L)
- 1365-8816
- 1362-3087
- OpenAlex
- W1988383368
- Cited by
- 118
- References
- 2
- FWCI
- 0.73
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Research Article: Extensions to least-cost path algorithms for roadway planning. https://app.cochat.ai/papers/10.1080/1365881031000072645
- The paper
- YU, C., LEE, J., & MUNRO-STASIUK, M. J. (2003). Research Article: Extensions to least-cost path algorithms for roadway planning. International Journal of Geographical Information Science. https://doi.org/10.1080/1365881031000072645
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.