IDEAS home Printed from https://ideas.repec.org/a/eee/transe/v172y2023ics1366554523000686.html
   My bibliography  Save this article

Optimization of ride-sharing with passenger transfer via deep reinforcement learning

Author

Listed:
  • Wang, Dujuan
  • Wang, Qi
  • Yin, Yunqiang
  • Cheng, T.C.E.

Abstract

With the emergence of the sharing economy and the rapid growth of mobile communications technologies, many novel sharing service models have been developed stemming from ride-hailing. Urban traffic congestion, coupled with energy conservation and emissions reduction, has prompted research on enhancing vehicle seat utilization in taxi service. To offer more effective and reliable ride-hailing, we consider ride-sharing problem with passenger transfer that allows passegers to transfer between vehicles at transfer stations. The problem requires simultaneous addressing the issues of request dispatching, transfer scheduling, and vehicle rebalancing. Studying such a ride-hailing model, we propose a novel joint decision framework combining deep reinforcement learning (DRL) with integer-linear programming (ILP) to solve the problem. We use ILP to obtain the optimal online dispatching and matching strategy in each decision stage, and DRL to learn the approximate state value of each vehicle that incorporates with some strategies to limit the state space and reduce the computational complexity. Performing numerical studies on the real-world trip dataset in Chengdu, we demonstrate that the proposed method outperforms several state-of-the-art methods, and that ride-sharing with passenger transfer is more beneficial than traditional ride-sharing.

Suggested Citation

  • Wang, Dujuan & Wang, Qi & Yin, Yunqiang & Cheng, T.C.E., 2023. "Optimization of ride-sharing with passenger transfer via deep reinforcement learning," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 172(C).
  • Handle: RePEc:eee:transe:v:172:y:2023:i:c:s1366554523000686
    DOI: 10.1016/j.tre.2023.103080
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.tre.2023.103080?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. 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. 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.
    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. Azcuy, Irecis & Agatz, Niels & Giesen, Ricardo, 2021. "Designing integrated urban delivery systems using public transport," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    5. 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.
    6. 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.
    7. 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.
    8. Asadi, Amin & Nurre Pinkley, Sarah, 2021. "A stochastic scheduling, allocation, and inventory replenishment problem for battery swap stations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 146(C).
    9. Chen, Xiqun (Michael) & Zheng, Hongyu & Ke, Jintao & Yang, Hai, 2020. "Dynamic optimization strategies for on-demand ride services platform: Surge pricing, commission rate, and incentives," Transportation Research Part B: Methodological, Elsevier, vol. 138(C), pages 23-45.
    10. Cortés, Cristián E. & Matamala, Martín & Contardo, Claudio, 2010. "The pickup and delivery problem with transfers: Formulation and a branch-and-cut solution method," European Journal of Operational Research, Elsevier, vol. 200(3), pages 711-724, February.
    11. Alisoltani, Negin & Leclercq, Ludovic & Zargayouna, Mahdi, 2021. "Can dynamic ride-sharing reduce traffic congestion?," Transportation Research Part B: Methodological, Elsevier, vol. 145(C), pages 212-246.
    12. Wang, Hai & Yang, Hai, 2019. "Ridesourcing systems: A framework and review," Transportation Research Part B: Methodological, Elsevier, vol. 129(C), pages 122-155.
    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. 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.
    2. Zhang, Ruolin & Masoud, Neda, 2021. "A distributed algorithm for operating large-scale ridesourcing systems," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 156(C).
    3. Zhu, Zheng & Xu, Ailing & He, Qiao-Chu & Yang, Hai, 2021. "Competition between the transportation network company and the government with subsidies to public transit riders," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 152(C).
    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. Beojone, Caio Vitor & Geroliminis, Nikolas, 2023. "A dynamic multi-region MFD model for ride-sourcing with ridesplitting," Transportation Research Part B: Methodological, Elsevier, vol. 177(C).
    6. 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.
    7. 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).
    8. 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.
    9. 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.
    10. Inayatullah Shah & Mohammed El Affendi & Basit Qureshi, 2020. "SRide: An Online System for Multi-Hop Ridesharing," Sustainability, MDPI, vol. 12(22), pages 1-29, November.
    11. 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.
    12. 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.
    13. 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.
    14. 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).
    15. Ke, Jintao & Wang, Ce & Li, Xinwei & Tian, Qiong & Huang, Hai-Jun, 2024. "Equilibrium analysis for on-demand food delivery markets," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 184(C).
    16. 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).
    17. 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.
    18. Lei, Chao & Jiang, Zhoutong & Ouyang, Yanfeng, 2020. "Path-based dynamic pricing for vehicle allocation in ridesharing systems with fully compliant drivers," Transportation Research Part B: Methodological, Elsevier, vol. 132(C), pages 60-75.
    19. Ke, Jintao & Chen, Xiqun (Michael) & Yang, Hai & Li, Sen, 2022. "Coordinating supply and demand in ride-sourcing markets with pre-assigned pooling service and traffic congestion externality," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 166(C).
    20. 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.

    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:transe:v:172:y:2023:i:c:s1366554523000686. 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/600244/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.