Publication Details
Title: Implicit Parallelism in Genetic Algorithms
Author: A. Bertoni and M. Dorigo
Group: ICSI Technical Reports
Date: January 1993
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1993/tr-93-001.pdf
Overview:
This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of (n^3)/(c1*√l) to the number of schemata usefully processed by the genetic algorithm in a population of n=c1*2^l binary strings, with c1 a small integer. We analyze the case of population of n = 2^βl binary strings where β is a positive parameter (Holland's result is related to the case β=1). In the main result, for all β>0 we state a lower bound on the expected number of processed schemata; moreover, we prove that this bound is tight up to a constant for all β>=1 and, in this case, we strengthen in probability the previous result. Keywords: genetic algorithms, implicit parallelism
Bibliographic Information:
ICSI Technical Report TR-93-001
Bibliographic Reference:
A. Bertoni and M. Dorigo. Implicit Parallelism in Genetic Algorithms. ICSI Technical Report TR-93-001, January 1993
Author: A. Bertoni and M. Dorigo
Group: ICSI Technical Reports
Date: January 1993
PDF: ftp://ftp.icsi.berkeley.edu/pub/techreports/1993/tr-93-001.pdf
Overview:
This paper is related to Holland's result on implicit parallelism. Roughly speaking, Holland showed a lower bound of the order of (n^3)/(c1*√l) to the number of schemata usefully processed by the genetic algorithm in a population of n=c1*2^l binary strings, with c1 a small integer. We analyze the case of population of n = 2^βl binary strings where β is a positive parameter (Holland's result is related to the case β=1). In the main result, for all β>0 we state a lower bound on the expected number of processed schemata; moreover, we prove that this bound is tight up to a constant for all β>=1 and, in this case, we strengthen in probability the previous result. Keywords: genetic algorithms, implicit parallelism
Bibliographic Information:
ICSI Technical Report TR-93-001
Bibliographic Reference:
A. Bertoni and M. Dorigo. Implicit Parallelism in Genetic Algorithms. ICSI Technical Report TR-93-001, January 1993