Cardiff University | Prifysgol Caerdydd ORCA
Online Research @ Cardiff 
WelshClear Cookie - decide language by browser settings

An indirect genetic algorithm for a nurse-scheduling problem

Aickelin, Uwe and Dowsland, Kathryn Anne 2004. An indirect genetic algorithm for a nurse-scheduling problem. Computers & operations research 31 (5) , pp. 761-778. 10.1016/S0305-0548(03)00034-0

Full text not available from this repository.

Abstract

This paper describes a Genetic Algorithms (GAs) approach to a manpower-scheduling problem arising at a major UK hospital. Although GAs have been successfully used for similar problems in the past, they always had to overcome the limitations of the classical GAs paradigm in handling the conflict between objectives and constraints. The approach taken here is to use an indirect coding based on permutations of the nurses, and a heuristic decoder that builds schedules from these permutations. Computational experiments based on 52 weeks of live data are used to evaluate three different decoders with varying levels of intelligence, and four well-known crossover operators. Results are further enhanced by introducing a hybrid crossover operator and by making use of simple bounds to reduce the size of the solution space. The results reveal that the proposed algorithm is able to find high quality solutions and is both faster and more flexible than a recently published Tabu Search approach.

Item Type: Article
Date Type: Publication
Status: Published
Schools: Mathematics
Uncontrolled Keywords: Genetic Algorithms ; Heuristics ; Manpower scheduling
Publisher: Elsevier
ISSN: 03050548
Last Modified: 19 Mar 2016 22:04
URI: https://orca.cardiff.ac.uk/id/eprint/1789

Citation Data

Cited 244 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item Edit Item