Abstract
A two-stage heuristic algorithm is proposed for solving a trainee rotation assignment problem in a local school of nursing and its training hospital. At the first stage, the model is reduced to a simplified assignment problem and solved using a random search procedure. At the second stage, a problem-specific operator is designed and employed with a hill climber to further improve solutions. We benchmark our algorithm with instances generated based on the real-life rules. Results show that the proposed algorithm yields high-quality solutions in less computation time for large scale instances when compared with integer linear programming formulation using the commercial solver Cplex.
The work is supported by the Project of Shandongp Province Higher Educational Science and Technology Program (Grant No. J14LN10) and National Natural Science Foundation of China (Grant No. 61472231).
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
References
Beliën, J., Demeulemeester, E.: Scheduling trainees at a hospital department using a branch-and-price approach. Eur. J. Oper. Res. 175(1), 258–278 (2006)
Beliën, J., Demeulemeester, E.: On the trade-off between staff-decomposed and activity-decomposed column generation for a staff scheduling problem. Annal. Oper. Res. 155(1), 143–166 (2007)
Bergh, J.V.D., Beliën, J., Bruecker, P.D., Demeulemeester, E., Boeck, L.D.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)
Bettinelli, A., Cacchiani, V., Roberti, R., Toth, P.: An overview of curriculum-based course timetabling. TOP 23(2), 313–349 (2015)
Burke, E.K., Mareček, J., Parkes, A.J., Rudová, H.: Penalising patterns in timetables: novel integer programming formulations. In: Kalcsics, J., Nickel, S. (eds.) Operations Research Proceedings 2007, vol. 2007. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77903-2_63
Burke, E.K., Marecek, J., Parkes, A.J., Rudová, H.: Decomposition, reformulation, and diving in university course timetabling. Comput. Oper. Res. 37(3), 582–597 (2010)
Guo, J., Morrison, D.R., Jacobson, S.H., Jokela, J.A.: Complexity results for the basic residency scheduling problem. J. Sched. 17(3), 211–223 (2014)
Smalley, H.K., Keskinocak, P.: Automated medical resident rotation and shift scheduling to ensure quality resident education and patient care. Health Care Manag. Sci. 19, 1–23 (2014)
Wang, C., Sun, L., Jin, M., Fu, C., Liu, L., Chan, C., Kao, C.: A genetic algorithm for resident physician scheduling problem. In: Proceedings of Genetic and Evolutionary Computation Conference, GECCO 2007, London, England, UK, 7–11 July 2007, pp. 2203–2210 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG, part of Springer Nature
About this paper
Cite this paper
Zheng, Z., Gong, X. (2018). A Two-Stage Heuristic Approach for a Type of Rotation Assignment Problem. In: Tan, Y., Shi, Y., Tang, Q. (eds) Advances in Swarm Intelligence. ICSI 2018. Lecture Notes in Computer Science(), vol 10942. Springer, Cham. https://doi.org/10.1007/978-3-319-93818-9_20
Download citation
DOI: https://doi.org/10.1007/978-3-319-93818-9_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-93817-2
Online ISBN: 978-3-319-93818-9
eBook Packages: Computer ScienceComputer Science (R0)