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.

Grouping, genetic algorithms, restricted growth functions, bin packing, equal piles, graph colouring
This content is only available as a PDF.
© 2011 by the Massachusetts Institute of Technology
2011
You do not currently have access to this content.