Abstract

An overview of the restricted growth function genetic algorithm is given. Empirically we show that the algorithm exhibits poor performance and is consistently outperformed on a range of problems by two very basic evolutionary algorithms with blind operators.

This content is only available as a PDF.