Evaluating the Seeding Genetic Algorithm

In this paper, we present new experimental results supporting the Seeding Genetic Algorithm (SGA). We evaluate the algorithm's performance with various parameterisations, making comparisons to the Canonical Genetic Algorithm (CGA), and use these as guidelines as we establish reasonable parameters for the seeding algorithm. We present experimental results confirming aspects of the theoretical basis, such as the exclusion of the deleterious mutation operator from the new algorithm, and report results on GA-difficult problems which demonstrate the SGA's ability to overcome local optima and systematic deception.