FIT4012 Advanced Topics in Computational Science, Part 1

Lectures: Tuesday, 10am-12pm, G16, Building 26, Weeks 1-6
Lecturer: Aldeida Aleti
Office: 133a, building 63, Clayton
Consultations: please send me an email to arrange an appointment

Course Description

This is an advanced algorithms course. It covers material from optimisation algorithms and combinatorial problem solving. It introduces stochastic local search (SLS) algorithms, such as stochastic hill-climbing, simulated annealing, tabu search, evolutionary algorithms, and ant colony optimization. SLS algorithms are among the most prominent and successful techniques for solving computationally hard problems. For demonstrating the applicability of these algorithms, we will use different combinatorial problems, such as the satisfiability problem in propositional logic and the travelling salesman problem. Students will have the opportunity to learn established and cutting edge practices and methodologies in this important research area. The course is composed of weekly lectures, formal and informal discussions, and two assignments.

Lecture Notes

Faculty Policy - Unit Assessment Hurdles

Task 1 (40%)

Task 2 (20%)

Reading List
Cool and Helpful Links