Genetic/Evolutionary algorithms and local minima/maxima problem
Posted
by el.gringogrande
on Stack Overflow
See other posts from Stack Overflow
or by el.gringogrande
Published on 2010-01-19T15:19:01Z
Indexed on
2010/05/17
3:30 UTC
Read the original article
Hit count: 296
evolutionary-algorithm
|maxima
I have run across several posts and articles that suggests using things like simulated annealing to avoid the local minima/maxima problem.
I don't understand why this would be necessary if you started out with a sufficiently large random population.
Is it just another check to insure that the initial population was, in fact, sufficiently large and random? Or are those techniques just an alternative to producing a "good" initial population?
© Stack Overflow or respective owner