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

Fleet Sizing and Empty Freight Car Allocation

In: Operations Research Proceedings 2018

Author

Listed:
  • Philipp Hungerländer

    (Alpen-Adria-Universität Klagenfurt)

  • Sebastian Steininger

    (Alpen-Adria-Universität Klagenfurt)

Abstract

Empty freight car allocation problems and fleet sizing problems are highly important topics in the field of railway cargo optimization. Fleet sizing is mainly used in order to find the minimal number of freight cars (with fixed costs) needed to operate the transportation network successfully (e.g. satisfying customer demands). After a consignment is transported to its destination, the unloaded freight cars must be reallocated. This reallocation process is linked to costs depending on the traveled distance. In this paper we propose a network flow problem on a time-space network, formulated as integer linear program (ILP), for determining the optimal trade-off between the number of freight cars and the costs of empty vehicle allocation. The ILP is tested on a distribution network that is related to a specific part of Rail Cargo Austria’s railway network. Different modifications in the network (changes in cost structure, travel time and demand) are examined and compared to the basic scenario.

Suggested Citation

  • Philipp Hungerländer & Sebastian Steininger, 2019. "Fleet Sizing and Empty Freight Car Allocation," Operations Research Proceedings, in: Bernard Fortz & Martine Labbé (ed.), Operations Research Proceedings 2018, pages 285-290, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_36
    DOI: 10.1007/978-3-030-18500-8_36
    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.

    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_36. 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.