Show simple item record

dc.contributor.authorHill, Seamus
dc.contributor.authorO'Riordan, Colm
dc.date.accessioned2018-12-07T15:27:16Z
dc.date.available2018-12-07T15:27:16Z
dc.date.issued2012-10-05
dc.identifier.citationHill, Seamus, & O'Riordan, Colm. (2012). Neutrality through transcription and translation in genetic algorithm representation. Paper presented at the 4th International Conference on Evolutionary Computation Theory and Applications ECTA, Barcelona, Spain, 05-07 October, In Proceedings of the 4th International Joint Conference on Computational Intelligence - Volume 1: ECTA, (IJCCI 2012), pages 220-225. DOI: 10.5220/0004156702200225en_IE
dc.identifier.isbn978-989-8565-33-4
dc.identifier.urihttp://hdl.handle.net/10379/14680
dc.description.abstractThis paper examines the use of the biological concepts of transcription and translation, to introduce neutrality into the representation of a genetic algorithm (GA). The aim of the paper is to attempt to identify problem characteristics which may benefit from the inclusion of neutrality, through a basic adaptation of the concepts of transcription and translation, to create a genotype-phenotype map (GP-map) which introduces phenotypic variability. Neutrality can be viewed as a situation where a number of different genotypes represent the same phenotype. A modification of De Jong s classic test suite was used to compare the performance of a simple generic algorithm (SGA) and a multi layered mapping genetic algorithm (MMGA), which incorporates the concepts of transcription and translation into its GP-map. The modified De Jong test suite was chosen as it is well understood and has been used in numerous comparisons over the years, thus allowing us to contrast the performance of the MMGA against other GA variations as well as attempting to identify problem character- istics in isolation. Initial results indicate that the neutrality introduced through the multi-layered mapping can prove beneficial for problems containing certain characteristics, in particular multidimensional, multimodal, continuous and deterministic.en_IE
dc.formatapplication/pdfen_IE
dc.language.isoenen_IE
dc.publisherSciTePress Digital Libraryen_IE
dc.relation.ispartof4th International Conference on Evolutionary Computation Theory and Applications ECTAen
dc.subjectGenetic algorithmsen_IE
dc.subjectRepresentationen_IE
dc.subjectNeutralityen_IE
dc.subjectGenotype-phenotype Mappingen_IE
dc.subjectTranscriptionen_IE
dc.subjectTranslationen_IE
dc.titleNeutrality through transcription and translation in genetic algorithm representationen_IE
dc.typeConference Paperen_IE
dc.date.updated2018-12-05T16:26:27Z
dc.identifier.doi10.5220/0004156702200225
dc.local.publishedsourcehttps://dx.doi.org/10.5220/0004156702200225en_IE
dc.description.peer-reviewedpeer-reviewed
dc.internal.rssid1912311
dc.local.contactSéamus Hill, Information Technology. 5232 Email: seamus.hill@nuigalway.ie
dc.local.copyrightcheckedYes
dc.local.versionACCEPTED
nui.item.downloads30


Files in this item

Attribution-NonCommercial-NoDerivs 3.0 Ireland
This item is available under the Attribution-NonCommercial-NoDerivs 3.0 Ireland. No item may be reproduced for commercial purposes. Please refer to the publisher's URL where this is made available, or to notes contained in the item itself. Other terms may apply.

The following license files are associated with this item:

Thumbnail

This item appears in the following Collection(s)

Show simple item record