Integrated driver rostering problem in public bus transit
Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review
Standard
Integrated driver rostering problem in public bus transit. / Xie, Lin; Kliewer, Natalia; Suhl, Leena.
Procedia - Social and behavioral sciences: Proceedings of EWGT 2012- 15th Meeting of the EURO Working Group on Transportation, September 2012, Paris. ed. / Vincent Aguiléra. Vol. 54 Elsevier Ltd, 2012. p. 656-665 (Procedia - Social and Behavioral Sciences).Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - CHAP
T1 - Integrated driver rostering problem in public bus transit
AU - Xie, Lin
AU - Kliewer, Natalia
AU - Suhl, Leena
N1 - Conference code: 15
PY - 2012/10/1
Y1 - 2012/10/1
N2 - The driver rostering problem (DRP), arising in public bus transport companies, generates for each group of drivers a cyclic roster while management considerations, labor laws, and the preferences 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 for real-world instances and compared with the results of the sequential approach.
AB - The driver rostering problem (DRP), arising in public bus transport companies, generates for each group of drivers a cyclic roster while management considerations, labor laws, and the preferences 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 for real-world instances and compared with the results of the sequential approach.
KW - Business informatics
UR - https://www.mendeley.com/catalogue/dbda15cd-1eb9-3ce6-bc3c-86975d1fd30a/
U2 - 10.1016/j.sbspro.2012.09.783
DO - 10.1016/j.sbspro.2012.09.783
M3 - Article in conference proceedings
SN - 978-1-62993-047-3
VL - 54
T3 - Procedia - Social and Behavioral Sciences
SP - 656
EP - 665
BT - Procedia - Social and behavioral sciences
A2 - Aguiléra, Vincent
PB - Elsevier Ltd
T2 - 15th Meeting of the EURO Working Group on Transportation - EWGT 2012
Y2 - 10 September 2012 through 13 September 2012
ER -