IDEAS home Printed from https://ideas.repec.org/h/spr/oprchp/978-3-030-18500-8_14.html
   My bibliography  Save this book chapter

A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints

In: Operations Research Proceedings 2018

Author

Listed:
  • Sarah Frisch

    (Alpen-Adria-Universität Klagenfurt)

  • Philipp Hungerländer

    (Alpen-Adria-Universität Klagenfurt)

  • Anna Jellen

    (Alpen-Adria-Universität Klagenfurt)

  • Dominic Weinberger

    (Alpen-Adria-Universität Klagenfurt)

Abstract

In this paper we investigate the Locomotive Scheduling Problem, i.e., the optimization of locomotive utilization with prior known transports that must be performed. Railway timetables are typically planned a year in advance and then revised, updated and fixed for shorter time periods, e.g., for a week, during the year. Our aim is to assign locomotives to the trains such that the locomotive utilization is maximized considering maintenances. We model this optimization problem on a sparse weighted directed multigraph that defines the input variables for our proposed Mixed Integer Linear Program (MILP). We consider two different objective functions: We minimize over the number of deadhead kilometers, i.e., kilometers from a locomotive driven without pulling a train, and over the number of locomotives used. Finally, we conduct a computational study to compare the performance of our MILP with the different proposed objective functions and show how the MILP can be used within a rolling horizon approach.

Suggested Citation

  • Sarah Frisch & Philipp Hungerländer & Anna Jellen & Dominic Weinberger, 2019. "A Mixed Integer Linear Program for Optimizing the Utilization of Locomotives with Maintenance Constraints," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 103-109, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_14
    DOI: 10.1007/978-3-030-18500-8_14
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a search for a similarly titled item that would be available.

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Frisch, Sarah & Hungerländer, Philipp & Jellen, Anna & Primas, Bernhard & Steininger, Sebastian & Weinberger, Dominic, 2021. "Solving a real-world Locomotive Scheduling Problem with Maintenance Constraints," Transportation Research Part B: Methodological, Elsevier, vol. 150(C), pages 386-409.

    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:spr:oprchp:978-3-030-18500-8_14. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.