A metaheuristic is a higher-level algorithm that controls the solution search of one or more subordinate algorithms.
It is based on a collection of (meta-)strategies that are independent of the underlying optimisation problem and of the subordinate algorithms being controlled.
Well-known metaheuristics include simulated annealing, tabu search, ant colony algorithms, GRASP, variable neighbourhood search, and evolutionary and genetic algorithms.