Abstract
In this paper we consider solving a complex real life break scheduling problem. This problem of high practical relevance arises in many working areas, e.g. in air traffic control and other fields where supervision personnel is working. The objective is to assign breaks to employees such that various constraints reflecting legal demands or ergonomic criteria are satisfied and staffing requirement violations are minimised.
In our previous work we proposed a memetic algorithm for the assignment of breaks. We improve in this paper the previous method by proposing a new memetic representation, a new crossover and selection operator, and a penalty system that helps to select memes that have a better chance to be improved by a local search. Our approach is influenced by various parameters, for which we experimentally evaluate different settings. The impact of each parameter is statistically assessed. We compare our algorithm to state of the art results on a set of existing real life and randomly generated instances. Our new algorithm returns improved results on 28 out of the 30 benchmark instances. To the best of our knowledge, these results constitute current upper bounds for the respective instances.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aykin, T.: A comparative evaluation of modelling approaches to the labour shift scheduling problem. European Journal of Operational Research 125, 381–397 (2000)
Bechtold, S., Jacobs, L.: Implicit modelling of flexible break assignments in optimal shift scheduling. Management Science 36(11), 1339–1351 (1990)
Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: Scheduling breaks in shift plans for call centers. In: The 7th International Conference on the Practice and Theory of Automated Timetabling, Montréal, Canada (2008)
Beer, A., Gärtner, J., Musliu, N., Schafhauser, W., Slany, W.: An AI-based break-scheduling system for supervisory personnel. IEEE Intelligent Systems 25(2), 60–73 (2010)
Brindle, A.: Genetic algorithms for function optimisation. PhD thesis, University of Alberta, Department of Computer Science, Edmonton, Canada (1981)
Canon, C.: Personnel scheduling in the call center industry. 4OR: A Quarterly Journal of Operations Research 5(5(1), 89–92 (1989)
Côté, M.-C., Gendron, B., Quimper, C.-G., Rousseau, L.-M.: Formal languages for integer programming modeling of shift scheduling problems. Constraints (2009)
Dechter, R., Meiri, I., Pearl, J.: Temporal constraint networks. Artificial Intelligence 49, 61–95 (1991)
Di Gaspero, L., Gärtner, J., Musliu, N., Schaerf, A., Schafhauser, W., Slany, W.: A hybrid LS-CP solver for the shifts and breaks design problem. In: The 7th International Workshop on Hybrid Metaheuristics (HM 2010), Vienna, Austria. LNCS. Springer, Heidelberg (2010) (to appear)
Goldberg, D.: Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Publishing Company, Reading (1989)
Montgomery, D.: Design and Analysis of Experiments, 6th edn. John Wiley & Sons, Chichester (2005)
Moscato, P.: On evolution, search, optimization, gas and martial arts: Towards memetic algorithms. Technical Report Caltech Concurrent Comput. Prog. Rep. 826, California Institute of Technology (1989)
Musliu, N., Schafhauser, W., Widl, M.: A memetic algorithm for a break scheduling problem. In: 8th Metaheuristic International Conference, Hamburg, Germany (2009)
Quimper, C.-G., Rousseau, L.-M.: A large neighbourhood search approach to the multi-activity shift scheduling problem. Journal of Heuristics 16(3), 373–391 (2010)
Rekik, M., Cordeau, J., Soumis, F.: Implicit shift scheduling with multiple breaks and work stretch duration restrictions. Journal of Scheduling 13, 49–75 (2010)
http://www.dbai.tuwien.ac.at/proj/SoftNet/Supervision/Benchmarks/ (2008)
Tellier, P., White, G.: Generating personnel schedules in an industrial setting using a tabu search algorithm. In: Burke, E.K., Rudová, H. (eds.) PATAT 2007. LNCS, vol. 3867, pp. 293–302. Springer, Heidelberg (2006)
Widl, M.: Memetic algorithms for break scheduling. Master’s thesis, Vienna University of Technology, Vienna, Austria (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Widl, M., Musliu, N. (2010). An Improved Memetic Algorithm for Break Scheduling. In: Blesa, M.J., Blum, C., Raidl, G., Roli, A., Sampels, M. (eds) Hybrid Metaheuristics. HM 2010. Lecture Notes in Computer Science, vol 6373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-16054-7_10
Download citation
DOI: https://doi.org/10.1007/978-3-642-16054-7_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-16053-0
Online ISBN: 978-3-642-16054-7
eBook Packages: Computer ScienceComputer Science (R0)