IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-658-08167-6_7.html
   My bibliography  Save this book chapter

Heuristics for Solving the Crew Rostering Problem

In: Decision Support for Crew Rostering in Public Transit

Author

Listed:
  • Lin Xie

    (Universität Paderborn)

Abstract

As shown in Chapter 6, some instances can not be solved optimally within 24 hours with solvers or are unsolvable due to a shortage of memory (especially with the integrated approach). Therefore, in this chapter we try to develop some heuristics to identify good solutions to the crew rostering problem. We begin this chapter with some information in Section 7.1 shared by the heuristics, i.e. update of meta-information, local search operators, and generation of an initial solution. In Section 7.2, different metaheuristics are developed to solve the rota scheduling problem of the NCCR problem. The best metaheuristic is chosen to solve the integrated problem of the NCCR and CCR problems in Section 7.3. Column generation approaches for the rota scheduling problem, and for the integrated problem of both NCCR and CCR problems, are then described in Sections 7.4.1 and 7.4.2. Next, a multi-objective metaheuristic is described in Section 7.5. Finally, the experimental results are shown in Section 7.6. The notation used in this chapter, including the sets, parameters, and variables, is the same as in Chapter 5.

Suggested Citation

  • Lin Xie, 2015. "Heuristics for Solving the Crew Rostering Problem," Springer Books, in: Decision Support for Crew Rostering in Public Transit, edition 127, chapter 7, pages 67-106, Springer.
    • Handle: RePEc:spr:sprchp:978-3-658-08167-6_7
    DOI: 10.1007/978-3-658-08167-6_7
    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.

    More about this item

    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-658-08167-6_7. 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.