The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 67
141 e. printStackTrace ();
142 }
143
144 getBestSchedule (). setRCL ( this . RCLsize );
145 getBestSchedule (). setConstructorID ( this . hashCode ());
146 getBestSchedule (). setDoS ( this . dos );
147
148 return null ;
149 }
150
151 public void printGRASPStatsToConsole () {
152 Pair < Integer , Pair < HashMap < Shift , HashSet >>, HashMap
< Shift , HashSet >>>> workingSol = working .
getSolutionValue ( false , null );
153 System . out . println (" -------------- GRASP STATS : --------------");
154 System . out . println (" Working value : " + workingSol . getE () + "||" +
workingSol . getV (). getE (). size ());
155 System . out . println (" -------------- --------------");
156 }
157 }
A.4 Simulated Annealing metaheuristic
1 package heuristic . meta ;
2
3 import basic . Rules ;
4 import changes . RotationInt ;
5 import ds. Doctor ;
6 import ds. Pair ;
7 import ds. Schedule ;
8 import ds. Shift ;
9 import heuristic . Metaheuristic ;
10 import java . beans . ExceptionListener ;
11 import java . util . HashMap ;
12 import java . util . HashSet ;
13 import org . jfree . data .xy. XYDataItem ;
14 import org . jfree . data .xy. XYSeries ;
15 import org . jfree . data .xy. XYSeriesCollection ;
16
17 public class Simulated_annealing extends Metaheuristic implements
18
ExceptionListener {
19 private double temp ;
20 private double alpha = 0.999;
21 private double temp_end ;
22 private boolean minimize ;
23 private XYDataItem tempPoint ;
24 private XYSeries tempSeries ;
25
26 public Simulated_annealing ( double timeToRun , int maxRotation , Rules myRules ,
RotationInt rotationInt , Schedule s, Type t, int rounds , boolean diagram ,
boolean minimize ) {