Skip to main content

A Design Framework for Metaheuristics: Problem Types and Avoiding Bottlenecking

Johnson, Colin G. (2006) A Design Framework for Metaheuristics: Problem Types and Avoiding Bottlenecking. In: Sirlantzis, Konstantinos, ed. Proceedings of the 6th International Conference on Recent Advances in Soft Computing. . University of Kent (KAR id:14451)

Language: English
Download (135kB) Preview
[thumbnail of Design_Principles_for_Metaheuristics.pdf]
This file may not be suitable for users of assistive technology.
Request an accessible format


This paper is concerned with an aspect of the design of metaheuristic algorithms, such as evolutionary algorithms, tabu search and ant colony optimization. The topic that is considered is how problems can be represented when they are given to a metaheuristic algorithm. A particular difficulty is presented, viz. the ''bottleneck'', where the problem is artificially converted into a new representation in order to fit the standard input to the metaheuristic. Such bottlenecks cause problems in interpreting or trusting the solution given by the metaheuristic. In order to alleviate this problem, we suggest ways in which three types of problem (data-driven, specification-driven and interactive) can be presented to metaheuristics in a bottleneck-free way, and how problems which use multiple solution-types can be tackled.

Item Type: Conference or workshop item (Paper)
Uncontrolled keywords: metaheuristics, software design, specification, interactivity, bottlenecks, problem solving
Subjects: Q Science > QA Mathematics (inc Computing science) > QA 76 Software, computer programming,
Divisions: Divisions > Division of Computing, Engineering and Mathematical Sciences > School of Computing
Depositing User: Mark Wheadon
Date Deposited: 24 Nov 2008 18:04 UTC
Last Modified: 16 Nov 2021 09:52 UTC
Resource URI: (The current URI for this page, for reference purposes)
Johnson, Colin G.:
  • Depositors only (login required):