Here are the results for the comparison of the knapsack algorithms. This has no bearing on your grade, this is just for fun. The comparison is the average result of each of your algorithms run on 10 test cases.

A score of 0.0 means one of three things: 1. An infeasible solution was returned for any of the test cases, 2. The algorithm was not implemented/failed to run, or 3. Your code took all the memory and swap on the test machine before finding an answer (the test machine has 16 gigs of RAM by the way).

You get points equal to your ranking in each of the algorithms, lowest score wins. The final results are in the last list and the average value returned by each algorithm is given in the first four.

The column format is:

The ID corresponding to your results was emailed to your cs account.

Steepest ascent

1. 007 361.4
2. 009 360.0
3. 006 287.2
4. 013 224.7
5. 004 213.1
6. 003 207.5
7. 012 199.1
8. 011 182.0
9. 008 181.5
10. 005 119.1
11. 010 140.0
12. 002 24.4
13. 014 0
14. 015 0
15. 016 0

Steepest ascent w/ restarts

1. 007 358.7
2. 005 352.9
3. 006 307.2
4. 013 298.8
5. 004 250.5
6. 011 238.3
7. 008 214.3
8. 012 199.1
9. 010 192.5
10. 009 186.3
11. 003 182.3
12. 002 139.9
13. 014 0
14. 015 0
15. 016 0

GA

1. 013 362.2
2. 005 359.2
3. 006 336.0
4. 010 253.4
5. 004 235.9
6. 003 226.6
7. 012 217.1
8. 008 212.6
9. 002 145.0
10. 009 89.4
11. 007 36.0
12. 011 0.0
13. 014 0.0
14. 015 0.0
15. 016 0.0

GA w/ constraint violation

1. 013 360.8
2. 005 358.4
3. 006 333.0
4. 010 252.4
5. 003 237.6
6. 004 226.1
7. 008 210.2
8. 002 128.5
9. 009 119.9
10. 007 26.2
11. 011 0.0
12. 012 0.0
13. 014 0.0
14. 015 0.0
15. 016 0.0

Finals

1. 013 10
2. 006 12
3. 005 16
4. 004 21
5. 007 24
6. 003 28 (tie)
7. 010 28 (tie)
8. 008 31
9. 009 32
10. 012 33
11. 011 37
12. 002 42
13. 014 49
14. 015 49
15. 016 49