title: Revisiting the restricted growth function genetic algorithm for grouping problems.
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.
authors.affiliation: School of Mathematics, Prifysgol Caerdydd/Cardiff University, Cardiff, CF24 4AG, Wales. lewisR9@cf.ac.uk
authors.forename: R
authors.initials: R
authors.lastname: Lewis
authors.forename: E
authors.initials: E
authors.lastname: Pullin
mesh_terms: D000465:Algorithms; D008957:Models, Genetic