Code for Kaggle's annual optimisation competition. Code for last year can be found here.
- Multi-threaded search using a mix of brute-force and Simulated Annealing.
- Fast computation of objective function using deltas for assignment and accounting penalties.
- Random and brute-force search over cartesian product of candidate assignments.
- Simulated Annealing with probalistic candidate selection favouring least damaging moves.
- 69101.38 (114/1,620) (< 0.31% of optimal lower bound)
- 69042.01 (104) - post competition deadline