A General Framework for Constructive Meta-Heuristics
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.
KeywordsConstructive meta-heuristics Ant colony optimisation Greedy randomised search procedures
Unable to display preview. Download preview PDF.
- Brooke, A., Kendrick, D., Meeraus, A. and Raman, R. GAMS Language Guide, GAMS Development Corporation, 1997.Google Scholar
- Fourer, R., Gay, D. and Kernighan, B. AMPL: A Modeling Language for Mathematical Programming. California: Duxbury Press, 1993.Google Scholar
- Lawler, E., Lenstra, J., Rinnoy Kan, A. and Shmoys, D. The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Chichester: Wiley, 1985.Google Scholar
- Mavridou, T., Pardalos, P., Pitsoulis, L. and Resende, M. (1995) “Parallel Search for Combinatorial Optimization: Genetic Algorithms, Simulated Annealing, Tabu Search and GRASP”, Lecture Notes In Computer Science, 980, Ferreira, A. and Rolim, J. ed. Berlin: Springer-Verlag, 1995.Google Scholar
- Michalewicz, Z. and Fogel, D. How to Solve it: Modern Heuristic, Berlin: Springer Verlag, 2000.Google Scholar
- Ramalhinho, H. and Serra, D. Adaptive Approach Heuristics for the Generalized Assignment Problem, Working Paper Series, No. 288, UPF, 1998.Google Scholar
- Randall, M. “A General Modelling Systems and Meta-heuristic based Solver for Combinatorial Optimisation Problems”, PhD thesis, Faculty of Environmental Science, Griffith University, 1999.Google Scholar
- Randall, M. “The Use of Feasibility Restoration in Iterative Meta-heuristics for Solving Combinatorial Optimisation Problems”. Working Paper, 2001.Google Scholar
- Randall, M. and Abramson, D. (2001) A General Meta-heuristic Based Solver for Combinatorial Optimisation Problems. Journal of Computational Optimisation and Applications 2001; 20 (to appear).Google Scholar
- Randall, M. and Montgomery, J. “Candidate Set Strategies for Ant Colony Optimisation”. Working paper, 2001.Google Scholar
- Randall, M., McMahon, G. and Sugden, S. A Simulated Annealing Approach to Communication Network Design. Journal of Combinatorial Optimization (2001 to appear).Google Scholar