Abstract
The Bus Driver Rostering Problem (BRP) refers to the assignment of drivers to the daily crew duties that cover a set of schedules for buses of a company during a planning period of a given duration, e.g., a month. An assignment such as this, denoted as roster, must comply with legal and institutional rules, namely Labour Law, labour agreements and the company’s regulations. This paper presents a new bi-objective model for the BRP, assuming a non-cyclic rostering context. One such model is appropriate to deal with the specific and diverse requirements of individual drivers, e.g. absences. Two evolutionary heuristics, differing as to the strategies adopted to approach the Pareto frontier, are described for the BRP. The first one, following a utopian strategy, extends elitism to include an infeasible (utopic) and two potential lexicographic individuals in the population, and the second one is an adapted version of the well known SPEA2 (Strength Pareto Evolutionary Algorithm). The heuristics’ empirical performance was studied through computational tests on BRP instances generated from the solution of integrated vehicle-crew scheduling problems, along with the rules of a public transit company operating in Portugal. This research shows that both methodologies are adequate to tackle these instances. However, the second one is, in general, the more favourable. In reasonable computation times they provide the company’s planning department with several rosters that satisfy all the constraints, an achievement which is very difficult to obtain manually. In addition, among these rosters they identify the potentially efficient ones with respect to the BRP model’s two objectives, one concerning the interests of administration, the other the interests of the workers. Both heuristics have advantages and drawbacks. This suggests that they should be used complementarily. On the other hand, the heuristics can, with little effort, be adapted to a wide variety of rostering rules.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Aickelin U, Dowsland KA (2004) An indirect genetic algorithm for a nurse scheduling problem. Comput Oper Res 31:761–778
Bianco L, Bielli M, Mingozzi MA, Ricciardelli S, Spadoni M (1992) A heuristic procedure for the crew rostering problem. Eur J Oper Res 58:272–283
Cappanera P, Gallo G (2004) A multicommodity flow approach to the crew rostering problem. Oper Res 52:583–596
Caprara A, Fischetti M, Toth P, Vigo D, Guida PL (1997) Algorithms for railway crew management. Math Program 79:125–141
Caprara A, Fischetti M, Toth P, Vigo D (1998) Modeling and solving the crew rostering problem. Oper Res 46:820–830
Caprara A, Fischetti M, Guida PL, Toth P, Vigo D (1999) Solution to large scale railway crew planning problems: the Italian experience. In: Wilson NHM (ed) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 471. Springer, Berlin, pp 1–18
Carraresi P, Gallo G (1984) A multilevel bottleneck assignment approach to the bus driver’s rostering problem. Eur J Oper Res 16:163–173
Catanas F, Paixão J (1995) A new approach for the crew rostering problem. In: Daduna J, Branco I, Paixão J (eds) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 430. Springer, Berlin, pp 267–277
Chu SCK (2007) Generating, scheduling and rostering of shift crew-duties: applications at the Hong Kong international airport. Eur J Oper Res 177:1764–1778
Collette Y, Siarry P (2005) Three new metrics to measure the convergence of metaheuristics towards the Pareto frontier and the aesthetic of a set of solutions in biobjective optimization. Comput Oper Res 32:773–792
CPLEX Manual (version 11) (2007) Using the CPLEX callable library and CPLEX mixed integer library. ILOG INC., Incline Village
Dantzig GB (1954) A comment on Edie’s ‘Traffic delays at toll booths’. J Oper Res Soc Am 2:339–341
Dornberger R, Frey L, Hanne T (2008) Single and multiobjective optimization of the train staff planning problem using genetic algorithms. In: Evolutionary computation, 2008. Proceedings of CEC 2008. (IEEE world congress on computational intelligence), pp 970–977
Emden-Weinert T, Kotas H-G, Speer U (2001) DISSY—a driver rostering system for public transport. Version 1.11, DISSY project of programme ESPRIT
Ernst A, Jiang H, Krishnamoorthy M, Sier D (2004) Staff scheduling and rostering: a review of applications, methods and models. Eur J Oper Res 153:3–27
Freling R, Lentink RM, Wagelmans APM (2004) A decision support system for crew planning in passenger transportation using a flexible branch-and-price algorithm. Ann Oper Res 127:203–222
Goldberg D (1989) Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading
Hartog A, Huisman D, Abbink EJW, Kroon LG (2009) Decision support for crew rostering at NS. Public Transp 1. doi:10.1007/s12469-009-0009-6
Kohl N, Karisch SE (2004) Airline crew rostering: problem types, modelling, and optimization. Ann Oper Res 127:223–257
Lezaun M, Perez G, Maza ES (2006) Crew rostering problem in a public transport company. J Oper Res Soc 57:1173–1179
Lucic P, Teodorovic D (1999) Simulated annealing for the multi-objective aircrew rostering problem. Transp Res A 33:19–45
Lucic P, Teodorovic D (2007) Metaheuristics approach to the aircrew rostering problem. Ann Oper Res 155:311–338
Mesquita M, Paias A (2008) Set partitioning/covering-based approaches for the integrated vehicle and crew scheduling problem. Comput Oper Res 35:1562–1575
Mesquita M, Moz M, Paias A, Paixão J, Pato MV, Respício A (2008) Solving public transit scheduling problems. Working paper 1-2008. Centro de Investigação Operacional, Universidade de Lisboa, 31 pp (submitted)
Mesquita M, Paias A, Respício A (2009) Branching approaches for integrated vehicle and crew scheduling. Public Transp 1:21–37
Moz M, Pato MV (2007) A genetic algorithm approach to a nurse rerostering problem. Comput Oper Res 34:667–691
Odoni A, Rousseau J-M, Wilson N (1994) Models in urban and air transportation. In: Pollock S, Rothkopf M, Barnett A (eds) Operations research in the public sector. Handbooks in operations research and management science, vol 6. North-Holland, Amsterdam, pp 107–150
Pato MV, Moz M (2008) Solving a bi-objective nurse rerostering problem by using a utopic genetic heuristic. J Heuristics 14:359–374
Pedrosa D, Constantino M (2001) Days-off scheduling in public transport companies. In: Voss S, Daduna J (eds) Computer aided transit scheduling. Lecture notes in economics and mathematical systems, vol 505. Springer, Berlin, pp 215–232
Portugal R, Lourenço HR, Paixão JP (2009) Driver scheduling problem modelling. Public Transp 1. doi:10.1007/s12469-008-0007-0
Silva JDL, Le KN (2008) A simple evolutionary algorithm with self-adaptation for multi-objective nurse scheduling. In: Cotta C, Sevaux M, Sörensen K (eds) Adaptative and multilevel metaheuristics, vol 136. Springer, Berlin, pp 133–155
Silva JDL, Burke EK, Petrovic S (2004) An introduction to multiobjective metaheuristics for scheduling and timetabling. In: Gandibleux X, Sevaux M, Sörensen K, T’kindt V (eds) Metaheuristics for multiobjective optimisation. Springer, Berlin, pp 91–129
Sodhi MS, Norris S (2004) A flexible, fast, and optimal modelling approach applied to crew rostering at London underground. Ann Oper Res 127:259–281
Zitzler E, Laumanns M, Thiele L (2002) SPEA2: improving the strength Pareto evolutionary algorithm for multiobjective optimization. In: Giannakoglou K, Tsahalis D, Periaux J, Papailiou K, Fogarty T (eds) Evolutionary methods for design, optimisation and control. CIMNE, Barcelona, pp 95–100
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Moz, M., Respício, A. & Pato, M.V. Bi-objective evolutionary heuristics for bus driver rostering. Public Transp 1, 189–210 (2009). https://doi.org/10.1007/s12469-009-0013-x
Published:
Issue Date:
DOI: https://doi.org/10.1007/s12469-009-0013-x