Genetic Algorithms Using Grammatical Evolution
|Title:||Genetic Algorithms Using Grammatical Evolution||Authors:||Ryan, Conor
|Permanent link:||http://hdl.handle.net/10197/8189||Date:||5-Apr-2002||Abstract:||This paper describes the GAUGE system, Genetic Algorithms Using Grammatical Evolution. GAUGE is a position independent Genetic Algorithm that uses Grammatical Evolution with an attribute grammar to dictate what position a gene codes for. GAUGE suffers from neither under-specification nor over-specification, is guaranteed to produce syntactically correct individuals, and does not require any repair after the application of genetic operators. GAUGE is applied to the standard onemax problem, with results showing that its genotype to phenotype mapping and position independence nature do not affect its performance as a normal genetic algorithm. A new problem is also presented, a deceptive version of the Mastermind game, and we show that GAUGE possesses the position independence characteristics it claims, and outperforms several genetic algorithms, including the competent genetic algorithm messyGA.||Type of material:||Conference Publication||Publisher:||Springer||Copyright (published version):||2002 Springer||Keywords:||Grammatical evolution;Genetic algorithms;Onemax problem;Mastermind||DOI:||10.1007/3-540-45984-7_27||Language:||en||Status of Item:||Peer reviewed||Is part of:||Foster, J. A., Lutton, E., Miller, J., Ryan, C. and Tettamanzi, A. (eds.). Genetic Programming: 5th European Conference (EuroGP) (Volume 2278)||Conference Details:||Genetic Programming: 5th European Conference (EuroGP), Kinsale, Co. Cork, Ireland, 3-5 April 2002|
|Appears in Collections:||Business Research Collection|
Show full item record
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. For other possible restrictions on use please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.