Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 885

The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.

Ridesharing: The state-of-the-art and future directions

Open access
Furuhata, Masabumi, Dessouky, Maged, Ordóñez, Fernando, Brunet, Marc-Etienne, Wang, Xiaoqing, Koenig, Sven·2013·Transportation Research Part B: Methodological

Abstract

Although ridesharing can provide a wealth of benefits, such as reduced travel costs, congestion, and consequently less pollution, there are a number of challenges that have restricted its widespread adoption. In fact, even at a time when improving communication systems provide real-time detailed information that could be used to facilitate ridesharing, the share of work trips that use ridesharing has decreased by almost 10% in the past 30years.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.trb.2013.08.012

Cites

3 of 3 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Research works printed but not linked: 48

  1. Agatz, 2011, Dynamic ride-sharing: a simulation study in Metro Atlanta, Transportation Research Part B, 45, 1450, 10.1016/j.trb.2011.05.017 · DOI · Paper page
  2. Agatz, 2012, Optimization for dynamic ride-sharing: a review, European Journal of Operational Research, 223, 295, 10.1016/j.ejor.2012.05.028 · DOI · Paper page
  3. Amey, 2010, The importance of a common data specification for ridesharing, TDM Review, 17, 19
  4. Amey, 2010, Integrating information on ridesahring opportunities with travel information from other modes, TDM Review, 17, 18
  5. Amey, A.M. 2010c. Real-Time Ridesharing: Exploring the Opportunities and Challenges of Designing a Technology-based Rideshare Trial for MIT Community. Master’s Thesis, Department of Urban Studies and Planning and Department of Civil and Environmental Engineering, Massachusetts Institute of Technology, MA, USA.
  6. Amey, 2011, Real-time ridesharing: opportunities and challenges in using mobile phone technology to improve rideshare services, Transportation Research Record: Journal of the Transportation Research Board, 2217, 103, 10.3141/2217-13 · DOI
  7. Bar-Gera, 2010, Traffic assignment by paired alternative segments, Transportation Research Part B, 44, 1022, 10.1016/j.trb.2009.11.004 · DOI
  8. Beaudry, 2010, Dynamic transportation of patients in hospitals, OR spectrum, 32, 77, 10.1007/s00291-008-0135-6 · DOI
  9. Berbeglia, 2010, Dynamic pickup and delivery problems, European Journal of Operational Research, 202, 8, 10.1016/j.ejor.2009.04.024 · DOI · Paper page
  10. Beroldo, 1991, Ridemaching system effectiveness: a coast-to-coast perspective, Transportation Research Record, 1321, 7
  11. Buliung, 2010, Catching a ride on the information super-highway: toward an understanding of internet-based carpool formation and use, Transportation, 37, 849, 10.1007/s11116-010-9266-0 · DOI
  12. Chan, 2012, Ridesharing in North America: past, present, and future, Transport Reviews, 32, 93, 10.1080/01441647.2011.621557 · DOI · Paper page
  13. Charles, 2006, Relational costs and the production of social capital: evidence from carpooling, The Economic Journal, 116, 581, 10.1111/j.1468-0297.2006.01093.x · DOI
  14. Chaube, V., Kavanaugh, A.L., Pérez-Quiñones, M.A. 2010. Leveraging social networks to embed trust in rideshare programs. In: Proceedings of the Hawaii International Conference on System Sciences (HICSS), pp. 1–8.
  15. Chowhdry, 1991, Multimarket trading and market liquidity, The Review of Financiail Studies, 4, 483, 10.1093/rfs/4.3.483 · DOI
  16. Clarke, 1971, Multipart pricing of public goods, Public Choice, 11, 17, 10.1007/BF01726210 · DOI · Paper page
  17. Dailey, 1999, Seattle smart traveler: dynamic ridematching on the world wide web, Transportation Research Part C, 7, 17, 10.1016/S0968-090X(99)00007-8 · DOI · Paper page
  18. Deakin, 2010, Markets for dynamic ridesharing?, Transportation Research Record: Journal of the Transportation Research Board, 2187, 131, 10.3141/2187-17 · DOI · Paper page
  19. Dellarocas, C., 2006. Reputation mechanisms. In: Hendershott, T. (Ed.), Handbook on Information Systems and Economics. Elsevier, pp. 629–659. · DOI
  20. Drews, F., Luxen, D., 2013. Multi-hop ride sharing. In: Proceedings of the Sixth Annual Symposium on Combinatorial Search, pp. 71–79. · DOI
  21. Ferguson, 1997, The rise and fall of the American carpool: 1970–1990, Transportation, 24, 349, 10.1023/A:1004928012320 · DOI
  22. Foucault, 2008, Competition for order flow and smart order routing systems, The Journal of Finance, 63, 119, 10.1111/j.1540-6261.2008.01312.x · DOI
  23. Frisk, 2010, Cost allocation in collaborative forest transportation, European Journal of Operational Research, 205, 448, 10.1016/j.ejor.2010.01.015 · DOI
  24. Gerding, E.H., Robu, V., Stein, S., Parkes, D.C., Rogers, A., Jennings, N.R., 2011. Online mechanism design for electric vehicle charging. In: Proceedings of the International Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pp. 811–818.
  25. Groves, 1973, Incentives in teams, Econometrica, 41, 617, 10.2307/1914085 · DOI · Paper page
  26. Heinrich, S., 2010. Implementing Real-Time Ridesharing in the San Francisco Bay Area. Master’s Thesis, Mineta Transportation Institute, San Jose State University, CA, USA.
  27. Herbawi, W., Weber, M., 2011. Evolutionary computation in combinatorial optimization. In: Merz, P., Hao, J.K. (Eds.), Lecture Notes in Computer Science, vol. 6622. Springer, Berlin Heidelberg, pp. 84–95.
  28. Herbawi, W., Weber, M., 2012. The ridematching problem with time windows in dynamic ridesharing: a model and a genetic algorithmIn: Proceedings ACM Genetic and Evolutionary Computation Conference (GECCO), pp. 1–8. · DOI
  29. Jøsang, 2007, A survey of trust and reputation systems for online service provision, Decision Support Systems, 43, 618, 10.1016/j.dss.2005.05.019 · DOI · Paper page
  30. Juda, 2009, An options-based solution to the sequential auction problem, Journal of Artificial Intelligence, 173, 876, 10.1016/j.artint.2009.01.002 · DOI
  31. Jurca, R., Faltings, B., 2003. An incentive compatible reputation mechanism. In: Proceedings of the IEEE International Conference on E-Commerce (CEC), pp. 285–292. · DOI
  32. Kamar, E., Horvitz, E., 2009. Collaboration and shared plans in the open world: studies of ridesharing. In: Proceedings of the International Joint Conference on Artificial Intelligence (IJCAI), pp. 187–194.
  33. Kelley, 2007, Casual carpooling enhanced, Journal of Public Transportation, 10, 119, 10.5038/2375-0901.10.4.6 · DOI
  34. Kleiner, A., Nebel, B., Ziparo, V.A., 2011. A mechanism for dynamic ride sharing based on parallel auctions. In: Proceedings of the international joint conference on Artificial intelligence (IJCAI), pp. 266–272.
  35. Konishi, 2010, Carpooling and congestion pricing: HOV and HOT lanes, Regional Science and Urban Economics, 40, 173, 10.1016/j.regsciurbeco.2010.03.009 · DOI
  36. Lu, 2006, A new insertion-based construction heuristic for solving the pickup and delivery problem with hard time windows, European Journal of Operational Research, 175, 672, 10.1016/j.ejor.2005.05.012 · DOI
  37. Morency, 2007, The ambivalence of ridesharing, Transportation, 34, 239, 10.1007/s11116-006-9101-9 · DOI
  38. Muthukrishnan, S., 2009. Ad exchanges: research issues. In: Leonardi, S. (Ed.), Internet and Network Economics. Lecture Notes in Computer Science, vol. 5929. Springer, Berlin Heidelberg, pp. 1–12. · DOI
  39. Parkes, D.C., 2007. Online mechanisms. In: Nisan, N., Roughgarden, T., Tardos, E., Vazirani, V. (Eds.), Algorithmic Game Theory. Cambridge University Press, pp. 411–439 (Chapter 16). · DOI
  40. Resnick, P., Zeckhauser, R., 2002. Trust among strangers in internet transactions: Empirical analysis of eBay’s reputation system. In: Baye, M.R. (Ed.), The Economics of the Internet and E-Commerce, vol. 11. pp. 127–157. · DOI · Paper page
  41. Small, 2001, The value of “value pricing” of roads: second-best pricing and product differentiation, Journal of Urban Economics, 49, 310, 10.1006/juec.2000.2195 · DOI
  42. Spielberg, 2000, Mating habits of slugs: dynamic carpool formation in the I-95/I-395 corridor of northern virginia, Transportation Research Record, 1711, 31, 10.3141/1711-05 · DOI
  43. Teal, 1987, Carpooling: who, how and why, Transportation Research Part A, 21, 203, 10.1016/0191-2607(87)90014-8 · DOI
  44. Verhoef, 2004, Product differentiation on roads: constrained congestion pricing with heterogeneous users, Journal of Transport Economics and Policy, 38, 127
  45. Winter, 2006, Ad hoc shared-ride trip planning by mobile geosensor networks, International Journal of Geographical Information Science, 20, 899, 10.1080/13658810600816664 · DOI
  46. Witkowski, J., Seuken, S., Parkes, D.C., 2011. Incentive-compatible escrow mechanisms. In: Proceedings of the AAAI Conference on Artificial Intelligence (AAAI), pp. 751–757. · DOI
  47. Xiang, 2008, The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments, European Journal of Operational Research, 185, 534, 10.1016/j.ejor.2007.01.007 · DOI
  48. Yang, 1999, Carpooling and congestion pricing in a multilane highway with high-occupancy-vehicle lanes, Transportation Research Part A, 33, 139

Cited by

See all 885

Metadata

Authors
Furuhata, M., Dessouky, M., Ordóñez, F., Brunet, M.-E., Wang, X., & Koenig, S.
Venue
Transportation Research Part B: Methodological
Publisher
Elsevier BV
Published
2013-11
Volume
57
Pages
28-46
ISSN
0191-2615 (ISSN-L)
OpenAlex
W2163599294
Cited by
885
References
3
FWCI
48.74
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.