The Doctor Rostering Problem - Asser Fahrenholz
The Doctor Rostering Problem - Asser Fahrenholz The Doctor Rostering Problem - Asser Fahrenholz
Chapter 5. Optimal solution 33 Amount Amount Amount 1 0 1 0 1 0 Results 7,1,20 8,50,13 6,50,2 6,100,8 2,1,0 1,100,4 3,1,7 7,50,2 14,1,0 31,50,0 50,100,2 52,100,1 Z(S), RCL (%), V(S) Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day (a) Test 1 Results 6,1,19 5,50,16 2,50,1 8,1,0 10,100,10 1,100,4 5,1,2 6,50,5 11,1,0 33,50,0 44,100,1 56,100,0 Z(S), RCL (%), V(S) Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day (b) Test 2 Results 6,1,23 10,50,18 9,50,3 6,100,11 3,100,4 4,1,0 4,1,6 2,50,3 13,1,0 19,50,0 47,100,3 62,100,0 Z(S), RCL (%), V(S) Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day (c) Test 3 Figure 5.1: Comparison of heuristic performances for the GAMS problem
Chapter 6 The DRP Program Through this chapter, the reader is presented with the implementation of a graphical user interface, provided to the medical practice. The various features are described as to the allow reader to gain an insight into how the user interface connects with the concepts described in chapters 3 and 4 respectively. It should be noted that the implementation is a prototype of a software product and will most likely contain use cases that will cause the program to stop responding, fail or even crash. This is a direct consequence of the time horizon on this project. The program does enable the user to create usable schedules within minutes or even seconds. At the end of this chapter, I briefly review what program features are missing or lacking, for the program to be commercialised. The software can be found on the enclosed dvd 1 . 6.1 The user When developing an application, it is important to keep in mind who will be using the application. I recognise that the end user of the DRP program is not necessarily, on any level, good with computers or IT in general. It was a goal of this implementation to allow both experienced IT users to quickly grasp the features of the program, utilising all of the features and novice IT users to simply make use of the basic features. There is a fine line between adding features that enhance the capabilities of the software product and making it too complex for anyone outside the project to understand. This is also in line with the conclusion by Burke et al. [5], who recognise the importance of parameterless implementations. 1 Run the .jar-file, in the ”DRP/dist” folder 34
- Page 1 and 2: TECHNICAL UNIVERSITY OF DENMARK The
- Page 3 and 4: TECHNICAL UNIVERSITY OF DENMARK Abs
- 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: Chapter 5. Optimal solution 32 The
- 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
- Page 53 and 54: Chapter 7 Metaheuristic tests This
- Page 55 and 56: Chapter 7. Tests, results and discu
- Page 57 and 58: Chapter 7. Tests, results and discu
- Page 59 and 60: Chapter 7. Tests, results and discu
- Page 61 and 62: Chapter 7. Tests, results and discu
- Page 63 and 64: Chapter 7. Tests, results and discu
- Page 65 and 66: Chapter 8. Future considerations 54
- Page 67 and 68: Chapter 8. Future considerations 56
- Page 69 and 70: Chapter 9. Conclusion 58 The three
- Page 71 and 72: Appendix A. Implementation 60 27 //
- Page 73 and 74: 2 Appendix A. Implementation 62 3 i
- Page 75 and 76: Appendix A. Implementation 64 A.3 G
- Page 77 and 78: Appendix A. Implementation 66 97 wh
- Page 79 and 80: Appendix A. Implementation 68 27 su
- Page 81 and 82: Appendix A. Implementation 70 119 P
- Page 83 and 84: Appendix A. Implementation 72 64 br
- Page 85 and 86: Appendix A. Implementation 74 28 Ch
- Page 87 and 88: Appendix B GAMS Model This chapter
- Page 89 and 90: Appendix B. GAMS Model 78 46 c(day
- Page 91 and 92: Appendix B. GAMS Model 80 109 B1( f
- Page 93 and 94: Appendix B. GAMS Model 82 **** REPO
Chapter 5. Optimal solution 33<br />
Amount<br />
Amount<br />
Amount<br />
1<br />
0<br />
1<br />
0<br />
1<br />
0<br />
Results<br />
7,1,20 8,50,13 6,50,2 6,100,8 2,1,0 1,100,4 3,1,7 7,50,2 14,1,0 31,50,0 50,100,2 52,100,1<br />
Z(S), RCL (%), V(S)<br />
Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day<br />
(a) Test 1<br />
Results<br />
6,1,19 5,50,16 2,50,1 8,1,0 10,100,10 1,100,4 5,1,2 6,50,5 11,1,0 33,50,0 44,100,1 56,100,0<br />
Z(S), RCL (%), V(S)<br />
Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day<br />
(b) Test 2<br />
Results<br />
6,1,23 10,50,18 9,50,3 6,100,11 3,100,4 4,1,0 4,1,6 2,50,3 13,1,0 19,50,0 47,100,3 62,100,0<br />
Z(S), RCL (%), V(S)<br />
Greedy-Shift Greedy-Day GRASP-Shift GRASP-Day<br />
(c) Test 3<br />
Figure 5.1: Comparison of heuristic performances for the GAMS problem
Change language