Ant Colony Optimization for Continuous Spaces

Kuhn, Lachlan D. (2002). Ant Colony Optimization for Continuous Spaces Other, School of Information Technol and Elec Engineering, The University of Queensland.

Attached Files (Some files may be inaccessible until you login with your UQ eSpace credentials)
Name Description MIMEType Size Downloads
Read with bookreader  thesis.pdf Final Thesis Document Click to show the corresponding preview/stream application/pdf 6.00MB 1581
Author Kuhn, Lachlan D.
Thesis Title Ant Colony Optimization for Continuous Spaces
School, Centre or Institute School of Information Technol and Elec Engineering
Institution The University of Queensland
Publication date 2002-10
Thesis type Other
Supervisor Marcus Gallagher
Total pages 52
Total colour pages 25
Total black and white pages 27
Language eng
Abstract/Summary 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.
Keyword optimisation
ants
swarm me

Document type: Thesis
Collection: UQ Theses (non-RHD) - Open Access
 
Versions
Version Filter Type
Citation counts: Google Scholar Search Google Scholar
Access Statistics: 216 Abstract Views, 1647 File Downloads  -  Detailed Statistics
Created: Wed, 17 Nov 2010, 12:04:25 EST by Lachlan Kuhn on behalf of Library Technology Service