The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
The Fastest Path through a Network with Random Time-Dependent Travel Times
Abstract
This paper introduces the problem of finding the least expected travel time path between two nodes in a network with travel times that are both random and time-dependent (e.g., a truck, rail, air or bus network). It first shows that standard shortest path algorithms (such as the Dijkstra algorithm) do not find the minimum expected travel time path on such a network, then proposes a method which does find the minimum path. Next, this paper shows that the optimal “route choice” is not a simple path but an adaptive decision rule. The best route from any given node to the final destination depends on the arrival time at that node. Because the arrival time is not known before departing the origin, a better route can be selected by deferring the final choice until later nodes are reached. A method for finding the optimal adaptive decision rule is proposed.
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
Cites
A note on two problems in connexion with graphs
Dijkstra, E. W. (1959) · Numerische Mathematik · doi:10.1007/bf01386390 · Cited by 24,043
Bellman, R. E. (2010) · doi:10.1515/9781400835386 · Cited by 14,588
Combinatorial optimization: networks and matroids
Lawler, E. L. (2021) · Cited by 3,359
Bellman, R. (1958) · Quarterly of Applied Mathematics · doi:10.1090/qam/102435 · Cited by 2,758
An Appraisal of Some Shortest-Path Algorithms
Dreyfus, S. E. (1969) · Operations Research · doi:10.1287/opre.17.3.395 · Cited by 1,002
Letter to the Editor—An Algorithm for Ranking all the Assignments in Order of Increasing Cost
Murty, K. G. (1968) · Operations Research · doi:10.1287/opre.16.3.682 · Cited by 552
Dial, R. B. (1967) · Highway Research Record · Cited by 97
A PUBLIC TRANSPORT ASSIGNMENT METHOD
Clerq, F. P. (1972) · Cited by 38
Cited by
A survey on dynamic and stochastic vehicle routing problems
Ritzinger, U., Puchinger, J., & Hartl, R. F. (2016) · International Journal of Production Research · doi:10.1080/00207543.2015.1043403 · Cited by 443
Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Dror, M., Laporte, G., & Trudeau, P. (1989) · Transportation Science · doi:10.1287/trsc.23.3.166 · Cited by 286
Time-dependent routing problems: A review
Gendreau, M., Ghiani, G., & Guerriero, E. (2015) · Computers & Operations Research · doi:10.1016/j.cor.2015.06.001 · Cited by 253
Effect of Real-Time Transit Information on Dynamic Path Choice of Passengers
Cats, O., Koutsopoulos, H. N., Burghout, W., & Toledo, T. (2011) · Transportation Research Record: Journal of the Transportation Research Board · doi:10.3141/2217-06 · Cited by 108
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
Metadata
- Authors
- Hall, R. W.
- Venue
- Transportation Science
- Published
- 1986-08
- Volume
- 20
- Issue
- 3
- Pages
- 182-188
- ISSN
- 0041-1655 (ISSN-L)
- 1526-5447
- OpenAlex
- W2034204928
- Cited by
- 404
- References
- 8
- FWCI
- 8.81
- 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.