IDEAS home Printed from https://ideas.repec.org/a/eee/transa/v209y2026ics0965856426001709.html

Towards smarter on-demand ride-sharing: Leveraging spatiotemporal flexibility to improve efficiency via delayed matching and walking

Author

Listed:
  • Li, Yafei
  • Sun, Huijun
  • Chang, Ximing
  • Lv, Ying
  • Gao, Kun

Abstract

Ride-sharing services have become a key component of urban mobility systems by improving transport efficiency and supporting more effective use of vehicle resources. However, conventional immediate matching strategies often fail to fully exploit temporal and spatial flexibility in user behavior. This study explores an on-demand management strategy that delays matching decisions for selected requests, while allowing passengers to walk to nearby pick-up points. Such flexibility offers the potential to reshape the temporal distribution of demand and better align it with vehicle availability. A two-stage on-demand delayed matching framework is proposed that integrates a multi-agent reinforcement learning-based admission mechanism with a trip-to-vehicle graph-based matching model incorporating walking flexibility, which aims to enhance matching efficiency while reducing travel time costs. Experimental results based on real-world ride-sourcing travel records from central Beijing show that the proposed strategy enhances overall system performance by increasing matching rates, reducing per-order emissions, and boosting platform profitability. For passengers, spatiotemporal flexibility in matching not only lowers pick-up, waiting, and walking times but also slightly reduces average matching time, showing that operational gains can be achieved without sacrificing user experience. The results suggest that modest behavioral adjustments, such as short-distance walking, can ease service imbalances without requiring major infrastructure changes. Ride-sharing platforms can replace uniform immediacy with response times that reflect passengers’ temporal flexibility, while adopting differentiated strategies that account for heterogeneous walking willingness can enhance system feasibility while maintaining user acceptance.

Suggested Citation

  • Li, Yafei & Sun, Huijun & Chang, Ximing & Lv, Ying & Gao, Kun, 2026. "Towards smarter on-demand ride-sharing: Leveraging spatiotemporal flexibility to improve efficiency via delayed matching and walking," Transportation Research Part A: Policy and Practice, Elsevier, vol. 209(C).
  • Handle: RePEc:eee:transa:v:209:y:2026:i:c:s0965856426001709
    DOI: 10.1016/j.tra.2026.105029
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0965856426001709
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.tra.2026.105029?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

    for a different version of it.

    References listed on IDEAS

    as
    1. Dimitris Bertsimas & Patrick Jaillet, & Sébastien Martin, 2019. "Online Vehicle Routing: The Edge of Optimization in Large-Scale Applications," Operations Research, INFORMS, vol. 67(1), pages 143-162, January.
    2. 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.
    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. Markov, Iliya & Guglielmetti, Rafael & Laumanns, Marco & Fernández-Antolín, Anna & de Souza, Ravin, 2021. "Simulation-based design and analysis of on-demand mobility services," Transportation Research Part A: Policy and Practice, Elsevier, vol. 149(C), pages 170-205.
    5. Gurumurthy, Krishna Murthy & Kockelman, Kara M., 2022. "Dynamic ride-sharing impacts of greater trip demand and aggregation at stops in shared autonomous vehicle systems," Transportation Research Part A: Policy and Practice, Elsevier, vol. 160(C), pages 114-125.
    6. 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.
    7. Yang, Hai & Qin, Xiaoran & Ke, Jintao & Ye, Jieping, 2020. "Optimizing matching time interval and matching radius in on-demand ride-sourcing markets," Transportation Research Part B: Methodological, Elsevier, vol. 131(C), pages 84-105.
    8. Anton Braverman & J. G. Dai & Xin Liu & Lei Ying, 2019. "Empty-Car Routing in Ridesharing Systems," Operations Research, INFORMS, vol. 67(5), pages 1437-1452, September.
    9. Omar Besbes & Francisco Castro & Ilan Lobel, 2021. "Surge Pricing and Its Spatial Supply Response," Management Science, INFORMS, vol. 67(3), pages 1350-1367, March.
    10. Noruzoliaee, Mohamadhossein & Zou, Bo, 2022. "One-to-many matching and section-based formulation of autonomous ridesharing equilibrium," Transportation Research Part B: Methodological, Elsevier, vol. 155(C), pages 72-100.
    11. 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.
    12. 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.
    13. Stiglic, M. & Agatz, N.A.H. & Savelsbergh, M.W.P. & Gradisar, M., 2015. "The Benefits of Meeting Points in Ride-sharing Systems," ERIM Report Series Research in Management ERS-2015-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.
    14. Chang, Ximing & Wu, Jianjun & Yu, Jiarui & Liu, Tianyu & Yan, Xuedong & Lee, Der-Horng, 2024. "Addressing COVID-induced changes in spatiotemporal travel mobility and community structure utilizing trip data: An innovative graph-based deep learning approach," Transportation Research Part A: Policy and Practice, Elsevier, vol. 180(C).
    15. Zwick, Felix & Kuehnel, Nico & Hörl, Sebastian, 2022. "Shifts in perspective: Operational aspects in (non-)autonomous ride-pooling simulations," Transportation Research Part A: Policy and Practice, Elsevier, vol. 165(C), pages 300-320.
    16. Yang, Shuang & Wu, Jianjun & Sun, Huijun & Qu, Yunchao, 2023. "Trip planning for a mobility-as-a-service system: Integrating metros and shared autonomous vehicles," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 176(C).
    17. Wei Zhang & Alexandre Jacquillat & Kai Wang & Shuaian Wang, 2023. "Routing Optimization with Vehicle–Customer Coordination," Management Science, INFORMS, vol. 69(11), pages 6876-6897, November.
    Full references (including those not matched with items on IDEAS)

    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. Horner, Hannah & Pazour, Jennifer & Mitchell, John E., 2021. "Optimizing driver menus under stochastic selection behavior for ridesharing and crowdsourced delivery," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 153(C).
    3. Stumpe, Miriam & Dieter, Peter & Schryen, Guido & Müller, Oliver & Beverungen, Daniel, 2024. "Designing taxi ridesharing systems with shared pick-up and drop-off locations: Insights from a computational study," Transportation Research Part A: Policy and Practice, Elsevier, vol. 183(C).
    4. Ke, Jintao & Yang, Hai & Li, Xinwei & Wang, Hai & Ye, Jieping, 2020. "Pricing and equilibrium in on-demand ride-pooling markets," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 411-431.
    5. Meng Li & Guowei Hua & Haijun Huang, 2018. "A Multi-Modal Route Choice Model with Ridesharing and Public Transit," Sustainability, MDPI, vol. 10(11), pages 1-14, November.
    6. Wei Zhang & Alexandre Jacquillat & Kai Wang & Shuaian Wang, 2023. "Routing Optimization with Vehicle–Customer Coordination," Management Science, INFORMS, vol. 69(11), pages 6876-6897, November.
    7. Li, Mingyang & Wu, Lingxiao & Wang, Yadong & Tang, Jinjun & Feng, Tao, 2025. "The flex-route transit planning problem with meeting points," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 195(C).
    8. Zhong, Lin & Zhang, Kenan & (Marco) Nie, Yu & Xu, Jiuping, 2020. "Dynamic carpool in morning commute: Role of high-occupancy-vehicle (HOV) and high-occupancy-toll (HOT) lanes," Transportation Research Part B: Methodological, Elsevier, vol. 135(C), pages 98-119.
    9. 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.
    10. 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.
    11. Alnaggar, Aliaa & Gzara, Fatma & Bookbinder, James H., 2021. "Crowdsourced delivery: A review of platforms and academic literature," Omega, Elsevier, vol. 98(C).
    12. Yan, Pengyu & Lee, Chung-Yee & Chu, Chengbin & Chen, Cynthia & Luo, Zhiqin, 2021. "Matching and pricing in ride-sharing: Optimality, stability, and financial sustainability," Omega, Elsevier, vol. 102(C).
    13. 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.
    14. Li, Qing & Liao, Feixiong & Xu, Wei & Huang, Hai-Jun, 2025. "Fleet sizing and pricing for hybrid ownership of shared autonomous vehicles in a multimodal transportation system," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    15. 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.
    16. Sun, Yanshuo & Chen, Zhi-Long & Zhang, Lei, 2020. "Nonprofit peer-to-peer ridesharing optimization," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 142(C).
    17. 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.
    18. Guo, Xiaotong & Caros, Nicholas S. & Zhao, Jinhua, 2021. "Robust matching-integrated vehicle rebalancing in ride-hailing system with uncertain demand," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 161-189.
    19. Ruijie Li & Yu (Marco) Nie & Xiaobo Liu, 2020. "Pricing Carpool Rides Based on Schedule Displacement," Transportation Science, INFORMS, vol. 54(4), pages 1134-1152, July.
    20. Qian, Xinwu & Zhang, Wenbo & Ukkusuri, Satish V. & Yang, Chao, 2017. "Optimal assignment and incentive design in the taxi group ride problem," Transportation Research Part B: Methodological, Elsevier, vol. 103(C), pages 208-226.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:transa:v:209:y:2026:i:c:s0965856426001709. 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/547/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.