IDEAS home Printed from https://ideas.repec.org/h/spr/isochp/978-1-4899-7571-3_2.html
   My bibliography  Save this book chapter

Locomotive Scheduling Problem

In: Handbook of Operations Research Applications at Railroads

Author

Listed:
  • Balachandran Vaidyanathan

    (FedEx Corporation)

  • Ravindra K. Ahuja

    (Optym)

Abstract

Every day, railroad managers need to assign hundreds of locomotives to hundreds of different trains. Locomotive scheduling involves optimally assigning a set of locomotives to each train so that the assignment satisfies a variety of business constraints and minimizes the total scheduling cost. Major US railroad companies have several billions of dollars of capital investment in locomotives. Thus, solving this problem effectively is of critical importance for railroads.

Suggested Citation

  • Balachandran Vaidyanathan & Ravindra K. Ahuja, 2015. "Locomotive Scheduling Problem," International Series in Operations Research & Management Science, in: Bruce W. Patty (ed.), Handbook of Operations Research Applications at Railroads, edition 127, chapter 0, pages 43-56, Springer.
    • Handle: RePEc:spr:isochp:978-1-4899-7571-3_2
    DOI: 10.1007/978-1-4899-7571-3_2
    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. Elio Canestrelli & Marco Corazza & Giuseppe Nadai & Raffaele Pesenti, 2017. "Managing the Ship Movements in the Port of Venice," Networks and Spatial Economics, Springer, vol. 17(3), pages 861-887, September.
    2. Scheffler, Martin & Neufeld, Janis S. & Hölscher, Michael, 2020. "An MIP-based heuristic solution approach for the locomotive assignment problem focussing on (dis-)connecting processes," Transportation Research Part B: Methodological, Elsevier, vol. 139(C), pages 64-80.

    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:isochp:978-1-4899-7571-3_2. 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.