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

Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time

Author

Listed:
  • Ricard, Léa
  • Desaulniers, Guy
  • Lodi, Andrea
  • Rousseau, Louis-Martin

Abstract

The multiple depot vehicle scheduling problem (MDVSP) is one of the most studied problems in public transport service planning. It consists of assigning buses to each timetabled trip while respecting vehicle availability at each depot. Although service quality, and especially reliability, is the core of most transport agencies, the MDVSP is more often than not solved solely in a cost-efficient way. This work introduces a data-driven model to the reliable MDVSP with stochastic travel time (R-MDVSP-STT). The reliability of a schedule is assessed and accounted for by propagating delays using the probability mass function of the travel time of each timetabled trip. We propose a heuristic branch-and-price algorithm to solve this problem and a labeling algorithm with a stochastic dominance criterion for the associated subproblems. The solutions obtained are compared based on three metrics — under normal and extraordinary circumstances. Computational results on real-life instances show that our method can efficiently find good trade-offs between operational costs and reliability, improving the reliability of the solutions with little cost increase.

Suggested Citation

  • Ricard, Léa & Desaulniers, Guy & Lodi, Andrea & Rousseau, Louis-Martin, 2024. "Increasing schedule reliability in the multiple depot vehicle scheduling problem with stochastic travel time," Omega, Elsevier, vol. 127(C).
    • Handle: RePEc:eee:jomega:v:127:y:2024:i:c:s0305048324000665
    DOI: 10.1016/j.omega.2024.103100
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0305048324000665
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.omega.2024.103100?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:jomega:v:127:y:2024:i:c:s0305048324000665. 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/375/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.