The goal of this paper is to demonstrate the rate at which building blocks evolve in time during run of GA. We compare the building block propagation rate for the simple genetic algorithm (SGA) with the building block propagation rate for the migration (island) genetic algorithm (MPGA). The results are checked against the lower bound given by Holland's schema theorem. Using genetic programming, we made symbolic regression on the number of individuals matching given schema versus generation number. As a result, a new expression describing the propagation rate was found, and its correctness was confirmed in all cases considered in the paper.
CITATION STYLE
Kusztelak, G., Rudnicki, M., & Wiak, S. (2004). Propagation of building blocks in SGA and MPGA. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3070, pp. 438–443). Springer Verlag. https://doi.org/10.1007/978-3-540-24844-6_64
Mendeley helps you to discover research relevant for your work.