Grammatical rules for the automated construction of heuristics

— Developing a problem-domain independent methodology to automatically generate high performing solving strategies for specific problems is one of the challenging trends on hyper-heuristics design. Designing hyper-heuristics is important because they raise the level of generality on automated problem solving by attempting to select and/or generate tailored heuristics for the problem at hand. In this paper, we present a three-steps methodology that combines multiple sequence alignment and grammatical induction in order to automatically generate high performing solving strategies for a combinatorial optimisation problem. We present proof-of-concept results of applying this methodology to instances of the well-known symmetric TSP. The goal here is to demonstrate feasibility rather than compete with state of the art TSP solvers. This TSP is chosen only because it is an easy to state and well known problem.

• Type: Conference
• Year: 2010
• Where: CEC
• Authors: Germán Terrazas, Natalio Krasnogor
• Keywords: Artificial Intelligence, CEC 2010, Combinatorial Optimisation Problem, Problem-domain Independent Methodology, Well-known Symmetric Tsp