Revisiting the restricted growth function genetic algorithm for grouping problems

Lewis, Rhyd ORCID: https://orcid.org/0000-0003-1046-811X and Pullin, Emma J. 2011. Revisiting the restricted growth function genetic algorithm for grouping problems. Evolutionary Computation 19 (4) , pp. 693-704. 10.1162/EVCO_a_00040

Preview

Text - Accepted Post-Print Version Download (327kB) | Preview

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.

Item Type:	Article
Date Type:	Publication
Status:	Published
Schools:	Mathematics
Subjects:	Q Science > QA Mathematics
Publisher:	Massachusetts Institute of Technology Press
ISSN:	1063-6560
Date of First Compliant Deposit:	30 March 2016
Last Modified:	06 May 2023 13:21
URI:	https://orca.cardiff.ac.uk/id/eprint/11331

Citation Data

Cited 8 times in Scopus. View in Scopus. Powered By Scopus® Data

Actions (repository staff only)

Edit Item