A scatter search methodology for the nurse rostering problem

被引:53
|
作者
Burke, E. K.
Curtois, T. [1 ]
Qu, R.
Vanden Berghe, G. [2 ,3 ]
机构
[1] Univ Nottingham, Sch Comp Sci, Nottingham NG8 1BB, England
[2] KaHo St Lieven, Ghent, Belgium
[3] Katholieke Univ Leuven, Kortrijk, Belgium
基金
英国工程与自然科学研究理事会;
关键词
nurse rostering; scatter search; heuristics; NEIGHBORHOOD SEARCH; SCHEDULING PROBLEM; ALGORITHM;
D O I
10.1057/jors.2009.118
中图分类号
C93 [管理学];
学科分类号
12 ; 1201 ; 1202 ; 120202 ;
摘要
The benefits of automating the nurse scheduling process in hospitals include reducing the planning workload and associated costs and being able to create higher quality and more flexible schedules. This has become more important recently in order to retain nurses and to attract more people into the profession. Better quality rosters also reduce fatigue and stress due to overwork and poor scheduling and help to maximise the use of leisure time by satisfying more requests. A more contented workforce will lead to higher productivity, increased quality of patient service and a better level of healthcare. This paper presents a scatter search approach for the problem of automatically creating nurse rosters. Scatter search is an evolutionary algorithm, which has been successfully applied across a number of problem domains. To adapt and apply scatter search to nurse rostering, it was necessary to develop novel implementations of some of scatter search's subroutines. The algorithm was then tested on publicly available real-world benchmark instances and compared against previously published approaches. The results show the proposed algorithm is a robust and effective method on a wide variety of real-world instances. Journal of the Operational Research Society (2010) 61, 1667-1679. doi: 10.1057/jors.2009.118 Published online 4 November 2009
引用
收藏
页码:1667 / 1679
页数:13
相关论文
共 50 条
  • [1] Hybrid Harmony Search Algorithm for Nurse Rostering Problem
    Nie, Yabing
    Wang, Bing
    Zhang, Xianxia
    [J]. HARMONY SEARCH ALGORITHM, 2016, 382 : 109 - 120
  • [2] A hybrid tabu search algorithm for the nurse rostering problem
    Burke, E
    De Causmaecker, P
    Vanden Berghe, G
    [J]. SIMULATED EVOLUTION AND LEARNING, 1999, 1585 : 187 - 194
  • [3] An adaptive method with local search for nurse rostering problem
    Nie Yabing
    Wang Bing
    Han Xingbao
    [J]. 2015 34TH CHINESE CONTROL CONFERENCE (CCC), 2015, : 2726 - 2731
  • [4] Annealing Harmony Search Algorithm to Solve the Nurse Rostering Problem
    Hadwan, Mohammed
    [J]. CMC-COMPUTERS MATERIALS & CONTINUA, 2022, 71 (03): : 5545 - 5559
  • [5] A tabu search approach with embedded nurse preferences for solving nurse rostering problem
    Ramli, Razamin
    Ahmad, Siti Nurin Ima
    Abdul-Rahman, Syariza
    Wibowo, Antoni
    [J]. International Journal for Simulation and Multidisciplinary Design Optimization, 2020, 11
  • [6] A hybrid heuristic ordering and variable neighbourhood search for the nurse rostering problem
    Burke, Edmund K.
    Curtois, Timothy
    Post, Gerhard
    Qu, Rong
    Veltman, Bart
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2008, 188 (02) : 330 - 341
  • [7] A greedy-based neighborhood search approach to a nurse rostering problem
    Bellanti, F
    Carello, G
    Della Croce, F
    Tadei, R
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2004, 153 (01) : 28 - 40
  • [8] An Analysis of the Application of the Harmony Search Algorithm to Solving the Nurse Rostering Problem
    Lartey, Kelvin
    Akowuah, Emmanuel Kofi
    [J]. CIN-COMPUTERS INFORMATICS NURSING, 2021, 39 (05) : 281 - 288
  • [9] Adaptive neighborhood search for nurse rostering
    Lu, Zhipeng
    Hao, Jin-Kao
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 218 (03) : 865 - 876
  • [10] HARMONY SEARCH WITH NOVEL SELECTION METHODS IN MEMORY CONSIDERATION FOR NURSE ROSTERING PROBLEM
    Awadallah, Mohammed A.
    Khader, Ahamad Tajudin
    Al-Betar, Mohammed Azmi
    Bolaji, Asaju La'aro
    [J]. ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2014, 31 (03)