BDBComp
Parceria:
SBC
On Stopping Criteria for Genetic Algorithms

Martín SafeJessica Andrea CarballidoIgnacio PonzoniNélida Beatriz Brignole

In this work we present a critical analysis of various aspects associated with the specification of termination conditions for simple genetic algorithms. The study, which is based on the use of Markov chains, identifies the main difficulties that arise when one wishes to set meaningful upper bounds for the number of iterations required to guarantee the convergence of such algorithms with a given confidence level. The latest trends in the design of stopping rules for evolutionary algorithms in general are also put forward and some proposals to overcome existing limitations in this respect are suggested.

http://springerlink.metapress.com/content/cgt7635e3lhu3pdn/?p=a7e6524c664448e48a1d2e5c77c28c11&p

Caso o link acima esteja inválido, faça uma busca pelo texto completo na Web: Buscar na Web

Biblioteca Digital Brasileira de Computação - Contato: bdbcomp@lbd.dcc.ufmg.br
     Mantida por:
LBD