Metaheuristic Hybridization: A Case Study for Nurse Scheduling


Turgut Y. , Erdoğan Z. M.

Global Joint Conference on Industrial Engineering and Its Application Areas (GJCIE), ELECTR NETWORK, 14 - 15 August 2020, pp.393-406 identifier

  • Publication Type: Conference Paper / Full Text
  • Doi Number: 10.1007/978-3-030-76724-2_29
  • Country: ELECTR NETWORK
  • Page Numbers: pp.393-406
  • Keywords: Nurse scheduling, Constraint programming, Genetic algorithm, Hybridization

Abstract

This paper addresses a nurse scheduling problem frequently encountered in hospital management. To make nurses satisfied and use their best skills during the work process is a critical issue at the center of this problem. Besides, hospitals need to minimize personnel costs while keeping service quality at the highest level. We try to schedule nurses by considering their preferences and meet hospital management expectations at the same time. Our problem has hard and soft constraints that are faced in real-world case studies. Hard constraints are satisfied directly by applying the constraint programming method, and soft constraints are satisfied using a penalty cost applied in meta-heuristic algorithms. The initial model is structured using a Genetic algorithm (GA), then it is hybridized with the simulated annealing (SA) to obtain a nurse schedule. Results are compared with MIP solutions concerning the quality of solutions and the corresponding running time. Achievements are analyzed and discussed to make the proposed model applicable by hospital managers as well as researchers.