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

Efficient inventory routing for Bike-Sharing Systems: A combinatorial reinforcement learning framework

Author

Listed:
  • Guo, Yuhan
  • Li, Jinning
  • Xiao, Linfan
  • Allaoui, Hamid
  • Choudhary, Alok
  • Zhang, Lufang

Abstract

Bike-sharing systems have become increasingly popular, providing a convenient, cost-effective, and environmentally friendly transportation option for urban commuters on short trips. However, an efficient and sustainable bike-sharing system faces a key challenge to dynamically balancing the supply and demand of bicycles through efficient inventory routing. This paper introduces a comprehensive combinatorial framework that tackles the critical challenges in the bike-sharing system's inventory routing problem. Firstly, we present a novel mathematical model that considers multiple delivery vehicle types and incorporates important factors like dispatch cost, service time, and user satisfaction, all while ensuring fair scheduling. The comprehensiveness of our model makes it highly applicable to real-world scenarios, addressing practical concerns faced by bike-sharing companies. Secondly, we leverage reinforcement learning mechanisms to gather quantitative information on the spatial and temporal patterns of demand and supply. With this data, we construct an effective regression model that accurately predicts station demand. Additionally, we propose an efficient heuristic approach to generate service sequences for delivery vehicle dispatching. Our approach employs a far-sighted strategy-based local iterative search algorithm to construct solutions, coupled with an adaptive exploration algorithm to continually improve solution quality. The proposed solution method is an innovative integration of reinforcement learning, demand prediction, and heuristic-based dispatching, significantly enhancing solution quality and computational efficiency. By bridging the gap between academic research and real-world practice, our framework offers practical and effective solutions for bike-sharing systems. Finally, we validate our proposed framework with extensive experimental results using real-world datasets. Our approach outperforms state-of-the-art algorithms within a short computational time, demonstrating its superiority in terms of solution quality compared to prior literature. Our research opens a new, viable direction for industrial practice, providing valuable insights for decision-makers to optimize bicycle inventory management in a smarter and more efficient way.

Suggested Citation

  • Guo, Yuhan & Li, Jinning & Xiao, Linfan & Allaoui, Hamid & Choudhary, Alok & Zhang, Lufang, 2024. "Efficient inventory routing for Bike-Sharing Systems: A combinatorial reinforcement learning framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 182(C).
  • Handle: RePEc:eee:transe:v:182:y:2024:i:c:s136655452400005x
    DOI: 10.1016/j.tre.2024.103415
    as

    Download full text from publisher

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

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

    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:182:y:2024:i:c:s136655452400005x. 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.

    We have no bibliographic references for this item. You can help adding them by using 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.