Bus Driver Rostering by Column Generation Metaheuristics

Vítor Barbosa (), Filipe Alvelos () and Ana Respício ()
Additional contact information
Vítor Barbosa: Instituto Politécnico de Setúbal
Filipe Alvelos: Universidade do Minho
Ana Respício: Universidade de Lisboa

A chapter in Computational Management Science, 2016, pp 225-231 from Springer

Abstract: 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.

Keywords: Local Search; Evolutionary Algorithm; Column Generation; Master Problem; Linear Relaxation (search for similar items in EconPapers)
Date: 2016
References: Add references at CitEc
Citations: View citations in EconPapers (1)

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:lnechp:978-3-319-20430-7_29

Ordering information: This item can be ordered from
http://www.springer.com/9783319204307

DOI: 10.1007/978-3-319-20430-7_29

Access Statistics for this chapter

More chapters in Lecture Notes in Economics and Mathematical Systems from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().