Please use this identifier to cite or link to this item: http://hdl.handle.net/10553/47801
Title: Towards a stop criterion for simple genetic algorithm, SGA
Authors: Cuesta, Pedro D. 
Abderramán, Jesús C.
Jiménez, José A.
Galván, Blas J. 
Winter, Gabriel 
UNESCO Clasification: 1206 Análisis numérico
120601 Construcción de algoritmos
Keywords: Combinatorics
Expected waiting times
Maximum uncertainty
Simple genetic algorithm
Stochastic matrices
Stop criterion
Issue Date: 2000
Conference: European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000 
Abstract: It is presented an explicit calculation of expected waiting times, EWT, of the Simple Genetic Algorithm, SGA, taken advantage the peculiarity of the totally random situation, (maximum uncertainty) and the basic tools of combinatorics obtaining a theoretical calculation of EWT, for any size from n and l, including for the first time real cases. It is obtained an upper bound for the stop criterion average for the general case of random initial population, with multinomial distribution, and the case of equal probability for the initial states. Also it is studied the EWT for restrictive cases of multiploid populations (greater genetic diversity). The obtained results, in order of magnitude, are valid for any used value of 1-point crossover, א, and uniform mutation, μ,. The obtained results seem be very high, in real cases, as to be considered practical. The results show also that the Markov model of Nix and Vose needs to be conplemented to simulate correctly the optimum performance of the SGA.
URI: http://hdl.handle.net/10553/47801
ISBN: 84-89925-70-4
9788489925700
Source: European Congress on Computational Methods in Applied Sciences and Engineering, ECCOMAS 2000
Appears in Collections:Actas de congresos
Show full item record

SCOPUSTM   
Citations

1
checked on Feb 21, 2021

Page view(s)

26
checked on Feb 22, 2021

Google ScholarTM

Check

Altmetric


Share



Export metadata



Items in accedaCRIS are protected by copyright, with all rights reserved, unless otherwise indicated.