The DOI matches its Crossref record; 24 of the 24 references it cites were found in a registry or an index.
Quantifying the benefits of vehicle pooling with shareability networks
Open accessAbstract
Significance: Recent advances in information technologies have increased our participation in “sharing economies,” where applications that allow networked, real-time data exchange facilitate the sharing of living spaces, equipment, or vehicles with others. However, the impact of large-scale sharing on sustainability is not clear, and a framework to assess its benefits quantitatively is missing. For this purpose, we propose the method of shareability networks, which translates spatio-temporal sharing problems into a graph-theoretic framework that provides efficient solutions. Applying this method to a dataset of 150 million taxi trips in New York City, our simulations reveal the vast potential of a new taxi system in which trips are routinely shareable while keeping passenger discomfort low in terms of prolonged travel time.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Graph evolution: Densification and shrinking diameters
Leskovec, J., Kleinberg, J., & Faloutsos, C. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217301 · Cited by 2,461
Approximation algorithms for combinatorial problems
Johnson, D. S. (1974) · Journal of Computer and System Sciences · doi:10.1016/s0022-0000(74)80044-9 · Cited by 2,197
Stowman, K. (1949) · The Milbank Memorial Fund Quarterly · doi:10.2307/3348165 · Cited by 2,096
Empirical Analysis of an Evolving Social Network
Kossinets, G., & Watts, D. J. (2006) · Science · doi:10.1126/science.1116869 · Cited by 1,723
Batty, M. (2013) · doi:10.7551/mitpress/9399.001.0001 · Cited by 1,700
What's mine is yours: the rise of collaborative consumption
(2011) · Choice Reviews Online · doi:10.5860/choice.48-3364 · Cited by 1,438
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
Shaw, P. (1998) · Lecture Notes in Computer Science · doi:10.1007/3-540-49481-2_30 · Cited by 1,366
(2012) · Choice Reviews Online · doi:10.5860/choice.49-6620 · Cited by 1,273
(2010) · Medical Entomology and Zoology · Cited by 1,239
Dynamic pickup and delivery problems
Berbeglia, G., Cordeau, J.-F., & Laporte, G. (2010) · European Journal of Operational Research · doi:10.1016/j.ejor.2009.04.024 · Cited by 679
T-share: A large-scale dynamic taxi ridesharing service
Ma, S., Zheng, Y., & Wolfson, O. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544843 · Cited by 636
Efficient algorithms for finding maximum matching in graphs
Galil, Z. (1986) · ACM Computing Surveys · doi:10.1145/6462.6502 · Cited by 461
THE ECONOMICS OF TRAFFIC CONGESTIONPreprint
Arnott, R., & Small, K. A. (1993) · RePEc: Research Papers in Economics · Cited by 415
Caiazzo, F., Ashok, A., Waitz, I. A., Yim, S. H. L., & Barrett, S. R. H. (2013) · Atmospheric Environment · doi:10.1016/j.atmosenv.2013.05.081 · Cited by 395
Real-Time Multivehicle Truckload Pickup and Delivery Problems
Yang, J., Jaillet, P., & Mahmassani, H. (2004) · Transportation Science · doi:10.1287/trsc.1030.0068 · Cited by 280
John, N. A. (2013) · The Communication Review · doi:10.1080/10714421.2013.807119 · Cited by 239
Teal, R. F. (1987) · Transportation Research Part A: General · doi:10.1016/0191-2607(87)90014-8 · Cited by 195
Taxi-Aware Map: Identifying and Predicting Vacant Taxis in the City
Phithakkitnukoon, S., Veloso, M., Bento, C. L., Biderman, A., & Ratti, C. (2010) · Lecture notes in computer science · doi:10.1007/978-3-642-16917-5_9 · Cited by 143
Self-citationAirport management: taxi planning
Marín, Á. (2006) · Annals of Operations Research · doi:10.1007/s10479-006-7381-2 · Cited by 138
METHODOLOGY FOR SHORT-RANGE TRAVEL DEMAND PREDICTIONS. ANALYSIS OF CARPOOLING INCENTIVES
Ben-Akiva, M. E., & Atherton, T. J. (1977) · Journal of Transport Economics and Policy · Cited by 69
‘Shift – the way you move’: reconstituting automobility
Dowling, R., & Simpson, C. (2013) · Continuum · doi:10.1080/10304312.2013.772111 · Cited by 45
Ride Sharing: Psychological Factors
Dueker, K., Levin, I. P., & Bair, B. O. (1977) · Transportation Engineering Journal of ASCE · doi:10.1061/tpejan.0000664 · Cited by 40
Flexible Ridesharing: New Opportunities and Service Concepts for Sustainable Mobility
Handke, V., & Jonuschat, H. (2013) · doi:10.1007/978-3-642-11345-1 · Cited by 21
Cited by
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
Rayle, L., Dai, D., Chan, N., Cervero, R., & Shaheen, S. (2016) · Transport Policy · doi:10.1016/j.tranpol.2015.10.004 · Cited by 1,118
Human mobility: Models and applications
Barbosa, H., Barthelemy, M., Ghoshal, G., James, C. R., Lenormand, M., Louail, T., Menezes, R., Ramasco, J. J., Simini, F., & Tomasini, M. (2018) · Physics Reports · doi:10.1016/j.physrep.2018.01.001 · Cited by 1,027
Planning and Decision-Making for Autonomous Vehicles
Schwarting, W., Alonso-Mora, J., & Rus, D. (2018) · Annual Review of Control, Robotics, and Autonomous Systems · doi:10.1146/annurev-control-060117-105157 · Cited by 972
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
Metadata
- Authors
- Santi, P., Resta, G., Szell, M., Sobolevsky, S., Strogatz, S. H., & Ratti, C.
- Venue
- Proceedings of the National Academy of Sciences
- Published
- 2014-09-02
- Volume
- 111
- Issue
- 37
- Pages
- 13290-13294
- ISSN
- 0027-8424 (ISSN-L)
- 1091-6490
- OpenAlex
- W2156767060
- Cited by
- 745
- References
- 24
- FWCI
- 47.80
- Type
- journal article
- Language
- en
- Open access
- bronze
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.