Building Better Nurse Scheduling Algorithms

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

This is the latest version of this item.

Full text not available from this repository.

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
RIS ID: https://nottingham-repository.worktribe.com/output/1021161
Additional Information: The original publication is available at www.springerlink.com
Keywords: Nurse scheduling, evolutionary algorithms, integer programming, statistical comparison method
Schools/Departments: University of Nottingham, UK > Faculty of Science > School of Computer Science
Identification Number: https://doi.org/10.1023/B:ANOR.0000019103.31340.a6
Depositing User: Aickelin, Professor Uwe
Date Deposited: 30 Oct 2007 14:37
Last Modified: 04 May 2020 20:31
URI: http://eprints.nottingham.ac.uk/id/eprint/662

Available Versions of this Item

Actions (Archive Staff Only)

Edit View Edit View