Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Metaheuristic
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Contributions == <!-- PLEASE ONLY ADD THE MOST SIGNIFICANT CONTRIBUTIONS! Entries that are too recent will be removed. Entries that do no have an article will be removed. Articles that do not establish the significance of a particular algorithm (as measured by substantial coverage in secondary and tertiary sources) will be deleted. --> Many different metaheuristics are in existence and new variants are continually being proposed. Some of the most significant contributions to the field are: * 1952: Robbins and Monro work on stochastic optimization methods.<ref name=robbins52stochastic/> * 1954: [[Nils Aall Barricelli|Barricelli]] carries out the first simulations of the [[evolution]] process and uses them on general optimization problems.<ref name=barricelli54esempi/> * 1963: Rastrigin proposes [[random search]].<ref name=rastrigin63convergence/> * 1965: Matyas proposes [[random optimization]].<ref name=matyas65random/> * 1965: [[John Nelder|Nelder]] and Mead propose a [[Nelder–Mead method|simplex heuristic]], which was shown by [[Michael J. D. Powell|Powell]] to converge to non-stationary points on some problems.<ref name=nelder65simplex/> * 1965: [[Ingo Rechenberg]] discovers the first [[Evolution Strategies]] algorithm.<ref name=rechenberg65ES/> * 1966: [[Lawrence J. Fogel|Fogel]] et al. propose [[evolutionary programming]].<ref name=fogel66artificial/> * 1970: Hastings proposes the [[Metropolis–Hastings algorithm]].<ref name=hastings70monte/> * 1970: Cavicchio proposes adaptation of control parameters for an optimizer.<ref name=cavicchio70adaptive/> * 1970: Kernighan and Lin propose a graph partitioning method, related to variable-depth search and [[tabu search|prohibition-based (tabu) search]].<ref name=kernighan1970efficient/> * 1975: [[John Henry Holland|Holland]] proposes the [[genetic algorithm]].<ref name=holland75adaptation/> * 1977: [[Fred W. Glover|Glover]] proposes scatter search.<ref name=glover77scattersearch/> * 1978: Mercer and Sampson propose a [[meta-optimization|metaplan]] for tuning an optimizer's parameters by using another optimizer.<ref name=mercer78adaptive/> * 1980: Smith describes [[genetic programming]].<ref name=smith80learning/> * 1983: Kirkpatrick et al. propose [[simulated annealing]].<ref name=kirkpatrick83optimization/> * 1986: [[Fred W. Glover|Glover]] proposes [[tabu search]], first mention of the term ''metaheuristic''.<ref name=glover86future/> * 1989: Moscato proposes [[memetic algorithms]].<ref name=moscato89evolution/> * 1990: Moscato and Fontanari,<ref>{{citation |journal=Physics Letters A |pages= 204–208 |last1=Moscato |first1=P. |last2=Fontanari |first2=J.F.| title=Stochastic versus deterministic update in simulated annealing |volume=146 |issue=4 |year=1990|doi=10.1016/0375-9601(90)90166-L|bibcode= 1990PhLA..146..204M }}</ref> and Dueck and Scheuer,<ref>{{citation |journal=Journal of Computational Physics| pages=161–175 | last1=Dueck |first1=G.| last2=Scheuer| first2=T.| title=Threshold accepting: A general purpose optimization algorithm appearing superior to simulated annealing| volume=90 | issue=1 | year=1990 | issn=0021-9991 | doi=10.1016/0021-9991(90)90201-B| bibcode=1990JCoPh..90..161D }}</ref> independently proposed a deterministic update rule for [[simulated annealing]] which accelerated the search. This led to the [[threshold accepting]] metaheuristic. * 1992: [[Marco Dorigo|Dorigo]] introduces [[ant colony optimization]] in his PhD thesis.<ref name="M. Dorigo, Optimization, Learning and Natural Algorithms"/> * 1995: Wolpert and Macready prove the [[No free lunch in search and optimization|no free lunch]] theorems.<ref name=wolpert95nofreelunch/><ref name="Igel2003" /><ref name=Auger2010/><ref name=Droste2002/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)