IDEAS home Printed from https://ideas.repec.org/a/eee/transb/v154y2021icp125-146.html
   My bibliography  Save this article

Predicting the matching probability and the expected ride/shared distance for each dynamic ridepooling order: A mathematical modeling approach

Author

Listed:
  • Wang, Jun
  • Wang, Xiaolei
  • Yang, Shan
  • Yang, Hai
  • Zhang, Xiaoning
  • Gao, Ziyou

Abstract

The popularity of smartphones and the advent of GPS positioning and wireless communication technologies in the recent decade have facilitated large-scale implementations of dynamic ridepooling services, such as Uber Pool, Lyft Line, and Didi Pinche. As in such services trips usually start before the appearance of pooling partners, knowing the probability of getting matching with another order (i.e., matching probability), the expected detour distance, and the expected shared distance before the start of each trip is essential for passengers to evaluate their willingness to pool and for ridepooling platforms to offer attractive discounts. In this paper, assuming that every ridepooling passenger shares vehicle space with at most one another during the entire trip, and ridepooling orders in each (origin-destination) OD pair appear following a Poisson process with a given rate, we propose a mathematical modeling approach to predict the matching probability, the expected ride distance, and the expected shared distance of each order under a first-come-first-serve strategy in dynamic ridepooling service. The method defines unmatched passengers at different locations along the exclusive-riding path of each OD pair into different seeker- and taker-states, formulates the complex interdependency of the matching probabilities, matching rates and arrival rates of (unmatched) passengers in different states into a system of nonlinear equations, and generates the matching probabilities and expected ride/shared distances of all OD pairs simultaneously. Under the same first-come-first-serve strategy, we simulated the occurrence, movements and state transitions of ridepooling orders based on a 30*30 grid network and the real network of Haikou City in China. In comparison with simulation results, we show that the method proposed in this paper can generate fairly satisfactory predictions under diverse matching conditions and demand intensities.

Suggested Citation

  • Wang, Jun & Wang, Xiaolei & Yang, Shan & Yang, Hai & Zhang, Xiaoning & Gao, Ziyou, 2021. "Predicting the matching probability and the expected ride/shared distance for each dynamic ridepooling order: A mathematical modeling approach," Transportation Research Part B: Methodological, Elsevier, vol. 154(C), pages 125-146.
    • Handle: RePEc:eee:transb:v:154:y:2021:i:c:p:125-146
    DOI: 10.1016/j.trb.2021.10.005
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0191261521001880
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.trb.2021.10.005?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. Harilaos N. Psaraftis, 1980. "A Dynamic Programming Solution to the Single Vehicle Many-to-Many Immediate Request Dial-a-Ride Problem," Transportation Science, INFORMS, vol. 14(2), pages 130-154, May.
    2. Daganzo, Carlos F. & Ouyang, Yanfeng & Yang, Haolin, 2020. "Analysis of ride-sharing with service time and detour guarantees," Transportation Research Part B: Methodological, Elsevier, vol. 140(C), pages 130-150.
    3. Ho, Sin C. & Szeto, W.Y. & Kuo, Yong-Hong & Leung, Janny M.Y. & Petering, Matthew & Tou, Terence W.H., 2018. "A survey of dial-a-ride problems: Literature review and recent developments," Transportation Research Part B: Methodological, Elsevier, vol. 111(C), pages 395-421.
    4. Li, Yuanyuan & Liu, Yang, 2021. "Optimizing flexible one-to-two matching in ride-hailing systems with boundedly rational users," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    5. 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.
    6. M. M. Vazifeh & P. Santi & G. Resta & S. H. Strogatz & C. Ratti, 2018. "Addressing the minimum fleet problem in on-demand urban mobility," Nature, Nature, vol. 557(7706), pages 534-538, May.
    7. Yves Molenbruch & Kris Braekers & An Caris, 2017. "Typology and literature review for dial-a-ride problems," Annals of Operations Research, Springer, vol. 259(1), pages 295-325, December.
    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. Qing-Long Lu & Moeid Qurashi & Constantinos Antoniou, 2024. "A ridesplitting market equilibrium model with utility-based compensation pricing," Transportation, Springer, vol. 51(2), pages 439-474, April.

    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. Hua, Shijia & Zeng, Wenjia & Liu, Xinglu & Qi, Mingyao, 2022. "Optimality-guaranteed algorithms on the dynamic shared-taxi problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 164(C).
    2. Liu, Zhiyong & Li, Ruimin & Dai, Jingchen, 2022. "Effects and feasibility of shared mobility with shared autonomous vehicles: An investigation based on data-driven modeling approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 156(C), pages 206-226.
    3. Lu, Chang & Wu, Yuehui & Yu, Shanchuan, 2022. "A Sample Average Approximation Approach for the Stochastic Dial-A-Ride Problem on a Multigraph with User Satisfaction," European Journal of Operational Research, Elsevier, vol. 302(3), pages 1031-1044.
    4. Omar Rifki, 2024. "Autonomous Ride-Sharing Service Using Graph Embedding and Dial-a-Ride Problem: Application to the Last-Mile Transit in Lyon City," Mathematics, MDPI, vol. 12(4), pages 1-17, February.
    5. 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.
    6. Sharif Azadeh, Sh. & Atasoy, Bilge & Ben-Akiva, Moshe E. & Bierlaire, M. & Maknoon, M.Y., 2022. "Choice-driven dial-a-ride problem for demand responsive mobility service," Transportation Research Part B: Methodological, Elsevier, vol. 161(C), pages 128-149.
    7. Gaul, Daniela & Klamroth, Kathrin & Stiglmayr, Michael, 2022. "Event-based MILP models for ridepooling applications," European Journal of Operational Research, Elsevier, vol. 301(3), pages 1048-1063.
    8. Daniel Y. Mo & H. Y. Lam & Weikun Xu & G. T. S. Ho, 2020. "Design of Flexible Vehicle Scheduling Systems for Sustainable Paratransit Services," Sustainability, MDPI, vol. 12(14), pages 1-18, July.
    9. MELIS, Lissa & SÖRENSEN, Kenneth, 2021. "The real-time on-demand bus routing problem: What is the cost of dynamic requests?," Working Papers 2021003, University of Antwerp, Faculty of Business and Economics.
    10. Trotta, Manuel & Archetti, Claudia & Feillet, Dominique & Quilliot, Alain, 2022. "Pickup and delivery problems with autonomous vehicles on rings," European Journal of Operational Research, Elsevier, vol. 300(1), pages 221-236.
    11. Mahmoudi, Monirehalsadat & Zhou, Xuesong, 2016. "Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows: A dynamic programming approach based on state–space–time network representations," Transportation Research Part B: Methodological, Elsevier, vol. 89(C), pages 19-42.
    12. Zhan, Xingbin & Szeto, W.Y. & Shui, C.S. & Chen, Xiqun (Michael), 2021. "A modified artificial bee colony algorithm for the dynamic ride-hailing sharing problem," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 150(C).
    13. Hyland, Michael & Mahmassani, Hani S., 2020. "Operational benefits and challenges of shared-ride automated mobility-on-demand services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 134(C), pages 251-270.
    14. Itani, Alaa & Klumpenhouwer, Willem & Shalaby, Amer & Hemily, Brendon, 2024. "Guiding principles for integrating on-demand transit into conventional transit networks: A review of literature and practice," Transport Policy, Elsevier, vol. 147(C), pages 183-197.
    15. Lian, Ying & Lucas, Flavien & Sörensen, Kenneth, 2024. "Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system," European Journal of Operational Research, Elsevier, vol. 312(1), pages 338-356.
    16. Schulz, Arne & Pfeiffer, Christian, 2024. "Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems," European Journal of Operational Research, Elsevier, vol. 312(2), pages 456-472.
    17. Enzi, Miriam & Parragh, Sophie N. & Pisinger, David & Prandtstetter, Matthias, 2021. "Modeling and solving the multimodal car- and ride-sharing problem," European Journal of Operational Research, Elsevier, vol. 293(1), pages 290-303.
    18. Ke, Jintao & Yang, Hai & Zheng, Zhengfei, 2020. "On ride-pooling and traffic congestion," Transportation Research Part B: Methodological, Elsevier, vol. 142(C), pages 213-231.
    19. Schulz, Arne & Pfeiffer, Christian, 2024. "A Branch-and-Cut algorithm for the dial-a-ride problem with incompatible customer types," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 181(C).
    20. Su, Yue & Dupin, Nicolas & Puchinger, Jakob, 2023. "A deterministic annealing local search for the electric autonomous dial-a-ride problem," European Journal of Operational Research, Elsevier, vol. 309(3), pages 1091-1111.

    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:eee:transb:v:154:y:2021:i:c:p:125-146. 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: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/wps/find/journaldescription.cws_home/548/description#description .

    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.