Genetic/Evolutionary algorithms and local minima/maxima problem

Question

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?

Answer 1

Simulated annealing is a probabilistic optimization technique -- it's not supposed to give you more precise answers, it's supposed to give you approximations faster.

Answer 2

First of all, simulated annealing is a last resort method. There are far better, more efficient, and more effective methods of discovering where the local minima are found.

A better check would be to use a statistical method to uncover information about your data set such as variance or standard deviation.

Answer 3

Hi, I see that you are interested about Algorithms, so I will propose you one amazing book "Advances in Evolutionary Algorithms". This is the link where you can find it and download for free: http://www.intechopen.com/books/show/title/advances_in_evolutionary_algorithms
Aim of the book is to present recent improvements, innovative ideas and concepts in a part of a huge EA field.