IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-77203-3_14.html
   My bibliography  Save this book chapter

Optimal Sorting of Rolling Stock at Hump Yards

In: Mathematics – Key Technology for the Future

Author

Listed:
  • Ronny S. Hansmann

    (Institute of Mathematical Optimization)

  • Uwe T. Zimmermann

    (Institute of Mathematical Optimization)

Abstract

In this paper we provide a quite general description of a class of problems called Sorting of Rolling Stock Problem(s). An SRSP consists in finding an optimal schedule for rearranging units of rolling stock (railcars, trams, trains, . . . ) at shunting yards, covering a broad range of specially structured applications. Here, we focus on versions of SRSP at particular shunting yards featuring a hump. We analyze the use of such a hump yard in our research project Zeitkritische Ablaufbergoptimierung in Rangierbahnhöfen 1 in cooperation with BASF, The Chemical Company, in Ludwigshafen. Among other results we present a remarkably efficient algorithm with linear running time for solving the practical SRSP at the BASF hump yard.

Suggested Citation

  • Ronny S. Hansmann & Uwe T. Zimmermann, 2008. "Optimal Sorting of Rolling Stock at Hump Yards," Springer Books, in: Hans-Joachim Krebs & Willi Jäger (ed.), Mathematics – Key Technology for the Future, pages 189-203, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-77203-3_14
    DOI: 10.1007/978-3-540-77203-3_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
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:sprchp:978-3-540-77203-3_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.