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

Robust matching-integrated vehicle rebalancing in ride-hailing system with uncertain demand

Author

Listed:
  • Guo, Xiaotong
  • Caros, Nicholas S.
  • Zhao, Jinhua

Abstract

With the rapid growth of the mobility-on-demand (MoD) market in recent years, ride-hailing companies have become an important element of the urban mobility system. There are two critical components in the operations of ride-hailing companies: driver–customer matching and vehicle rebalancing. In most previous literature, each component is considered separately, and performances of vehicle rebalancing models rely on the accuracy of future demand predictions. To better immunize rebalancing decisions against demand uncertainty, a novel approach, the matching-integrated vehicle rebalancing (MIVR) model, is proposed in this paper to incorporate driver–customer matching into vehicle rebalancing problems to produce better rebalancing strategies. The MIVR model treats the driver–customer matching component at an aggregate level and minimizes a generalized cost including the total vehicle miles traveled (VMT) and the number of unsatisfied requests. For further protection against uncertainty, robust optimization (RO) techniques are introduced to construct a robust version of the MIVR model. Problem-specific uncertainty sets are designed for the robust MIVR model. The proposed MIVR model is tested against two benchmark vehicle rebalancing models using real ride-hailing demand and travel time data from New York City (NYC). The MIVR model is shown to have better performances by reducing customer wait times compared to benchmark models under most scenarios. In addition, the robust MIVR model produces better solutions by planning for demand uncertainty compared to the non-robust (nominal) MIVR model.

Suggested Citation

  • 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.
  • Handle: RePEc:eee:transb:v:150:y:2021:i:c:p:161-189
    DOI: 10.1016/j.trb.2021.05.015
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.trb.2021.05.015?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. Gérard P. Cachon & Kaitlin M. Daniels & Ruben Lobel, 2017. "The Role of Surge Pricing on a Service Platform with Self-Scheduling Capacity," Manufacturing & Service Operations Management, INFORMS, vol. 19(3), pages 368-384, July.
    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. 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. Terry A. Taylor, 2018. "On-Demand Service Platforms," Manufacturing & Service Operations Management, INFORMS, vol. 20(4), pages 704-720, October.
    5. 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.
    6. 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.
    7. Al-Kanj, Lina & Nascimento, Juliana & Powell, Warren B., 2020. "Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1088-1106.
    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. Leon Yang Chu & Zhixi Wan & Dongyuan Zhan, 2018. "Harnessing the Double-edged Sword via Routing: Information Provision on Ride-hailing Platforms," Working Papers 18-04, NET Institute.
    10. Wang, Yu & Zhang, Yu & Tang, Jiafu, 2019. "A distributionally robust optimization approach for surgery block allocation," European Journal of Operational Research, Elsevier, vol. 273(2), pages 740-753.
    11. Yang, Hai & Shao, Chaoyi & Wang, Hai & Ye, Jieping, 2020. "Integrated reward scheme and surge pricing in a ridesourcing market," Transportation Research Part B: Methodological, Elsevier, vol. 134(C), pages 126-142.
    12. Wang, Hai & Yang, Hai, 2019. "Ridesourcing systems: A framework and review," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 122-155.
    13. Florian Dandl & Michael Hyland & Klaus Bogenberger & Hani S. Mahmassani, 2019. "Evaluating the impact of spatio-temporal demand forecast aggregation on the operational performance of shared autonomous mobility fleets," Transportation, Springer, vol. 46(6), pages 1975-1996, December.
    14. Gorissen, Bram L. & Yanıkoğlu, İhsan & den Hertog, Dick, 2015. "A practical guide to robust optimization," Omega, Elsevier, vol. 53(C), pages 124-137.
    15. A. Ben-Tal & A. Nemirovski, 1998. "Robust Convex Optimization," Mathematics of Operations Research, INFORMS, vol. 23(4), pages 769-805, November.
    16. Dimitris Bertsimas & Melvyn Sim, 2004. "The Price of Robustness," Operations Research, INFORMS, vol. 52(1), pages 35-53, February.
    17. Changxi Ma & Wei Hao & Ruichun He & Xiaoyan Jia & Fuquan Pan & Jing Fan & Ruiqi Xiong, 2018. "Distribution path robust optimization of electric vehicle with multiple distribution centers," PLOS ONE, Public Library of Science, vol. 13(3), pages 1-16, March.
    18. 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.
    19. Dimitris Bertsimas & Melvyn Sim & Meilin Zhang, 2019. "Adaptive Distributionally Robust Optimization," Management Science, INFORMS, vol. 65(2), pages 604-618, February.
    20. 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.
    21. Dimitris Bertsimas & Iain Dunning, 2020. "Relative Robust and Adaptive Optimization," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 408-427, April.
    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. Levin, Michael W., 2022. "A general maximum-stability dispatch policy for shared autonomous vehicle dispatch with an analytical characterization of the maximum throughput," Transportation Research Part B: Methodological, Elsevier, vol. 163(C), pages 258-280.
    2. Tubagus Robbi Megantara & Sudradjat Supian & Diah Chaerani, 2022. "Strategies to Reduce Ride-Hailing Fuel Consumption Caused by Pick-Up Trips: A Mathematical Model under Uncertainty," Sustainability, MDPI, vol. 14(17), pages 1-18, August.
    3. Mo, Baichuan & Koutsopoulos, Haris N. & Shen, Zuo-Jun Max & Zhao, Jinhua, 2023. "Robust path recommendations during public transit disruptions under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 82-107.

    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. 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.
    2. Zhu, Zheng & Ke, Jintao & Wang, Hai, 2021. "A mean-field Markov decision process model for spatial-temporal subsidies in ride-sourcing markets," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 540-565.
    3. Zhou, Yaqian & Yang, Hai & Ke, Jintao & Wang, Hai & Li, Xinwei, 2022. "Competition and third-party platform-integration in ride-sourcing markets," Transportation Research Part B: Methodological, Elsevier, vol. 159(C), pages 76-103.
    4. 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.
    5. 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.
    6. Ke, Jintao & Li, Xinwei & Yang, Hai & Yin, Yafeng, 2021. "Pareto-efficient solutions and regulations of congested ride-sourcing markets with heterogeneous demand and supply," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 154(C).
    7. Yang, Jie & Zhao, Daozhi & Wang, Zeyu & Xu, Chunqiu, 2022. "Impact of regulation on on-demand ride-sharing service: Profit-based target vs demand-based target," Research in Transportation Economics, Elsevier, vol. 92(C).
    8. Zhang, Kenan & Nie, Yu (Marco), 2022. "Mitigating traffic congestion induced by transportation network companies: A policy analysis," Transportation Research Part A: Policy and Practice, Elsevier, vol. 159(C), pages 96-118.
    9. Li, Shukai & Luo, Qi & Hampshire, Robert Cornelius, 2021. "Optimizing large on-demand transportation systems through stochastic conic programming," European Journal of Operational Research, Elsevier, vol. 295(2), pages 427-442.
    10. 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).
    11. Zhang, Kenan & Nie, Yu (Marco), 2021. "To pool or not to pool: Equilibrium, pricing and regulation," Transportation Research Part B: Methodological, Elsevier, vol. 151(C), pages 59-90.
    12. Mo, Baichuan & Koutsopoulos, Haris N. & Shen, Zuo-Jun Max & Zhao, Jinhua, 2023. "Robust path recommendations during public transit disruptions under demand uncertainty," Transportation Research Part B: Methodological, Elsevier, vol. 169(C), pages 82-107.
    13. Saif Benjaafar & Ming Hu, 2020. "Operations Management in the Age of the Sharing Economy: What Is Old and What Is New?," Manufacturing & Service Operations Management, INFORMS, vol. 22(1), pages 93-101, January.
    14. Guo, Jiaqi & Long, Jiancheng & Xu, Xiaoming & Yu, Miao & Yuan, Kai, 2022. "The vehicle routing problem of intercity ride-sharing between two cities," Transportation Research Part B: Methodological, Elsevier, vol. 158(C), pages 113-139.
    15. Xu, Zhengtian & Yin, Yafeng & Chao, Xiuli & Zhu, Hongtu & Ye, Jieping, 2021. "A generalized fluid model of ride-hailing systems," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 587-605.
    16. Al-Kanj, Lina & Nascimento, Juliana & Powell, Warren B., 2020. "Approximate dynamic programming for planning a ride-hailing system using autonomous fleets of electric vehicles," European Journal of Operational Research, Elsevier, vol. 284(3), pages 1088-1106.
    17. Meijian Yang & Enjun Xia, 2021. "A Systematic Literature Review on Pricing Strategies in the Sharing Economy," Sustainability, MDPI, vol. 13(17), pages 1-28, August.
    18. Yunke Mai & Bin Hu & Saša Pekeč, 2023. "Courteous or Crude? Managing User Conduct to Improve On-Demand Service Platform Performance," Management Science, INFORMS, vol. 69(2), pages 996-1016, February.
    19. Jacob, Jagan & Roet-Green, Ricky, 2021. "Ride solo or pool: Designing price-service menus for a ride-sharing platform," European Journal of Operational Research, Elsevier, vol. 295(3), pages 1008-1024.
    20. De Munck, Thomas & Chevalier, Philippe & Tancrez, Jean-Sébastien, 2023. "Managing priorities on on-demand service platforms with waiting time differentiation," International Journal of Production Economics, Elsevier, vol. 266(C).

    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:150:y:2021:i:c:p:161-189. 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.