The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz The Doctor Rostering Problem - Asser Fahrenholz
Preface This Master Thesis presents the work of Asser Stubbe Fahrenholz, February to November 2008. The work describes a solution for the doctor rostering problem of a small medical practice housing six doctors, in St. Heddinge, Denmark. Signed: Date: i
TECHNICAL UNIVERSITY OF DENMARK Abstract Department of Informatics and Mathematical Modelling author: Asser Stubbe Fahrenholz , s032651 The Doctor Rostering Problem (DRP) covers the scheduling of doctors to shifts with respect to a range of constraints, that ensure satisfied employees. The problem is first modelled mathematically and then solved heuristicly by the use of two metaheuristics, GRASP and Simulated Annealing. Both heuristics are described in theory and are tested on real world data, as well as constructed problems that tests the various parameters of the implementation as well as the effect of more or less constrained problems. A relaxed version of the problem is solved in GAMS to optimality and the solution is compared to the solution of the heuristics. The heuristics are implemented in a prototype of a software program ready to use by the medical practice. Test results indicate that near-optimal to optimal solutions are found and that the construction heuristic are the dominant factor for the quality of the solutions.
- Page 1: TECHNICAL UNIVERSITY OF DENMARK The
- Page 5 and 6: Acknowledgements Foremost, I would
- Page 7 and 8: Contents vi 4.3.1 A construction he
- Page 9 and 10: List of Figures 4.1 The transformat
- Page 11 and 12: List of Algorithms 4.1 Adaptive gre
- Page 13 and 14: Chapter 1. Introduction and problem
- Page 15 and 16: Chapter 2. The Doctor Rostering Pro
- Page 17 and 18: Chapter 2. The Doctor Rostering Pro
- Page 19 and 20: Chapter 3 A mathematical model for
- Page 21 and 22: Chapter 3. The model and design 10
- Page 23 and 24: Chapter 3. The model and design 12
- Page 25 and 26: Chapter 3. The model and design 14
- Page 27 and 28: Chapter 4. Solving the DRP 16 it in
- Page 29 and 30: Chapter 4. Solving the DRP 18 4.3.1
- Page 31 and 32: Chapter 4. Solving the DRP 20 Given
- Page 33 and 34: Chapter 4. Solving the DRP 22 Since
- Page 35 and 36: Chapter 4. Solving the DRP 24 1. Co
- Page 37 and 38: Chapter 4. Solving the DRP 26 decre
- Page 39 and 40: Chapter 4. Solving the DRP 28 This
- Page 41 and 42: Chapter 4. Solving the DRP 30 Simul
- Page 43 and 44: Chapter 5. Optimal solution 32 The
- Page 45 and 46: Chapter 6 The DRP Program Through t
- Page 47 and 48: Chapter 6. The DRP Program 36 Figur
- Page 49 and 50: Chapter 6. The DRP Program 38 of th
- Page 51 and 52: Chapter 6. The DRP Program 40 Figur
TECHNICAL UNIVERSITY OF DENMARK<br />
Abstract<br />
Department of Informatics and Mathematical Modelling<br />
author: <strong>Asser</strong> Stubbe <strong>Fahrenholz</strong> , s032651<br />
<strong>The</strong> <strong>Doctor</strong> <strong>Rostering</strong> <strong>Problem</strong> (DRP) covers the scheduling of doctors to shifts with<br />
respect to a range of constraints, that ensure satisfied employees. <strong>The</strong> problem is first<br />
modelled mathematically and then solved heuristicly by the use of two metaheuristics,<br />
GRASP and Simulated Annealing. Both heuristics are described in theory and are tested<br />
on real world data, as well as constructed problems that tests the various parameters of<br />
the implementation as well as the effect of more or less constrained problems. A relaxed<br />
version of the problem is solved in GAMS to optimality and the solution is compared to<br />
the solution of the heuristics. <strong>The</strong> heuristics are implemented in a prototype of a software<br />
program ready to use by the medical practice. Test results indicate that near-optimal to<br />
optimal solutions are found and that the construction heuristic are the dominant factor<br />
for the quality of the solutions.
Change language