Abstract
Flexibility of shifts assignment in real-time condition is complex because it must consider multiple important aspects such as nurses’ diverse requests and nurse ward coverage. In fact, creating nurses’ work schedule is a time-consuming task and the created schedule may not be effective due to considerable dependence of the process on the head nurse’s capability and working experiences. Thus, hospitals are becoming increasingly interested in the deployment of technology to solve the nurse scheduling problems. In the current research, three classifications of constraints namely the hard, semi-hard and soft constraints were implemented technically to refine undesirable work schedule in nurse scheduling. To deal with heavy constraints handling, this research implemented an enhancement of Evolutionary Algorithm with Discovery Rate Tournament parent selection operator (DrT) to minimize constraints violations. Selection intensity resulted from hybridizing discovery rate of Cuckoo Search and tournament elements were used for exploration and exploitation. Correspondingly, three parent selections were tested, and DrT parent selection was found to achieve the best accuracy which gives way to obtaining better quality schedule with lowest fitness value. In particular, the superiority of DrT parent selection suggested that selecting elite parents and ensuring diverse characteristic of the selected parents in a population are especially useful in small-sized population.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bard, J.F., Purnomo, H.W.: Short-term nurse scheduling in response to daily fluctuations in supply and demand. Health Care Manag. Sci. 8, 315–324 (2005)
Kalisch, B.J., Aebersold, M.: Interruptions and multitasking in nursing care. Joint Comm. J. Qual. Patient Saf. 36(3), 126–132 (2010)
Sangai, J., Bellabdaoui, A.: Workload balancing in nurse scheduling problem models and discussion. In: 2017 International Colloquium on Logistics and Supply Chain Management (LOGISTIQUA), pp. 82–87. IEEE, April 2017
Shahriari, M., Shamali, M., Yazdannik, A.: The relationship between fixed and rotating shifts with job burnout in nurses working in critical care areas. Iran. J. Nurs. Midwifery Res. 19(4), 360–365 (2014)
Gormley, D.K.: Are we on the same page? staff nurse and manager perceptions of work environment, quality of care and anticipated nurse turnover. J. Nurs. Manag. 19, 33–40 (2011)
Youssef, A., Senbel, S.: A bi-level heuristic solution for the nurse scheduling problem based on shift-swapping. In: 2018 IEEE 8th Annual Computing and Communication Workshop and Conference (CCWC), pp. 72–78. IEEE, January 2018
Clark, A.R., Walker, H.: Nurse rescheduling with shift preferences and minimal disruption. J. Appl. Oper. Res. 3(3), 148–162 (2011)
Aickelin, U., Dowsland, K.A.: Exploiting problem structure in a genetic algorithm approach to a nurse rostering problem. J. Sched. 3(3), 139–153 (2000)
Azaiez, M.N., Al Sharif, S.S.: A 0-1 goal programming model for nurse scheduling. Comput. Oper. Res. 32, 491–507 (2005)
Glass, C.A., Knight, R.A.: The nurse rostering problem: a critical appraisal of the problem structure. Eur. J. Oper. Res. 202(2), 379–389 (2010)
Van den Bergh, J., Beliën, J., De Bruecker, P., Demeulemeester, E., De Boeck, L.: Personnel scheduling: a literature review. Eur. J. Oper. Res. 226(3), 367–385 (2013)
Wu, T.H., Yeh, J.Y., Lee, Y.M.: A particle swarm optimization approach with refinement procedure for nurse rostering problem. J. Comput. Oper. Res. 54, 52–63 (2015)
Karmakar, S., Chakraborty, S., Chatterjee, T., Baidya, A., Acharyya, S.: Meta-heuristics for solving nurse scheduling problem: a comparative study. In: 2016 2nd International Conference on Advances in Computing, Communication, & Automation (ICACCA) (Fall), pp. 1–5. IEEE, September 2016
Bunton, J.D., Ernst, A.T., Krishnamoorthy, M.: An integer programming based ant colony optimisation method for nurse rostering. In: 2017 Federated Conference on Computer Science and Information Systems (FedCSIS), pp. 407–414. IEEE, September 2017
Tein, L.H., Ramli, R.: Recent advancements of nurse scheduling models and a potential path. In Proceedings of 6th IMT-GT Conference on Mathematics, Statistics and its Applications (ICMSA 2010), pp. 395–409, November 2010
Burke, E.K., Curtois, T.: New approaches to nurse rostering benchmark instances. Eur. J. Oper. Res. 237(1), 71–81 (2014)
Lim, H.T., Ramli, R.: Enhancements of evolutionary algorithm for the complex requirements of a nurse scheduling problem. In: Proceedings of the 3rd International Conference on Quantitative Sciences and Its Applications (ICOQSIA 2014), vol. 1635, pp. 615–619. American Institute of Physics Conference Series (AIP) Publishing (2014)
Aggour, K.S., Moitra, A.: Advances in schedule optimization with genetic algorithms. GE Global Research, GRC111 (2003)
Muntz, A.H., Wang, K.: Workload model specifications and adaptive scheduling of semi-hard real-time controls. In: Proceedings of the First International Conference on Systems Integration, pp. 403–414. IEEE (1990)
Grandoni, F., Könemann, J., Panconesi, A., Sozio, M.: Primal-dual based distributed algorithms for vertex cover with semi-hard capacities. In: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, pp. 118–125. ACM (2005)
Kelemen, A., Franklin, S., Liang, Y.L.: Constraint satisfaction in “conscious” software agents- a practical application. Appl. Artif. Intell. 19, 491–514 (2005)
Abdallah, K.S., Jang, J.: An exact solution for vehicle routing problems with semi-hard resource constraints. Comput. Indu. Eng. 76, 366–377 (2014)
Hutter, M., Legg, S.: Fitness uniform optimization. IEEE Trans. Evol. Comput. 10(5), 568–589 (2006)
Kazimipour, B., Li, X., Qin, A.Q.: A review of population initialization techniques for evolutionary algorithms. In: IEEE Congress on Evolutionary Computation (CEC), pp. 2585–2592. IEEE (2014)
Ashlock, D.: Evolutionary Computation for Modeling and Optimization. Springer, USA (2005)
Al-Naqi, A., Erdogan, A.T., Arslan, T.: Fault tolerance through automatic cell isolation using three-dimensional cellular genetic algorithms. In: 2010 IEEE Congress on Evolutionary Computation (CEC), pp. 1–8. IEEE, New York (2010)
Veerapen, N., Maturana, J., Saubion, F.: An exploration-exploitation compromise-based adaptive operator selection for local search. In: Proceedings of the 2012 Genetic and Evolutionary Computation Conference (GECCO), pp. 1277–1284 (2012)
Tsai, C.C., Li, S.H.: A two-stage modeling with genetic algorithms for the nurse scheduling problem. Expert Syst. Appl. 36(5), 9506–9512 (2009)
Yang, F.C., Wu, W.T.: A genetic algorithm-based method for creating impartial work schedules for nurses. Int. J. Electr. Bus. Manag. 10(3), 182 (2012)
Burke, E.K., Smith, A.J.: Hybrid evolutionary techniques for the maintenance scheduling problem. IEEE Trans. Power Syst. 15(1), 122–128 (2000)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Switzerland AG
About this paper
Cite this paper
Lim, H.T., Yong, IS., Ng, P. (2020). Imperative Selection Intensity of Parent Selection Operator in Evolutionary Algorithm Hybridization for Nurse Scheduling Problem. In: Saeed, F., Mohammed, F., Gazem, N. (eds) Emerging Trends in Intelligent Computing and Informatics. IRICT 2019. Advances in Intelligent Systems and Computing, vol 1073. Springer, Cham. https://doi.org/10.1007/978-3-030-33582-3_23
Download citation
DOI: https://doi.org/10.1007/978-3-030-33582-3_23
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-33581-6
Online ISBN: 978-3-030-33582-3
eBook Packages: Intelligent Technologies and RoboticsIntelligent Technologies and Robotics (R0)