Hybrid metaheuristic and hyperheuristic algorithms

The main focus of this chapter is on the so-called hybrid metaheuristic algorithms. A number of combinations of two or more (meta)heuristic algorithms are discussed here. Since the hyperheuristic algorithm is a promising version of hybrid metaheuristic algorithms, we dedicate a section to its basic idea and the main difference between hyperheuristic and typical hybrid metaheuristic algorithms. The source code of a hybrid genetic algorithm (HGA) that combines the genetic algorithm (GA) and simulated annealing (SA) for solving the traveling salesman problem is then given to show how to realize a hybrid metaheuristic algorithm. HGA and GA are compared to show the possibilities and potential of hybrid metaheuristic algorithms.