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

A Solution Approach for Railway Crew Scheduling with Attendance Rates for Multiple Networks

In: Operations Research Proceedings 2018

Author

Listed:
  • Julia Heil

    (TU Dresden)

Abstract

This paper deals with railway crew scheduling with attendance rates for multiple networks, a problem arising at a German railway operator. We discuss the particularities of the multi-network crew scheduling problem and present a set covering formulation with network-specific constraints. We present and compare two solution approaches: a hybrid column generation approach with genetic algorithm and a novel two-phase optimization method based on the algorithm above and a partitioning-and-re-combining strategy. Computational experiments with a real 1-day case of 12 networks show that the two-phase optimization method performs best in both computational time and best solution found. Moreover, collective crew scheduling over multiple networks reduces personnel cost by 2%.

Suggested Citation

  • Julia Heil, 2019. "A Solution Approach for Railway Crew Scheduling with Attendance Rates for Multiple Networks," Operations Research Proceedings, in: Bernard Fortz & Martine LabbĂ© (ed.), Operations Research Proceedings 2018, pages 547-553, Springer.
    • Handle: RePEc:spr:oprchp:978-3-030-18500-8_68
    DOI: 10.1007/978-3-030-18500-8_68
    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_68. 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.