Building Better Nurse Scheduling Algorithms

Annals of Operations Research, 128, pp 159-177, 2004

18 Pages Posted: 17 Aug 2016

See all articles by Uwe Aickelin

Uwe Aickelin

University of Melbourne - School of Computing and Information Systems

Paul White

University of the West of England (UWE)

Date Written: January 1, 2004

Abstract

The aim of this research is twofold: Firstly, to model and solve a complex nurse scheduling problem with an integer programming formulation and evolutionary algorithms. Secondly, to detail a novel statistical method of comparing and hence building better scheduling algorithms by identifying successful algorithm modifications. The comparison method captures the results of algorithms in a single figure that can then be compared using traditional statistical techniques. Thus, the proposed method of comparing algorithms is an objective procedure designed to assist in the process of improving an algorithm. This is achieved even when some results are non-numeric or missing due to infeasibility. The final algorithm outperforms all previous evolutionary algorithms, which relied on human expertise for modification.

Keywords: Nurse scheduling, evolutionary algorithms, integer programming, statistical comparison method

Suggested Citation

Aickelin, Uwe and White, Paul, Building Better Nurse Scheduling Algorithms (January 1, 2004). Annals of Operations Research, 128, pp 159-177, 2004, Available at SSRN: https://ssrn.com/abstract=2824160

Uwe Aickelin (Contact Author)

University of Melbourne - School of Computing and Information Systems ( email )

Australia

Paul White

University of the West of England (UWE) ( email )

Do you have negative results from your research you’d like to share?

Paper statistics

Downloads
25
Abstract Views
334
PlumX Metrics