Computers and Operations Research
Variable neighborhood search for nurse rostering problems
Metaheuristics
An electromagnetic meta-heuristic for the nurse scheduling problem
Journal of Heuristics
A grasp-knapsack hybrid for a nurse-scheduling problem
Journal of Heuristics
Hi-index | 0.00 |
This paper presents a hybrid swarm-based optimization algorithm that combines genetic algorithm (GA) and variable neighborhood search (VNS) to deal with highly-constrained nurse scheduling problems in modern hospital environments. The problem is first divided into several sub-problems by the average principle. Then a genetic algorithm is used to solve the sub-problems including a subset of constraints. Better feasible solutions are built by a hybrid genetic algorithm; they are taken as the initial solution of the variable neighborhood search procedure. The proposed algorithm can be applied to other resource allocation problems with a large number of constraints. The experiment results show that our method can produce feasible solutions.