IDEAS home Printed from https://ideas.repec.org/a/kap/transp/v45y2018i6d10.1007_s11116-018-9957-5.html
   My bibliography  Save this article

A modeling approach for matching ridesharing trips within macroscopic travel demand models

Author

Listed:
  • Markus Friedrich

    (University of Stuttgart)

  • Maximilian Hartl

    (University of Stuttgart)

  • Christoph Magg

    (University of Stuttgart)

Abstract

State of the art travel demand models for urban areas typically distinguish four or five main modes: walking, cycling, public transport and car. The mode car can be further split into car-driver and car-passenger. As the importance of ridesharing may increase in the coming years, ridesharing should be addressed as an additional sub or main mode in travel demand modeling. This requires an algorithm for matching the trips of suppliers (typically car drivers) and demanders (travelers of non-car modes). The paper presents a matching algorithm, which can be integrated in existing travel demand models. The algorithm works likewise with integer demand, which is typical for agent-based microscopic models, and with non-integer demand occurring in travel demand matrices of a macroscopic model. The algorithm compares two path sets of suppliers and demanders. The representation of a path in the road network is reduced from a sequence of links to a sequence of zones. The zones act as a buffer along the path, where demanders can be picked up. The travel demand model of the Stuttgart Region serves as an application example. The study estimates that the entire travel demand of all motorized modes in the Stuttgart Region could be transported by 7% of the current car fleet with 65% of the current vehicle distance traveled, if all travelers were willing to either use ridesharing vehicles with 6 seats or traditional rail.

Suggested Citation

  • Markus Friedrich & Maximilian Hartl & Christoph Magg, 2018. "A modeling approach for matching ridesharing trips within macroscopic travel demand models," Transportation, Springer, vol. 45(6), pages 1639-1653, November.
  • Handle: RePEc:kap:transp:v:45:y:2018:i:6:d:10.1007_s11116-018-9957-5
    DOI: 10.1007/s11116-018-9957-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11116-018-9957-5
    File Function: Abstract
    Download Restriction: Access to full text is restricted to subscribers.

    File URL: https://libkey.io/10.1007/s11116-018-9957-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Roberto Baldacci & Vittorio Maniezzo & Aristide Mingozzi, 2004. "An Exact Method for the Car Pooling Problem Based on Lagrangean Column Generation," Operations Research, INFORMS, vol. 52(3), pages 422-439, June.
    2. Agatz, Niels & Erera, Alan & Savelsbergh, Martin & Wang, Xing, 2012. "Optimization for dynamic ride-sharing: A review," European Journal of Operational Research, Elsevier, vol. 223(2), pages 295-303.
    3. Itf, 2015. "Urban Mobility System Upgrade: How shared self-driving cars could change city traffic," International Transport Forum Policy Papers 6, OECD Publishing.
    4. Bansal, Prateek & Kockelman, Kara M., 2017. "Forecasting Americans’ long-term adoption of connected and autonomous vehicle technologies," Transportation Research Part A: Policy and Practice, Elsevier, vol. 95(C), pages 49-63.
    5. Agatz, Niels A.H. & Erera, Alan L. & Savelsbergh, Martin W.P. & Wang, Xing, 2011. "Dynamic ride-sharing: A simulation study in metro Atlanta," Transportation Research Part B: Methodological, Elsevier, vol. 45(9), pages 1450-1464.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Nadine Kostorz & Eva Fraedrich & Martin Kagerbauer, 2021. "Usage and User Characteristics—Insights from MOIA, Europe’s Largest Ridepooling Service," Sustainability, MDPI, vol. 13(2), pages 1-18, January.
    2. Mark Muller & Seri Park & Ross Lee & Brett Fusco & Gonçalo Homem de Almeida Correia, 2021. "Review of Whole System Simulation Methodologies for Assessing Mobility as a Service (MaaS) as an Enabler for Sustainable Urban Mobility," Sustainability, MDPI, vol. 13(10), pages 1-15, May.
    3. Kucharski, Rafał & Cats, Oded, 2020. "Exact matching of attractive shared rides (ExMAS) for system-wide strategic evaluations," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 285-310.
    4. Johann Hartleb & Markus Friedrich & Emely Richter, 2022. "Vehicle scheduling for on-demand vehicle fleets in macroscopic travel demand models," Transportation, Springer, vol. 49(4), pages 1133-1155, August.
    5. Wang, Jiangbo & Yamamoto, Toshiyuki & Liu, Kai, 2021. "Spatial dependence and spillover effects in customized bus demand: Empirical evidence using spatial dynamic panel models," Transport Policy, Elsevier, vol. 105(C), pages 166-180.
    6. Rajendran, Suchithra & Srinivas, Sharan, 2020. "Air taxi service for urban mobility: A critical review of recent developments, future challenges, and opportunities," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 143(C).
    7. André Palma & Lucas Javaudin & Patrick Stokkink & Léandre Tarpin-Pitre, 2024. "Ride-sharing with inflexible drivers in the Paris metropolitan area," Transportation, Springer, vol. 51(3), pages 963-986, June.
    8. André de Palma & Lucas Javaudin & Patrick Stokkink & Léandre Tarpin-Pitre, 2021. "Modelling Ridesharing in a Large Network with Dynamic Congestion," THEMA Working Papers 2021-16, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Hosni, Hadi & Naoum-Sawaya, Joe & Artail, Hassan, 2014. "The shared-taxi problem: Formulation and solution methods," Transportation Research Part B: Methodological, Elsevier, vol. 70(C), pages 303-318.
    2. Wang, Jing-Peng & Ban, Xuegang (Jeff) & Huang, Hai-Jun, 2019. "Dynamic ridesharing with variable-ratio charging-compensation scheme for morning commute," Transportation Research Part B: Methodological, Elsevier, vol. 122(C), pages 390-415.
    3. Masoud, Neda & Jayakrishnan, R., 2017. "A decomposition algorithm to solve the multi-hop Peer-to-Peer ride-matching problem," Transportation Research Part B: Methodological, Elsevier, vol. 99(C), pages 1-29.
    4. Amirmahdi Tafreshian & Neda Masoud & Yafeng Yin, 2020. "Frontiers in Service Science: Ride Matching for Peer-to-Peer Ride Sharing: A Review and Future Directions," Service Science, INFORMS, vol. 12(2-3), pages 44-60, June.
    5. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef, 2021. "Real-time ride-sharing framework with dynamic timeframe and anticipation-based migration," European Journal of Operational Research, Elsevier, vol. 288(3), pages 810-828.
    6. Mohammad Asghari & Seyed Mohammad Javad Mirzapour Al-E-Hashem & Yacine Rekik, 2022. "Environmental and social implications of incorporating carpooling service on a customized bus system," Post-Print hal-03598768, HAL.
    7. Naoum-Sawaya, Joe & Cogill, Randy & Ghaddar, Bissan & Sajja, Shravan & Shorten, Robert & Taheri, Nicole & Tommasi, Pierpaolo & Verago, Rudi & Wirth, Fabian, 2015. "Stochastic optimization approach for the car placement problem in ridesharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 80(C), pages 173-184.
    8. Omer Faruk Aydin & Ilgin Gokasar & Onur Kalan, 2020. "Matching algorithm for improving ride-sharing by incorporating route splits and social factors," PLOS ONE, Public Library of Science, vol. 15(3), pages 1-23, March.
    9. Arslan, A.M. & Agatz, N.A.H. & Kroon, L.G. & Zuidwijk, R.A., 2016. "Crowdsourced Delivery: A Dynamic Pickup and Delivery Problem with Ad-hoc Drivers," ERIM Report Series Research in Management ERS-2016-003-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.
    10. Long, Jiancheng & Tan, Weimin & Szeto, W.Y. & Li, Yao, 2018. "Ride-sharing with travel time uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 118(C), pages 143-171.
    11. Xing Wang & Niels Agatz & Alan Erera, 2018. "Stable Matching for Dynamic Ride-Sharing Systems," Transportation Science, INFORMS, vol. 52(4), pages 850-867, August.
    12. Peng, Zixuan & Shan, Wenxuan & Zhu, Xiaoning & Yu, Bin, 2022. "Many-to-one stable matching for taxi-sharing service with selfish players," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 255-279.
    13. Mourad, Abood & Puchinger, Jakob & Chu, Chengbin, 2019. "A survey of models and algorithms for optimizing shared mobility," Transportation Research Part B: Methodological, Elsevier, vol. 123(C), pages 323-346.
    14. Ning Ma & Ziqiang Zeng & Yinhai Wang & Jiuping Xu, 2021. "Balanced strategy based on environment and user benefit-oriented carpooling service mode for commuting trips," Transportation, Springer, vol. 48(3), pages 1241-1266, June.
    15. Hou, Liwen & Li, Dong & Zhang, Dali, 2018. "Ride-matching and routing optimisation: Models and a large neighbourhood search heuristic," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 118(C), pages 143-162.
    16. Guo, Yuhan & Zhang, Yu & Boulaksil, Youssef & Qian, Yaguan & Allaoui, Hamid, 2023. "Modelling and analysis of online ride-sharing platforms – A sustainability perspective," European Journal of Operational Research, Elsevier, vol. 304(2), pages 577-595.
    17. Boysen, Nils & Briskorn, Dirk & Schwerdfeger, Stefan & Stephan, Konrad, 2021. "Optimizing carpool formation along high-occupancy vehicle lanes," European Journal of Operational Research, Elsevier, vol. 293(3), pages 1097-1112.
    18. Zixuan Peng & Wenxuan Shan & Peng Jia & Bin Yu & Yonglei Jiang & Baozhen Yao, 2020. "Stable ride-sharing matching for the commuters with payment design," Transportation, Springer, vol. 47(1), pages 1-21, February.
    19. Stiglic, Mitja & Agatz, Niels & Savelsbergh, Martin & Gradisar, Mirko, 2015. "The benefits of meeting points in ride-sharing systems," Transportation Research Part B: Methodological, Elsevier, vol. 82(C), pages 36-53.
    20. Wang, X. & Agatz, N.A.H. & Erera, A., 2015. "Stable Matching for Dynamic Ride-sharing Systems," ERIM Report Series Research in Management ERS-2015-006-LIS, Erasmus Research Institute of Management (ERIM), ERIM is the joint research institute of the Rotterdam School of Management, Erasmus University and the Erasmus School of Economics (ESE) at Erasmus University Rotterdam.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:kap:transp:v:45:y:2018:i:6:d:10.1007_s11116-018-9957-5. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.