A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

A DIFFERENTIAL EVOLUTION ALGORITHM DEVELOPED FOR A NURSE SCHEDULING PROBLEM

Blog Article

Nurse scheduling is a type of manpower allocation problem that tries to satisfy hospital managers objectives and nurses preferences as much as possible by generating fair shift schedules.This paper presents a nurse scheduling problem based on a real Pads case study, and proposes two meta-heuristics a differential evolution algorithm (DE) and a greedy randomised adaptive search procedure (GRASP) to solve it.To investigate the efficiency of the proposed algorithms, two problems are solved.Furthermore, some comparison metrics are applied L-Desk to examine the reliability of the proposed algorithms.

The computational results in this paper show that the proposed DE outperforms the GRASP.