The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 75
74 if ( bestChange . indexOf ( changeScore ) == bestChange . size ()
- 1) {
75 bestChange . add ( new Pair < Change , Pair < Double , Integer
> >(c, new Pair < Double , Integer >( scoreInc , vioInc )));
76 break myFor ;
77 }
78 }
79 }
80 }
81 }
82
83 switch ( RCLsize ) {
84 case Best :
85 bestChange . setSize (1) ;
86 break ;
87 case Fifty :
88 bestChange . setSize (( int ) ( bestChange . size () * 0.5) );
89 break ;
90 case TwentyFive :
91 bestChange . setSize (( int ) ( bestChange . size () * 0.25) );
92 break ;
93 case SeventyFive :
94 bestChange . setSize (( int ) ( bestChange . size () * 0.75) );
95 break ;
96 default :
97 break ;
98 }
99 double randDoc = Math . random () * bestChange . size ();
100 Change out = bestChange . get (( int ) randDoc ). getE ();
101
102 return out ;
103 }
Listing A.2: Day assignments