Building Better Nurse Scheduling Algorithms

Aickelin, Uwe and White, Paul (2004) Building Better Nurse Scheduling Algorithms. Annals of Operations Research, 128 . pp. 159-177.

This is the latest version of this item.

[img] PDF - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
Download (255kB)

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.

Item Type: Article
Additional Information: The original publication is available at www.springerlink.com
Uncontrolled Keywords: Nurse scheduling, evolutionary algorithms, integer programming, statistical comparison method
Schools/Departments: University of Nottingham UK Campus > Faculty of Science > School of Computer Science
Depositing User: Aickelin, Professor Uwe
Date Deposited: 30 Oct 2007 14:37
Last Modified: 30 Oct 2007 14:37
URI: http://eprints.nottingham.ac.uk/id/eprint/662

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View