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

Weekly scheduling for freight rail engineers & trainmen

Author

Listed:
  • Guo, Jia
  • Bard, Jonathan F.

Abstract

Standard practice in the freight rail industry has been used to provide only short-term crew schedules for a day or two at a time. This essentially means that the engineers and other trainmen function on a “just-in-time” basis with as little as two hours notice to report to work. This approach offers the greatest flexibility for management but plays havoc with the work-life balance of the crew. The purpose of this paper is to show that it is possible to construct robust weekly schedules that satisfy the full range of legal regulations and company policies without greatly enlarging the size of the workforce. This is done with a 3-phase algorithm that relies on the logic of column generation and local improvement procedures. Additional features include the option to generate cyclic schedules and a parametric approach to account for random trip times. To demonstrate the effectiveness of the methodology, computational experiments and statistical analysis are conducted using data sets from a Class I railroad. The robustness of the derived schedules is confirmed through simulation with varied parameter settings by comparing each of the baseline schedules produced by the 3-phase algorithm with 100 random instances.

Suggested Citation

  • Guo, Jia & Bard, Jonathan F., 2024. "Weekly scheduling for freight rail engineers & trainmen," Transportation Research Part B: Methodological, Elsevier, vol. 183(C).
  • Handle: RePEc:eee:transb:v:183:y:2024:i:c:s0191261524000663
    DOI: 10.1016/j.trb.2024.102942
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.trb.2024.102942?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:transb:v:183:y:2024:i:c:s0191261524000663. 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/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.