for tuning an optimizer's parameters by using another optimizer. 1980: Smith describes genetic programming. 1983: Kirkpatrick et al. propose simulated annealing. 1986: Glover proposes tabu search, first mention of the term metaheuristic. 1989: Moscato proposes memetic algorithms. 1990: Moscato and Fontanari, and Dueck and Scheuer, independently proposed a deterministic update rule for simulated annealing which accelerated the search. This led to the threshold accepting metaheuristic. 1992: Dorigo introduces ant colony optimization in his PhD thesis. 1995: Wolpert and Macready prove the no free lunch theorems. See also Stochastic search Meta-optimization Matheuristics Hyper-heuristics Swarm intelligence Genetic algorithms Genetic programming Simulated annealing Workforce modeling References Further reading Ashish Sharma (2022), Nature Inspired Algorithms with Randomized Hypercomputational Perspective. Information Sciences. https://doi.org/10.1016/j.ins.2022.05.020. External links EU/ME forum for researchers in the field.