Cooperative search for fair nurse rosters |
| |
Authors: | Simon Martin Djamila Ouelhadj Pieter Smet Greet Vanden Berghe Ender Özcan |
| |
Affiliation: | 1. Logistics and Mathematics Management Group, University of Portsmouth, Department of Mathematics, UK;2. CODeS, KAHO, Computer Science, Belgium ITEC, iMinds, KU Leuven, Belgium;3. Automated Scheduling, Optimisation and Planning Research Group, University of Nottingham, Department of Computer Science, UK |
| |
Abstract: | The development of decision support systems acceptable for nurse rostering practitioners still presents a daunting challenge. Building on an existing nurse rostering problem, a set of fairness-based objective functions recently introduced in the literature has been extended. To this end, a generic agent-based cooperative search framework utilising new mechanisms is described, aiming to combine the strengths of multiple metaheuristics. These different metaheuristics represent individual planners’ implicit procedures for improving rosters. The framework enables to explore different ways of assessing nurse rosters in terms of fairness objectives. Computational experiments have been conducted across a set of benchmark instances. The overall results indicate that the proposed cooperative search for fair nurse rosters outperforms each metaheuristic run individually. |
| |
Keywords: | Cooperative search Agent-based systems Nurse rostering Fairness |
本文献已被 ScienceDirect 等数据库收录! |
|