Abstract

This paper identifies the sequential behavior of the linkage learning genetic algorithm, introduces the tightness time model for a single building block, and develops the connection between the sequential behavior and the tightness time model. By integrating the first-building-block model based on the sequential behavior, the tightness time model, and the connection between these two models, a convergence time model is constructed and empirically verified. The proposed convergence time model explains the exponentially growing time required by the linkage learning genetic algorithm when solving uniformly scaled problems.

This content is only available as a PDF.

Author notes

The work was done while the author was a graduate student in the Department of Computer Science at the University of Illinois at Urbana-Champaign and a member of Illinois Genetic Algorithms Laboratory.