Please use this identifier to cite or link to this item:
Title: Ant colony meta-heuristics - Schemes and software framework
Keywords: Optimization, ACO, Framework, Logistics, Combinatorial Optimization Problems, Hybrid Algorithms
Issue Date: 1-Jan-2004
Citation: LIM MIN KWANG (2004-01-01). Ant colony meta-heuristics - Schemes and software framework. ScholarBank@NUS Repository.
Abstract: Ant Colony Optimization is a strain of swarm intelligence algorithm, exploiting the foraging behavior of ants. Ants individually are sub-intelligent species, but share information using a chemical called pheromone that allows the colony to seek out optimal amount of food. ACO had efficiently been utilized to solve many NP-hard problems. The nature of the algorithm is such that it is extremely suited to solve assignment type problems, commonly a feature of combinatorial and assignment optimization problems. However, ACO by itself tend to be less powerful, due in part to redundant solution construction cycles. Hence, ACO integrates with another local search heuristics to achieve good results. This motivates a need for an ACO software framework, which forms the primary objective of this thesis. Aside from the software framework, the secondary objective of the thesis explores various factors of the ACO algorithm that are exploitable to achieve efficient results for complex problems.
Appears in Collections:Master's Theses (Open)

Show full item record
Files in This Item:
File Description SizeFormatAccess SettingsVersion 
ACO-FinalThesis.pdf333.24 kBAdobe PDF



Page view(s)

checked on Jan 13, 2019


checked on Jan 13, 2019

Google ScholarTM


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.