A Meta-Genetic Algorithm for Hybridizing Metaheuristics

The research presented in this paper forms part of the initiative aimed at automating the design of intelligent techniques to make them more accessible to non-experts. This study focuses on automating the hybridization of metaheuristics and parameter tuning of the individual metaheuristics. It is an initial attempt at testing the feasibility to automate this design process. A genetic algorithm is used for this purpose. Each hybrid metaheuristic is a combination of metaheuristics and corresponding parameter values. The genetic algorithm explores the space of these combinations. The genetic algorithm is evaluated by applying it to solve the symmetric travelling salesman problem. The evolved hybrid metaheuristics are found to perform competitively with the manually designed hybrid approaches from previous studies and outperform the metaheuristics applied individually. The study has also revealed the potential reusability of the evolved hybrids. Based on the success of this initial study, different problem domains shall be used to verify the automation approach to the design of hybrid metaheuristics.