A general framework for constructive meta-heuristics
Date of this Version
Meta-heuristic search algorithms, by their very nature, are applicable across a range of optimisation problems. In practice however, meta-heuristics have been tailored to solve particular problems. Recent work by Randall and Abramson (2001b)has successfully shown that iterative meta-heuristics, such as simulated annealing and tabu search, can be successfully generalised to solve a range of problems without modification though the use of a uniform representation language. Constructive meta-heuristics, such as ant colony optimisation and generalised random adaptive search procedures, pose more substantial problems to achieve this same level of generalistaion. This paper investigates the issues involved and suggests some measures by which generalisation could be achieved.
This document is currently not available here.
This document has been peer reviewed.