The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Real-time city-scale ridesharing via linear assignment problems
Open accessAbstract
In this paper, we propose a novel, computational efficient, dynamic ridesharing algorithm. The beneficial computational properties of the algorithm arise from casting the ridesharing problem as a linear assignment problem between fleet vehicles and customer trip requests within a federated optimization architecture. The resulting algorithm is up to four times faster than the state-of-the-art, even if it is implemented on a less dedicated hardware, and achieves similar service quality. Current literature showcases the ability of state-of-the-art ridesharing algorithms to tackle very large fleets and customer requests in almost near real-time, but the benefits of ridesharing seem limited to centralized systems. Our algorithm suggests that this does not need to be the case. The algorithm that we propose is fully distributable among multiple ridesharing companies. By leveraging two datasets, the New York city taxi dataset and the Melbourne Metropolitan Area dataset, we show that with our algorithm, real-time ridesharing offers clear benefits with respect to more traditional taxi fleets in terms of level of service, even if one considers partial adoption of the system. In fact, e.g., the quality of the solutions obtained in the state-of-the-art works that tackle the whole customer set of the New York city taxi dataset is achieved, even if one considers only a proportion of the fleet size and customer requests. This could make real-time urban-scale ridesharing very attractive to small enterprises and city authorities alike. However, in some cases, e.g., in multi-company scenarios where companies have predefined market shares, we show that the number of vehicles needed to achieve a comparable performance to the monopolistic setting increases, and this raises concerns on the possible negative effects of multi-company ridesharing.
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
Edge computing: Vision and challenges
Shi, W., Cao, J., Zhang, Q., Li, Y., & Xu, L. (2016) · IEEE Internet of Things Journal · doi:10.1109/jiot.2016.2579198 · Cited by 8,733
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 · cited 1×
“Autonomous vehicles could be beneficial for shared mobility systems, in the near future (Chen et al. 2016, Farhan & Chen 2018, Krueger et al. 2016, Levin 2017, Ma et al. 2017, Nazari et al. 2018).”
BackgroundChen, T. D., Kockelman, K. M., & Hanna, J. P. (2016) · Transportation Research Part A: Policy and Practice · doi:10.1016/j.tra.2016.08.020 · Cited by 529 · cited 1×
“be beneficial for shared mobility systems, in the near future (Chen et al. 2016, Farhan & Chen 2018, Krueger et al. 2016, Levin 2017, Ma et al. 2017, Nazari et al. 2018). In (Lokhandwala & Cai 2018), an agent-based model evaluates the environmental and energy benefits of ride sharing using traditional and autonomous t…”
MethodUnderstanding ridesplitting behavior of on-demand ride services: An ensemble learning approach
Chen, X. (., Zahiri, M., & Zhang, S. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2016.12.018 · Cited by 252 · cited 1×
“…& Gao 2018) (e.g. for regular travelers such as commuters (Liu & Li 2017, Ma & Zhang 2017)), the study of the changes in travel patterns induced by such ridesharing systems (Dong et al. 2018), and the consideration of ridesplitting as a binary classification problem (Chen, Zahiri & Zhang 2017).”
BackgroundDynamic ride sharing using traditional taxis and shared autonomous taxis: A case study of NYC
Lokhandwala, M., & Cai, H. (2018) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2018.10.007 · Cited by 246
Congestion-aware system optimal route choice for shared autonomous vehicles
Levin, M. W. (2017) · Transportation Research Part C: Emerging Technologies · doi:10.1016/j.trc.2017.06.020 · Cited by 152
Cited by
Ridesourcing systems: A framework and review
Wang, H., & Yang, H. (2019) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2019.07.009 · Cited by 538
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
Gueriau, M., Cugurullo, F., Acheampong, R. A., & Dusparic, I. (2020) · IEEE Intelligent Transportation Systems Magazine · doi:10.1109/mits.2020.3014417 · Cited by 15
Metadata
- Authors
- Simonetto, A., Monteil, J., & Gambella, C.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2019-04
- Volume
- 101
- Pages
- 208-232
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2916868346
- Cited by
- 196
- References
- 6
- FWCI
- 10.87
- Type
- journal article
- Language
- en
- Open access
- green
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.