The Doctor Rostering Problem - Asser Fahrenholz

Recommendations

Info

Chapter 6. The DRP Program 41 schedules be taken into account in future versions of the program, the total time required to produce schedules would drop even more. Not unlike this program, PLANE (Burke et al. [3]) seeks to please the nurses on a personal level and treats all nurses equally. PLANE is commended by the users for having high personal preference satisfaction and a low degree of constraint violation. 6.4 From prototype to release candidate For this product to be commercialised, several things are needed: Past schedules should be considere. The assignment of unpopular shifts, such as on new years eve, new years day, christmas day etc., should be divided equally over several schedules. The data structure needs to be optimised for faster computations. The implementation as it is now, does not fully exploit the object reference advantages. More dynamic coding is needed. The constraints need to be implemented into some easily editable form. The doctor-objects could also be coded in a more dynamic sense, letting the user specify fields for the doctors, and afterwards filling them in. But for the product to be sold, the buyer must be gaining a savings, i.e. if the doctor planning the roster is paid to do so, then it could save the medical practice money. If, on the other hand, the doctor is planning the roster for free, then no savings come from buying the DRP Program.
Chapter 7 Metaheuristic tests This chapter will show the performance of the metaheuristics, described in chapter 4, on a set of problems including one real world problem. Two libraries used during testing (to output diagrams of the heuristic performances and .xls-files containing the primitive test data) was the JFreeChart 1 and the Apache POI 2 respectively. I will begin by explaining the setup of the test, wherein the various key parameters in the test shall be introduced. After the setup has been explained, the effect of the test instance variations and the effect of varying configurations of metaheuristics will be covered respectively. I end this chapter by discussing the pros and cons of GRASP and SA for the DRP, making a few conclusions based on the observations done in this chapter. Appendix C on page 87 contains all summarised test results. All primitive data is included on the enclosed dvd 3 . 7.1 Test setup The purpose of the tests is to document the performance of GRASP and Simulated Annealing on real world test instances, and if possible to support the decision of values for the parameters. It was only possible to procure one real world problem, so other instances had to be constructed. All constructed test instances have been constructed to measure the effect of varying problem parameters on the solution. The test instances can be found in appendix C. 1 http://www.jfree.org/jfreechart/ 2 http://poi.apache.org/ 3 In the ”DRP/diagrams/Test” folder 42
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 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: Chapter 6. The DRP Program 40 Figur
Page 55 and 56: 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
Page 95 and 96: Appendix B. GAMS Model 84 B.3 The s
Page 97 and 98: Appendix B. GAMS Model 86 B.3.3 The
Page 99 and 100: Appendix C. Tests 88 C.1.1 Instance
Page 101 and 102: Appendix C. Tests 90 C.1.2 Instance
Page 103 and 104:
Appendix C. Tests 92 C.1.4 Instance
Page 105 and 106:
Appendix C. Tests 94 JST PZH HP SDA
Page 107 and 108:
Appendix C. Tests 96 JST PZH HP SDA
Page 109 and 110:
Appendix C. Tests 98 C.1.8 Instance
Page 111 and 112:
Appendix C. Tests 100 Cons 12 Imps
Page 113 and 114:
Appendix C. Tests 102 Test 3 RCL 1
Page 115 and 116:
Page 117 and 118:
Page 119 and 120:
Page 121 and 122:
Page 123 and 124:
Page 125 and 126:
Page 127 and 128:
Appendix C. Tests 116 160 140 120 1
Page 129 and 130:
Bibliography 118 [10] Michael R. Ga
show all

The Doctor Rostering Problem - Asser Fahrenholz

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?