Abstract
The problem of personal scheduling in hospitals is an important problem of applied combinatorial optimization. Numerous specialized heuristics as well as metaheuristic methods have been proposed for solving that problem. The recently proposed shift sequence based method is one of the most efficient. In the present paper we propose an enhancement making that method faster, and improving its general performance. The original and enhanced versions of the algorithm have been compared using the real data from one of the main Lithuanian hospitals.
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
Aickelin, U., Dowsland, K.: An Indirect Genetic Algorithm for a Nurse Scheduling Problem. Computers and Operations Research 31(5), 761–778 (2004)
Aickelin, U., Jingpeng, L.: An Estimation of Distribution Algorithm for Nurse Scheduling. Annals of Operations Research 155(1), 289–309 (2007)
Aickelin, U., White, P.: Building Better Nurse Scheduling Algorithms. Annals of Operations Research 128(1-4), 159–177 (2004)
Azaiez, M.N., Al Sharif, S.S.: A 0-1 goal programming model for nurse scheduling. Computers and Operations Research 32, 491–507 (2005)
Brucker, P., Burke, E., Curtois, T., Qu, R., Vanden Berghe, G.: A shift sequence based approach for nurse scheduling and a new benchmark dataset. Journal of Heuristics 16(4), 559–573 (2010)
Burke, E., Curtois, T., Post, G., Qu, R., Veltman, B.: A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem. European Journal of Operational Research 188(2), 330–341 (2008)
Ikegami, A., Niwa, A.: A subproblem-centric model and approach to the nurse scheduling problem. Mathematical Programming 97(3), 517–541 (2003)
Jingpeng, L., Aickelin, U.: Bayesian Optimisation Algorithm for Nurse Scheduling. In: Scalable Optimization via Probabilistic Modeling, pp. 315–332 (2006)
Kundu, S., Mahato, M., Mahanty, B., Acharyya, S.: Comparative Performance of Simulated Annealing and Genetic Algorithm in Solving Nurse Scheduling Problem. In: IMECS 2008, vol. I (2008)
Selman, B., Kautz, H.A.: An Empirical Study of Greedy Local Search for Satisfiability Testing. In: Proceedings of the Eleventh National Conference of Artificial Inteligence, pp. 46–51 (1993)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Liogys, M., Zilinskas, A. (2012). A Variable Neighbourhood Search Enhancement for the Shift Sequence Based Method of the Personal Scheduling in Hospitals. In: Skersys, T., Butleris, R., Butkiene, R. (eds) Information and Software Technologies. ICIST 2012. Communications in Computer and Information Science, vol 319. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33308-8_2
Download citation
DOI: https://doi.org/10.1007/978-3-642-33308-8_2
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33307-1
Online ISBN: 978-3-642-33308-8
eBook Packages: Computer ScienceComputer Science (R0)