How Mutation and Selection Solve Long-Path Problems in Polynomial Expected Time

1 June 1996

journal article
Published by MIT Press in Evolutionary Computation

Vol. 4 (2) , 195-205
https://doi.org/10.1162/evco.1996.4.2.195

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.

Keywords

MARKOV CHAIN
PATH
SOLVED
BOUNDED NUMBER
CHAIN ANALYSIS
POLYNOMIALLY BOUNDED
ELITIST SELECTION
SOLVE LONG
UNIMODAL BINARY

This publication has 0 references indexed in Scilit: