The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 60
27 // Random up to N and only N - size
28 Day randDay ;
29 Shift randShift ;
30 int randomSize ;
31 if ( getRotationInt (). compareTo ( RotationInt . RandomUpToN ) == 0) {
32 randomSize = ( int ) ( Math . random () * getN ());
33 } else {
34 randomSize = getN ();
35 }
36 while ( list . size () < randomSize ) {
37 randDay = s. get (( int ) Math . floor ( Math . random () * s. size ()));
38 randShift = randDay . getShift (( int ) Math . floor ( Math . random () * randDay
. size ()));
39 if ( randShift . isMiddayShift () && ! randDay . isWeekend () && ! randDay .
isHoliday ()) {
40 list . add ( randShift );
41 }
42 }
43
44 // invert doctors ( meaning , that particular doctor will not have that
45 // shift afterwards )
46 Object [] al = list . toArray ();
47
48 for ( int i = 0; i < al. length ; i ++) {
49 Shift shi = ( Shift ) al[i];
50 // pick any other doctor for the shift :
51 Doctor d = s. getRandomDoc ();
52 while (d. equals ( shi . getDoctor ())) {
53 d = s. getRandomDoc ();
54 }
55 c. put (shi , d);
56 }
57 return c;
58 }
59 }
A.1.2 Rotation neighborhood
1 package changes ;
2
3 import java . util . LinkedHashSet ;
4
5 import ds.Day ;
6 import ds. Doctor ;
7 import ds. Schedule ;
8 import ds. Shift ;
9
10 public class N_rotation extends Change {
11
12 private static final long serialVersionUID = -2600577434569838673 L;
13
14 public N_rotation ( int maxRotation , RotationInt rotationInt ) {
15 setChangeType ( ChangeType . nRotation );