The Doctor Rostering Problem - Asser Fahrenholz

Appendix A. Implementation 73
33 }
34 return res ;
35 }
36 return null ;
37 }
38
39 public ArrayList < ArrayList < Doctor >> choose2 ( ArrayList < Doctor > b, int k) {
40 res = new ArrayList < ArrayList < Doctor > >();
41
42 return enumerate2 (b, b. size () , k);
43 }
44
45 private void swap2 ( ArrayList < Doctor > b, int i, int j) {
46 Doctor temp = b. get (i);
47 b. set (i, b. get (j));
48 b. set (j, temp );
49 }
50
51 public ArrayList < ArrayList < Doctor >> getRes () {
52 return res ;
53 }
54 }
A.5.3 Day assignments
1 /* *
2 * Returns the best doctor for a given shift on a given day .
3 *
4 * @param dayInt
5 * the day
6 * @param RCLsize
7 * the size the RCL
8 * @param minimizing
9 * @return The best doctor for the shift
10 */
11 public Change getBestChange (
12 int dayInt , RCLParameter RCLsize , boolean minimizing , Rules rules ) {
13
14 if ( rules != null ) {
15 this . myRules = rules ;
16 }
17
18 Vector >> bestChange = new Vector > >();
20 Permutation t = new Permutation ();
21
22 ArrayList < Doctor > doc = new ArrayList < Doctor >() ;
23 doc . addAll ( docs );
24
25 t. choose2 (doc , this . get ( dayInt ). getAllMiddayShifts (). size ());
26
27 ArrayList < ArrayList < Doctor >> set = t. getRes ();