A Hybrid Metaheuristic for the Bus Driver Rostering Problem
Vitor Barbosa, Ana Respício, Filipe Alvelos
2013
Abstract
This paper presents a new decomposition model for the Bus Driver Rostering Problem and proposes the hybridization of column generation and genetic algorithms to achieve good quality rosters in short time. The decomposition model is based on the definition of a subproblem for each driver, which is responsible for the creation of valid work-schedules for the rostering period. Column generation is used to obtain an optimal linear solution. This solution and the subproblems’ solutions obtained during the column generation are then used by the genetic algorithm to find good quality combinations of drivers’ schedules, i.e. good quality rosters. Computational tests show the efficiency and effectiveness of the proposed approach.
References
- Alvelos, F., de Sousa, A. and Santos, D. (2010). SearchCol: Metaheuristic Search by Column Generation. In M. Blesa, C. Blum, G. Raidl, A. Roli & M. Sampels (Eds.), Hybrid Metaheuristics (Vol. 6373, pp. 190-205): Springer Berlin / Heidelberg.
- Alvelos, F., Sousa, A. and Santos, D. (2013). Combining column generation and metaheuristics. In E.-G. Talbi (Ed.), Hybrid metaheuristics (pp. 285-334): Springer.
- Barnhart, C., Johnson, E. L., Nemhauser, G. L., Savelsbergh, M. W. P. and Vance, P. H. (1998). Branch-and-Price: Column Generation For Solving Huge Integer Programs. Operations Research, 46(3), 316-329.
- Burke, E. K., De Causmaecker, P., Berghe, G. and Van Landeghem, H. (2004). The State of the Art of Nurse Rostering. Journal of Scheduling, 7(6), 441-499.
- Burke, E. K., Kendall, G. and Soubeiga, E. (2003). A Tabu-Search Hyperheuristic for Timetabling and Rostering. Journal of Heuristics, 9(6), 451-470.
- Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton, New Jersey: Princeton University Press.
- Dantzig, G. B. and Wolfe, P. (1960). Decomposition Principle for Linear Programs. Operations Research, 8(1), 101-111.
- De Leone, R., Festa, P. and Marchitto, E. (2010). A Bus Driver Scheduling Problem: a new mathematical model and a GRASP approximate solution. Journal of Heuristics, 1-26.
- Desaulniers, G., Desrosiers, J. and Solomon, M. M. (2005). Column Generation. New York: Springer.
- Desrosiers, J., Soumis, F. and Desrochers, M. (1984). Routing with time windows by column generation. Networks, 14, 545-565.
- Dorne, R. (2008). Personnel Shift Scheduling and Rostering. In C. Voudouris, D. Lesaint & G. Owusu (Eds.), Service Chain Management (pp. 125-138): Springer Berlin Heidelberg.
- Ernst, A. T., Jiang, H., Krishnamoorthy, M. and Sier, D. (2004). Staff scheduling and rostering: A review of applications, methods and models. European Journal of Operational Research, 153(1), 3-27.
- Holland, J. H. (1992). Adaptation in natural and artificial systems: MIT Press.
- ILOG, I. (2009). User's Manual for CPLEX.
- Kohl, N. and Karisch, S. E. (2004). Airline Crew Rostering: Problem Types, Modeling, and Optimization. Annals of Operations Research, 127(1), 223-257.
- Lübbecke, M. E. and Desrosiers, J. (2005). Selected Topics in Column Generation. Oper. Res., 53(6), 1007-1023.
- Lucic, P. and Teodorovic, D. (2007). Metaheuristics approach to the aircrew rostering problem. Annals of Operations Research, 155(1), 311-338.
- Mitchell, M. (1996). An introduction to genetic algorithms: MIT Press.
- Moz, M. and Pato, M. (2007). A genetic algorithm approach to a nurse rerostering problem. Computers & Operations Research, 34(3), 667-691.
- Moz, M., Respício, A. and Pato, M. (2009). Bi-objective evolutionary heuristics for bus driver rostering. Public Transport, 1(3), 189-210.
- Reeves, C. R. (1997). Genetic Algorithms for the Operations Researcher. INFORMS Journal on Computing, 9(3), 231-250.
- Rodrigues, M. M., de Souza, C. C. and Moura, A. V. (2006). Vehicle and crew scheduling for urban bus lines. European Journal of Operational Research, 170(3), 844-862.
- Ruibin, B., Burke, E. K., Kendall, G., Jingpeng, L. and McCollum, B. (2010). A Hybrid Evolutionary Approach to the Nurse Rostering Problem. Evolutionary Computation, IEEE Transactions on, 14(4), 580-590.
- Wren, A. (1996). Scheduling, timetabling and rostering - A special relationship? In E. Burke & P. Ross (Eds.), Practice and Theory of Automated Timetabling (Vol. 1153, pp. 46-75): Springer Berlin / Heidelberg.
Paper Citation
in Harvard Style
Barbosa V., Respício A. and Alvelos F. (2013). A Hybrid Metaheuristic for the Bus Driver Rostering Problem . In Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES, ISBN 978-989-8565-40-2, pages 32-42. DOI: 10.5220/0004283700320042
in Bibtex Style
@conference{icores13,
author={Vitor Barbosa and Ana Respício and Filipe Alvelos},
title={A Hybrid Metaheuristic for the Bus Driver Rostering Problem},
booktitle={Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,},
year={2013},
pages={32-42},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0004283700320042},
isbn={978-989-8565-40-2},
}
in EndNote Style
TY - CONF
JO - Proceedings of the 2nd International Conference on Operations Research and Enterprise Systems - Volume 1: ICORES,
TI - A Hybrid Metaheuristic for the Bus Driver Rostering Problem
SN - 978-989-8565-40-2
AU - Barbosa V.
AU - Respício A.
AU - Alvelos F.
PY - 2013
SP - 32
EP - 42
DO - 10.5220/0004283700320042