IDEAS home Printed from https://ideas.repec.org/h/spr/lnechp/978-3-319-20430-7_29.html
   My bibliography  Save this book chapter

Bus Driver Rostering by Column Generation Metaheuristics

In: Computational Management Science

Author

Listed:
  • Vítor Barbosa

    (Instituto Politécnico de Setúbal)

  • Filipe Alvelos

    (Universidade do Minho)

  • Ana Respício

    (Universidade de Lisboa)

Abstract

In the bus driver rostering (BDR) problem the objective is to define work schedules for drivers such that costs are minimized. This problem has been addressed before by combining column generation and an evolutionary algorithm. In this paper, we show improvements obtained by using perturbations in the column generation and limiting the time spent by column generation in each cycle of the algorithm. Both approaches follow a general framework entitled SearchCol, Metaheuristic search by column generation, recently proposed for decomposable integer programming/combinatorial optimization problems.

Suggested Citation

  • Vítor Barbosa & Filipe Alvelos & Ana Respício, 2016. "Bus Driver Rostering by Column Generation Metaheuristics," Lecture Notes in Economics and Mathematical Systems, in: Raquel J. Fonseca & Gerhard-Wilhelm Weber & João Telhada (ed.), Computational Management Science, edition 1, pages 225-231, Springer.
    • Handle: RePEc:spr:lnechp:978-3-319-20430-7_29
    DOI: 10.1007/978-3-319-20430-7_29
    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. Lin Xie & Marius Merschformann & Natalia Kliewer & Leena Suhl, 2017. "Metaheuristics approach for solving personalized crew rostering problem in public bus transit," Journal of Heuristics, Springer, vol. 23(5), pages 321-347, October.

    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:lnechp:978-3-319-20430-7_29. 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.