A duty-block network approach for an integrated driver rostering problem in public bus transport
Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review
Standard
A duty-block network approach for an integrated driver rostering problem in public bus transport. / Xie, L; Suhl, Leena.
Urban Transport XVIII : Urban Transport and the Environment in the 21st Century. ed. / J.W.S Longhurst; C.A. Brebbia. WIT Press, 2012. p. 295-306 (WIT Transactions on the Built Environment; Vol. 128).Research output: Contributions to collected editions/works › Article in conference proceedings › Research › peer-review
Harvard
APA
Vancouver
Bibtex
}
RIS
TY - CHAP
T1 - A duty-block network approach for an integrated driver rostering problem in public bus transport
AU - Xie, L
AU - Suhl, Leena
N1 - Conference code: 18
PY - 2012/5/14
Y1 - 2012/5/14
N2 - 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.
AB - 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.
KW - Business informatics
KW - Integrated driver rostering problem
KW - Network optimization model
KW - Public transport
KW - Rotation-based rostering
UR - http://www.scopus.com/inward/record.url?scp=84865125685&partnerID=8YFLogxK
UR - https://www.mendeley.com/catalogue/180b37f0-8665-353f-9623-206aa06efb73/
U2 - 10.2495/UT120261
DO - 10.2495/UT120261
M3 - Article in conference proceedings
SN - 978-1-84564-580-9
T3 - WIT Transactions on the Built Environment
SP - 295
EP - 306
BT - Urban Transport XVIII
A2 - Longhurst, J.W.S
A2 - Brebbia, C.A.
PB - WIT Press
T2 - 18th International Conference on Urban Transport and the Environment 2012
Y2 - 15 May 2012 through 17 May 2012
ER -