It is shown by means of Markov chain analysis that unimodal binary long-path problems can be solved by mutation and elitist selection in a polynomially bounded number of trials on average.

Evolutionary algorithm, elitist selection, unimodal binary function, long-path problem, Markov chain analysis, absorption time
This content is only available as a PDF.
© 1996 by the Massachusetts Institute of Technology
1996
You do not currently have access to this content.