Heuristics for ant colony optimisation using the generalised assignment problem

The use of embedded heuristics within meta-heuristic search algorithms has a large effect on their performance. One of the more recent classes of meta-heuristics, ant colony optimisation, is examined in terms of both the heuristic used to select solution components and the local search heuristics used to improve solutions. Static and adaptive heuristic control strategies are developed, as well as neighbourhood oriented local search transition operators, that are able to obtain good solutions to large and tightly constrained generalised assignment problem instances.