Hyperheuristics Based on Parametrized Metaheuristic Schemes
José-Matías Cutillas-Lozano, Domingo Giménez, Francisco Almeida · 2015
The use of a unified parametrized scheme for metaheuristics facilitates the development of metaheuristics and their application. The unified scheme can also be used to implement hyperheuristics on top of parametrized metaheuristics, selecting appropriate values for the metaheuristic parameters, and consequently the metaheuristic itself. The applicability of hyperheuristics to efficiently solve computational search problems is tested with the application of local and global search methods (GRASP, Tabu Search, Genetic algorithms and Scatter Search) and their combinations to three problems: a problem of optimization of power consumption in operation of wells,the determination of the kinetic constants of a chemical reaction and the maximum diversity problem. The hyperheuristic approach provides satisfactory values for the metaheuristic parameters and consequently satisfactory metaheuristics.