Maximax & Maximin and 2FBlockwise Operators: Enhancement in the Evolutionary Algorithm for a Nurse Scheduling Problem

• المؤلفون الرئيسيون: Ramli, Razamin, Huai Tein, Lim
• التنسيق: مقال
• اللغة: English
• منشور في: Universiti Teknikal Malaysia Melaka 2017
• الموضوعات: QA Mathematics
• الوصول للمادة أونلاين: https://repo.uum.edu.my/id/eprint/31040/1/JTECE%2009%2001-02%202017%2001-06.pdf; https://repo.uum.edu.my/id/eprint/31040/; https://jtec.utem.edu.my/jtec/article/view/1641
• المؤسسة: Universiti Utara Malaysia

An effective and efficient nurse work schedule could fulfill nurses’ work satisfaction. It certainly could provide a better coverage with appropriate staffing levels in managing nurse workforce, thus improves hospital operations. Hence, the aim of this paper is to construct the best nurse work schedule based on the rules and requirements of the nurse scheduling problem (NSP). In doing so, an improved selection operator and crossover operator in an Evolutionary Algorithm (EA) strategy for an NSP is developed as an enhanced algorithm. The smart and efficient scheduling procedures were revealed in this strategy. Computation of the performance of each potential solution or schedule was done through a fitness evaluation. The best solution so far was obtained via special Maximax & Maximin (MM) parent selection and 2Fblockwise crossover operators embedded in the EA, which fulfilled all constraints being considered in the NSP as much as possible. This proposed EA has shown that it provides the highest success rate in achieving feasible solutions when comparing with other similar variants of the algorithm