Evolutionary Computation
Summer 1996, Vol. 4, No. 2, Pages 195-205
(doi: 10.1162/evco.1996.4.2.195)
How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time
Article PDF (565.41 KB)
Abstract
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.