Changes

Evolutionary algorithms are general purpose optimizers because they do not require any assumptions about the landscape of the fitness function. They are used in a wide range of problems in diverse fields and have proven to be a highly effective numerical analysis method.  

Evolutionary algorithms are general purpose optimizers because they do not require any assumptions about the landscape of the fitness function. They are used in a wide range of problems in diverse fields and have proven to be a highly effective numerical analysis method.  

However, in the last decade, research on evolutionary algorithms has fallen off sharply{{Citation needed|date=May 2010}}, and they have not lived up to their initial promise. Although they are a reasonable search technique in a wide variety of problems, they are not the best search technique in almost any field. Algorithms such as [[simulated annealing]], and fast [[integer programming]] solvers have largely superceded evolutionary algorithms in modern use. Evolutionary algorithms can be seen as an experimental test of Darwin's theory of evolution, and their eventual failure can be seen as a refutation of that theory{{Citation needed|date=May 2010}}.

However, in the last decade, research on evolutionary algorithms has fallen off sharply{{Citation needed|date=May 2010}}, and they have not lived up to their initial promise. Although they are a reasonable search technique in a wide variety of problems, they are not the best search technique in almost any field. Algorithms such as [[simulated annealing]], and fast [[integer programming]] solvers have largely superseded evolutionary algorithms in modern use. Evolutionary algorithms can be seen as an experimental test of Darwin's theory of evolution, and their eventual failure can be seen as a refutation of that theory{{Citation needed|date=May 2010}}.

==See also==

==See also==