A duty-block network approach for an integrated driver rostering problem in public bus transport

Research output: Contributions to collected editions/worksArticle in conference proceedingsResearchpeer-review


The driver rostering problem (DRP), arising in public bus transport companies, aims to generate for each driver a roster while management considerations, labor laws, and desires of drivers have to be satisfied. Optimal rosters are characterized by maximal satisfaction of drivers, minimal difference of overtime among all drivers, and minimal number of unassigned duties. The DRP is mostly solved sequentially due to its high complexity, namely firstly the rota scheduling problem, and secondly the duty sequencing problem. However, this method may generate sub-optimal rosters. In order to avoid a sub-optimal solution, the paper discusses an integrated DRP, which is solved with a duty-block network approach for real-world instances and compared with a solution of a heuristic-based integrated DRP.

Original languageEnglish
Title of host publicationUrban Transport XVIII : Urban Transport and the Environment in the 21st Century
EditorsJ.W.S Longhurst, C.A. Brebbia
Number of pages12
PublisherWIT Press
Publication date2012
ISBN (Print)978-1-84564-580-9
ISBN (Electronic)978-1-84564-581-6
Publication statusPublished - 2012
Externally publishedYes
Event18th International Conference on Urban Transport and the Environment 2012 - A Coruña, Spain
Duration: 15.05.201217.05.2012
Conference number: 18

    Research areas

  • Business informatics
  • Integrated driver rostering problem, Network optimization model, Public transport, Rotation-based rostering