The DOI matches its Crossref record; 60 of the 60 references it cites were found in a registry or an index.
Dynamic shared autonomous taxi system considering on-time arrival reliability
Abstract
Abstract Dynamic shared autonomous taxi (SAT) systems are regarded as a promising means of improving travel flexibility. With no human drivers, SATs urgently require precise traffic information in order to plan accurate paths independently; in addition, on-time arrival is an essential service quality in SAT systems. In this study, taxis are assumed to be replaced with ride-sharing autonomous vehicles. To improve the probability of on-time arrival, the reliable path concept and collected travel time information are used to facilitate path finding for SATs, and the potential benefits are examined. Two simulation scenarios—one based on historical traffic information and the other based on real-time traffic information—are executed to evaluate the information’s usefulness in reliable path finding. In simulation results, reliable path scenarios showed a higher on-time arrival ratio than shortest path scenarios, in which the shortest path algorithm is used in path finding for SATs, and the historical information-based scenarios showed a higher on-time arrival ratio than the real-time information-based scenarios. A system-beneficial path finding method is proposed and is verified to be effective for mitigating road network congestion.
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Similarly, historical traffic information based scenario results in a higher on-time arrival ratio than real-time traffic information based scenario.”
From Shared autonomous vehicle services: A comprehensive review (2020) · cites this paper as Liu et al. (2019)
In the citing paper
“Results from the study shows that the reliable path algorithm results in a higher on-time arrival ratio than the shortest path algorithm.”
From Shared autonomous vehicle services: A comprehensive review (2020) · cites this paper as Liu et al. (2019)
Citations
Cites
Finding the K Shortest Loopless Paths in a Network
Yen, J. Y. (1971) · Management Science · doi:10.1287/mnsc.17.11.712 · Cited by 2,618
Influence of connected and autonomous vehicles on traffic flow stability and throughput
Talebpour, A., & Mahmassani, H. S. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.07.007 · Cited by 1,388
On-demand high-capacity ride-sharing via dynamic trip-vehicle assignment
Alonso-Mora, J., Samaranayake, S., Wallar, A., Frazzoli, E., & Rus, D. (2017) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1611675114 · Cited by 1,186
Fagnant, D. J., & Kockelman, K. M. (2014) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2013.12.001 · Cited by 1,177
Assessing public opinions of and interest in new vehicle technologies: An Austin perspective
Bansal, P., Kockelman, K. M., & Singh, A. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.01.019 · Cited by 1,025
Discrete Choice Methods and their Applications to Short Term Travel Decisions
Ben-Akiva, M., & Bierlaire, M. (1999) · International Series in Operations Research & Management Science · doi:10.1007/978-1-4615-5203-1_2 · Cited by 908
Preferences for shared autonomous vehicles
Krueger, R., Rashidi, T. H., & Rose, J. M. (2016) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.06.015 · Cited by 861
(2015) · Transportation Research Board 94th Annual MeetingTransportation Research Board · Cited by 854
Greenberg, H. (1959) · Operations Research · doi:10.1287/opre.7.1.79 · Cited by 738
A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Cordeau, J.-F. (2006) · Operations Research · doi:10.1287/opre.1060.0283 · Cited by 695
Research works printed but not linked: 2
- Lioris, 2016, Dynamic evaluation and optimisation of an urban collective taxis system by discrete-event simulation, World Congr. Intell. Transp. Syst.
- Liu, 2018, An agent-based simulation model for shared autonomous taxi system, Asian Transp. Stud., 5, 1
Cited by
Shared autonomous vehicle services: A comprehensive review
Narayanan, S., Chaniotakis, E., & Antoniou, C. (2020) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2019.12.008 · Cited by 691
Metadata
- Authors
- Liu, Z., Miwa, T., Zeng, W., Bell, M. G. H., & Morikawa, T.
- Affiliations
- Nagoya University (JP)
- Institute of Materials and Systems for Sustainability, Nagoya University (JP)
- Guangdong University of Technology (CN)
- The University of Sydney (AU)
- Institutes of Innovation for Future Society, Nagoya University (JP)
- Corresponding author
- Liu, Zhiguang
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2019-06
- Volume
- 103
- Pages
- 281-297
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2941854170
- Cited by
- 48
- References
- 60
- Citations by year
- 2026: 5 · 2025: 1 · 2024: 5 · 2023: 11 · 2022: 5 · 2021: 13 · 2020: 6 · 2019: 2
- FWCI
- 2.97
- Type
- journal article
- Language
- en
- Open access
- closed
- Licence
- www.elsevier.com/tdm/userlicense/1.0/ (tdm)
- www.elsevier.com/legal/tdmrep-license (tdm)
- Locations
- Transportation Research Part C Emerging Technologies (publishedVersion)
- Funders
- JSPS KAKENHI (16H02367, 16K12825)
- National Natural Science Foundation of China (61803100)
- China Scholarship Council
- Topics
- Social Sciences › Transportation › Transportation and Mobility Innovations
- Social Sciences › Transportation › Transportation Planning and Optimization
- Physical Sciences › Engineering › Control and Systems Engineering › Traffic control and management
- Keywords
- autonomous vehicles, ride-sharing, travel time information, real-time traffic information, shortest path, road network congestion, path planning
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: Dynamic shared autonomous taxi system considering on-time arrival reliability. https://app.cochat.ai/papers/10.1016/j.trc.2019.04.018
- The paper
- Liu, Z., Miwa, T., Zeng, W., Bell, M. G. H., & Morikawa, T. (2019). Dynamic shared autonomous taxi system considering on-time arrival reliability. Transportation Research Part C: Emerging Technologies. https://doi.org/10.1016/j.trc.2019.04.018
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.