Solving a real-world nurse rostering problem by Simulated Annealing

被引:6
|
作者
Ceschia, Sara [1 ]
Di Gaspero, Luca [1 ]
Mazzaracchio, Vincenzo [2 ]
Policante, Giuseppe [2 ]
Schaerf, Andrea [1 ]
机构
[1] Univ Udine, DPIA, Via Sci 206, I-33100 Udine, Italy
[2] WINDEX srl, Via S Chiara 22, I-37012 Bussolengo, Italy
关键词
Nurse rostering; Real-world application; Local search; Simulated Annealing; Practice of OR; OPTIMIZATION; STRATEGIES;
D O I
10.1016/j.orhc.2023.100379
中图分类号
R19 [保健组织与事业(卫生事业管理)];
学科分类号
摘要
Designing high quality nurse rostering plans is essential for health care facilities in order to guarantee efficiency, safety and quality-of-care balanced with staff well-being. We introduce a new real-world formulation for the nurse rostering problem, arising in many Italian healthcare institutions, which has been developed in collaboration with a primary software company in the field. It considers nurses with different skills, special shifts depending on the skills, time work-load limits, and different types of days-off. In addition, preferences and incompatibilities between nurses are taken into account. We propose a MIP model and a local search method, driven by a Simulated Annealing metaheuristic, based on a combination of two neighborhoods. The solution method was tested on 34 real-world instances coming from various healthcare institutions in North Italy. The dataset is available at https://bitbucket.org/satt/nrp-instances, along with our best solutions. (c) 2023 Elsevier Ltd. All rights reserved.
引用
收藏
页数:11
相关论文
共 50 条
  • [11] A flexible mixed integer programming-based system for real-world nurse rostering
    Elín Björk Böðvarsdóttir
    Niels-Christian Fink Bagger
    Laura Elise Høffner
    Thomas J. R. Stidsen
    Journal of Scheduling, 2022, 25 : 59 - 88
  • [12] Solving a real-world train-unit assignment problem
    Cacchiani, Valentina
    Caprara, Alberto
    Toth, Paolo
    MATHEMATICAL PROGRAMMING, 2010, 124 (1-2) : 207 - 231
  • [13] Comparative performance of Simulated Annealing and Genetic Algorithm in solving Nurse Scheduling Problem
    Kundu, S.
    Mahato, M.
    Mahanty, B.
    Acharyya, S.
    IMECS 2008: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, VOLS I AND II, 2008, : 96 - 100
  • [14] Simulated annealing for the multi-objective aircrew rostering problem
    Lucic, P
    Teodorovic, D
    TRANSPORTATION RESEARCH PART A-POLICY AND PRACTICE, 1999, 33 (01) : 19 - 45
  • [15] Tree decompositions of real-world networks from simulated annealing
    Klemm, Konstantin
    JOURNAL OF PHYSICS-COMPLEXITY, 2020, 1 (03):
  • [16] A systematic two phase approach for the nurse rostering problem
    Valouxis, Christos
    Gogos, Christos
    Goulas, George
    Alefragis, Panayiotis
    Housos, Efthymios
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2012, 219 (02) : 425 - 433
  • [17] Solving the Fixed Graph Coloring Problem by Simulated Annealing and Greedy Search
    Zhao, Kai
    Geng, Xiutang
    Xu, Jin
    JOURNAL OF COMPUTATIONAL AND THEORETICAL NANOSCIENCE, 2015, 12 (04) : 637 - 646
  • [18] An Analysis of the Application of the Harmony Search Algorithm to Solving the Nurse Rostering Problem
    Lartey, Kelvin
    Akowuah, Emmanuel Kofi
    CIN-COMPUTERS INFORMATICS NURSING, 2021, 39 (05) : 281 - 288
  • [19] Solving a home energy management problem by Simulated Annealing
    Edoardo Bastianetto
    Sara Ceschia
    Andrea Schaerf
    Optimization Letters, 2021, 15 : 1553 - 1564
  • [20] Solving the dynamic berth allocation problem by simulated annealing
    Lin, Shih-Wei
    Ting, Ching-Jung
    ENGINEERING OPTIMIZATION, 2014, 46 (03) : 308 - 327