Building Better Nurse Scheduling Algorithms

Article, Preprint English OPEN
Aickelin, Uwe ; White, Paul (2008)
  • Publisher: Springer Verlag (Germany)
  • Related identifiers: doi: 10.1023/B:ANOR.0000019103.31340.a6
  • Subject: Computer Science - Computational Engineering, Finance, and Science | Computer Science - Neural and Evolutionary Computing

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.
  • References (20)
    20 references, page 1 of 2

    Aickelin U. (2002). “An Indirect Genetic Algorithm for Set Covering Problems”. Journal of the Operational Research Society, 53(10): 1118-1126.

    Aickelin U and Dowsland K. (2002). “A Comparison of Indirect Genetic Algorithm Approaches to Multiple Choice Problems”. Journal of Heuristics, Journal of Heuristics, 8 (5): 503-514, 2002.

    Aickelin U and Dowsland K. (2000). “Exploiting problem structure in a Genetic Algorithms approach to a nurse rostering problem”. Journal of Scheduling, Vol. 31, pp 139-153, 2000.

    Bäck T. (1993). “Applications of Evolutionary Algorithms”. 5th Edition, Dortmund, Germany.

    Bradley D and Martin J. (1990). “Continuous Personnel Scheduling Algorithms: A Literature Review”. Journal of the Society for Health Systems 2:8-23.

    Chaiyaratana N, Zalzala A. (1997). “Recent Developments in Evolutionary and Genetic Algorithms: Theory and Applications”. In Fleming P, Zalzala S. editors. Genetic Algorithms in Engineering Systems 2: Innovations and Applications. IEEE Proceedings, Letchworth: Omega Print & Design, 270-277.

    Conover, WJ. (1980). “Practical Nonparametric Statistics”. 2nd Edition, John Wiley and Sons, New York.

    De Jong K. (1993). “Genetic Algorithms are NOT Function Optimisers”. In Whitley D. Editor. Foundations of Genetic Algorithms 2. San Mateo: Morgan Kaufmann Publishers, 5-17.

    Deb K. (1996). “Genetic Algorithms for Function Optimisation”. Genetic Algorithms and Soft Computing 4-31.

    Dowsland K and Thompson J. (2000). “Nurse Scheduling with Knapsacks, Networks and Tabu Search”. Journal of the Operational Research Society 825-833.

  • Metrics
    No metrics available
Share - Bookmark