The University of Queensland, School of Information Technol and Elec Engineering
Abstract
Ant Colony Optimisation is a recent algorithm used for solving optimisation problems. The algorithm is modelled on the behaviour of real ant colonies, and has traditionally been used exclusively for solving problems in the discrete domain. This thesis fully implements and evaluates a specialized version of Any Colony Optimisation capable of searching continuous spaces, and evaluates its performance under a range of conditions and test cases
