Solving a real-world nurse rostering problem by Simulated Annealing

被引：8

作者：

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

来源：

OPERATIONS RESEARCH FOR HEALTH CARE | 2023年 / 36卷

关键词：

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 条

[41] Grey Wolf Optimizer for the Nurse Rostering Problem [J].

Ngoo, Chong Man ;

Goh, Say Leng ;

Likoh, Jonathan .

2022 IEEE 13TH CONTROL AND SYSTEM GRADUATE RESEARCH COLLOQUIUM, ICSGRC, 2022, :11-15

[42] Integer programming techniques for the nurse rostering problem [J].

Haroldo G. Santos ;

Túlio A. M. Toffolo ;

Rafael A. M. Gomes ;

Sabir Ribas .

Annals of Operations Research, 2016, 239 :225-251

[43] A Greedy Constructive Approach for Nurse Rostering Problem [J].

Jamom, Mouna ;

Ayob, Masri ;

Hadwan, Mohammed .

2011 3RD CONFERENCE ON DATA MINING AND OPTIMIZATION (DMO), 2011, :227-231

[44] Solving the location-routing problem with simultaneous pickup and delivery by simulated annealing [J].

Yu, Vincent F. ;

Lin, Shin-Yu .

INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (02) :526-549

[45] Efficiently solving the Traveling Thief Problem using hill climbing and simulated annealing [J].

El Yafrani, Mohamed ;

Ahiod, Belaid .

INFORMATION SCIENCES, 2018, 432 :231-244

[46] Solving the assignment problem using genetic algorithm and simulated annealing [J].

Sahu, Anshuman ;

Tapadar, Rudrajit .

IMECS 2006: INTERNATIONAL MULTICONFERENCE OF ENGINEERS AND COMPUTER SCIENTISTS, 2006, :762-+

[47] New variants of simulated annealing for solving a biobjective assignment problem [J].

Adiche, Chahrazad ;

Aïder, Méziane .

Revue d'Intelligence Artificielle, 2008, 22 (02) :237-255

[48] Refined simulated annealing method for solving the unit commitment problem [J].

Rajan, CCA .

ENGINEERING INTELLIGENT SYSTEMS FOR ELECTRICAL ENGINEERING AND COMMUNICATIONS, 2004, 12 (04) :243-251

[49] Solving for a Quay Crane Scheduling and Assignment Problem by Simulated Annealing [J].

Tavakkoli-Moghaddam, Reza ;

Taheri, Farid ;

Bazzazi, Mohammad .

PROCEEDINGS OF INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND SYSTEMS MANAGEMENT (IESM'2011): INNOVATIVE APPROACHES AND TECHNOLOGIES FOR NETWORKED MANUFACTURING ENTERPRISES MANAGEMENT, 2011, :326-333

[50] Pathfinder Based on Simulated Annealing for Solving Placement and Routing Problem [J].

Yu, Zhangyi ;

Zeng, Sanyou ;

Guo, Yan ;

Hu, Nannan ;

Song, Liguo .

ADVANCES IN COMPUTATION AND INTELLIGENCE, 2010, 6382 :390-+

← 1 2 3 4 5 →