Talk:Metaheuristic/List of Metaheuristics

Untitled
Due to the nature of research, there are constantly new metaheuristics. Below is a list of metaheuristics:


 * 1952: Robbins and Monro work on stochastic optimization methods.
 * 1952: Fermi and Metropolis develop an early form of pattern search as described belatedly by Davidon.
 * 1954: Barricelli carry out the first simulations of the evolution process and use them on general optimization problems.
 * 1963: Rastrigin proposes random search.
 * 1965: Matyas proposes random optimization.
 * 1965: Rechenberg proposes evolution strategy. |
 * 1965: Nelder and Mead propose a simplex heuristic, which was shown by Powell to converge to non-stationary points on some problems.
 * 1966: Fogel et al. propose evolutionary programming.
 * 1970: Hastings proposes the Metropolis-Hastings algorithm.
 * 1970: Cavicchio proposes adaptation of control parameters for an optimizer.
 * 1970: Kernighan and Lin propose a graph partitioning method, related to variable-depth search and prohibition-based (tabu) search.
 * 1975: Holland proposes the genetic algorithm.
 * 1977: Glover proposes Scatter Search.
 * 1978: Mercer and Sampson propose a metaplan 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.
 * 1986: Farmer et al. work on the artificial immune system.
 * 1986: Grefenstette proposes another early form of metaplan for tuning an optimizer's parameters by using another optimizer.
 * 1988: First conference on genetic algorithms is organized at the University of Illinois at Urbana-Champaign.
 * 1988: Koza registers his first patent on genetic programming.
 * 1989: Goldberg publishes a well known book on genetic algorithms.
 * 1989: Evolver, the first optimization software using the genetic algorithm.
 * 1989: Moscato proposes the memetic algorithm.
 * 1991: Interactive evolutionary computation.
 * 1992: Dorigo proposes the ant colony algorithm.
 * 1993: The journal, Evolutionary Computation, begins publication by the Massachusetts Institute of Technology.
 * 1993: Fonseca and Fleming propose MOGA for multiobjective optimization.
 * 1994: Battiti and Tecchiolli propose Reactive Search Optimization(RSO) principles for the  online self-tuning of heuristics.
 * 1994: Srinivas and Deb propose NSGA for multiobjective optimization.
 * 1995: Kennedy and Eberhart propose particle swarm optimization.
 * 1995: Wolpert and Macready prove the no free lunch theorems.
 * 1996: Mühlenbein and Paaß work on the estimation of distribution algorithm.
 * 1996: Hansen and Ostermeier propose CMA-ES.
 * 1997: Storn and Price propose differential evolution.
 * 1997: Rubinstein proposes the cross entropy method.
 * 1999: Taillard and Voss propose POPMUSIC.
 * 2001: Geem et al. propose harmony search.
 * 2001: Hanseth and Aanestad introduce the Bootstrap Algorithm.
 * 2002: Deb et al. propose NSGA-II for multiobjective optimization.
 * 2002 Han and Kim propose QEA for a class of combinatorial optimization.
 * 2004: Nakrani and Tovey propose bees optimization.
 * 2005: Krishnanand and Ghose propose Glowworm swarm optimization.
 * 2005: Karaboga proposes Artificial Bee Colony Algorithm (ABC).
 * 2005: Duc-Truong Pham et al. proposed Bees Algorithms (BA)
 * 2006: Haddad et al. introduces honey-bee mating optimization.
 * 2007: Hamed Shah-Hosseini introduces Intelligent Water Drops.
 * 2007: Atashpaz-Gargari introduces Imperialist competitive algorithm.
 * 2008: Wierstra et al. propose natural evolution strategies based on the natural gradient.
 * 2008: Yang introduces firefly algorithm.
 * 2008: Mucherino and Seref propose the Monkey Search
 * 2009: Ali Husseinzadeh Kashan introduced the League Championship Algorithm (LCA).
 * 2009: Kadioglu and Sellmann introduce Hegel and Fichte's dialectic as a local search meta-heuristic Dialectic Search.
 * 2009: Yang and Deb introduce cuckoo search.
 * 2009: Rashedi proposes Gravitational Search Algorithm
 * 2009: Josue Cuevas et al. propose Virus Optimization Algorithm
 * 2010: Yang develops bat algorithm.
 * 2011: Hamed Shah-Hosseini proposes the Galaxy-based Search Algorithm.
 * 2011: Tamura and Yasuda propose spiral optimization.
 * 2012: Civicioglu proposes Differential Search Algorithm. Matlab code-link has been provided in Çivicioglu, P.,(2012). and Matlab File Exchange.
 * 2013: Civicioglu proposes Artificial Cooperative Search Algorithm (ACS).
 * 2015: Election Algorithm: A new socio-politically inspired strategy — Preceding unsigned comment added by 2.187.47.244 (talk) 07:31, 23 June 2016 (UTC)
 * 2015: Tsai proposes Search Economics (SE).
 * 2016: Yazdani and Jolai propose Lion Optimization Algorithm — Preceding unsigned comment added by Yazdanimaziar (talk • contribs) 14:38, 27 April 2018 (UTC)
 * 2017: Kuo proposes Entanglement-QTS
 * 2017: Bouchekara developed the Most Valuable Player Algorithm (MVPA) .: — Preceding unsigned comment added by Bouchekara (talk • contribs) 05:47, 14 March 2018 (UTC) — Preceding unsigned comment added by 61.224.89.3 (talk) 08:13, 20 June 2020 (UTC)
 * 2018: Chou proposes Jaguar Algorithm (JA)

Also see

 * Metaheuristic
 * Matheuristics