The DOI matches its Crossref record.
Finding the K Shortest Loopless Paths in a Network
Abstract
This paper presents an algorithm for finding the K loopless paths that have the shortest lengths from one node to another node in a network. The significance of the new algorithm is that its computational upper bound increases only linearly with the value of K. Consequently, in general, the new algorithm is extremely efficient as compared with the algorithms proposed by Bock, Kantner, and Haynes [2], Pollack [7], [8], Clarke, Krikorian, and Rausan [3], Sakarovitch [9] and others. This paper first reviews the algorithms presently available for finding the K shortest loopless paths in terms of the computational effort and memory addresses they require. This is followed by the presentation of the new algorithm and its justification. Finally, the efficiency of the new algorithm is examined and compared with that of other algorithms.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Cited by
The trade-off between taxi time and fuel consumption in airport ground movement
Ravizza, S., Chen, J., Atkin, J. A. D., Burke, E. K., & Stewart, P. (2013) · Public Transport · doi:10.1007/s12469-013-0060-1 · Cited by 81
Estimating multi-year 24 / 7 origin-destination demand using high-granular multi-source traffic data
Ma, W., & Qian, Z. (. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.09.002 · Cited by 56
Dynamic shared autonomous taxi system considering on-time arrival reliability
Liu, Z., Miwa, T., Zeng, W., Bell, M. G. H., & Morikawa, T. (2019) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.04.018 · Cited by 48
Abstractive Timeline Summarization
Steen, J., & Markert, K. (2019) · Proceedings of the 2nd Workshop on New Frontiers in Summarization · doi:10.18653/v1/d19-5403 · Cited by 34
Synthesising executable gene regulatory networks from single-cell gene expression data
Fisher, J., Köksal, A. S., Piterman, N., & Woodhouse, S. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-21690-4_38 · Cited by 18
Metadata
- Authors
- Yen, J. Y.
- Venue
- Management Science
- Published
- 1971-07
- Volume
- 17
- Issue
- 11
- Pages
- 712-716
- ISSN
- 0025-1909 (ISSN-L)
- 1526-5501
- OpenAlex
- W2011282943
- Cited by
- 2,618
- References
- 0
- FWCI
- 1.70
- 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
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.
