Classification of Various Neighborhood Operations for the Nurse Scheduling Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Combating user fatigue in iGAs: partial ordering, support vector machines, and synthetic fitness
GECCO '05 Proceedings of the 7th annual conference on Genetic and evolutionary computation
Hi-index | 0.00 |
Besides the difficulty of scheduling, major challenges of the nurse scheduling problems (NSPs) are constraint handling and chief nurses' psychological preference that is not clearly defined. It is too strong an assumption that the constructed objective functions in some existing researches are close to chief nurses' preference. This research presents a psychological preference-based optimization framework (PPOF) which optimizes constrained problems based on human preference. Moreover, an implementation on a realistic NSP is introduced. The experiments show that PPOF is able to optimize a monthly nurse schedule for National Taiwan University Hospital according to chief nurses' preference.