The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 68
27 super ( timeToRun , maxRotation , myRules , rotationInt , s, t, rounds );
28 this . minimize = minimize ;
29 this . temp = 1000;
30 this . temp_end = 0.001;
31 }
32
33 @Override
34 public Void doInBackground () {
35 XYDataItem point ;
36 XYDataItem point2 ;
37 XYDataItem point3 ;
38 XYDataItem point4 ;
39 try {
40 seriesCol = new XYSeriesCollection ();
41 series = new XYSeries (" Best vio ");
42 series2 = new XYSeries (" Best score ");
43 series3 = new XYSeries (" Working vio ");
44 series4 = new XYSeries (" Working score ");
45 tempSeries = new XYSeries (" Temperature ");
46 seriesCol . addSeries ( series );
47 seriesCol . addSeries ( series2 );
48 seriesCol . addSeries ( series3 );
49 seriesCol . addSeries ( series4 );
50 startTime = System . currentTimeMillis ();
51 int newLocalScore = 0;
52 int oldScore ;
53 boolean test = ( super . type . compareTo ( Type . Rounds ) == 0) ? (
54
loopCounter < maxRounds ) : ( System . currentTimeMillis () - startTime ) <
getTimeToRun ();
55 int progress = ( super . type . compareTo ( Type . Rounds ) == 0) ? (100 *
loopCounter / maxRounds ) : ( int ) (100 * ( System . currentTimeMillis () -
startTime ) / getTimeToRun ());
56 setProgress ( progress );
57 while ( test && temp > temp_end ) {
58 oldScore = newLocalScore ;
59 c = Math . random () * 1 > 0.5 ? n_rot . nextChange ( working ) : n_inv .
nextChange ( working );
60 working . performChange (c, false );
61 Pair < Integer , Pair < HashMap < Shift , HashSet >>,
HashMap < Shift , HashSet >>>> workingSol = working .
getSolutionValue ( false , getRules ());
62 newLocalScore = workingSol . getE ();
63 newLocalVio = workingSol . getV (). getE (). size ();
64 double solutionValue_increase = newLocalScore - oldScore ;
65 double rand = Math . random ();
66
67 if ( newLocalVio < bestVio ) {
68 setBestSchedule ( working );
69 localImprovements ++;
70 acceptedSolutions ++;
71 } else if ( newLocalVio == bestVio ) {
72 if (( solutionValue_increase > 0 && ! minimize ) || (
solutionValue_increase < 0 && minimize )) {