Revision as of 07:55, 24 July 2023 edit Citation bot (talk \| contribs) Bots 5,862,500 edits Add: series, doi, s2cid. \| Use this bot. Report bugs. \| #UCB_CommandLine 610/9214 ← Previous edit		Revision as of 11:12, 6 August 2023 edit undo Citation bot (talk \| contribs) Bots 5,862,500 edits Alter: title, url, template type. URLs might have been anonymized. Add: chapter-url, chapter. Removed parameters. Some additions/deletions were parameter name changes. \| Use this bot. Report bugs. \| Suggested by Headbomb \| Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox3 \| #UCB_webform_linked 326/2306 Next edit →
Line 12: * Design of the chromosome in such a way that it covers only the search space and no additional areas. so that there is no [[Genetic representation#Redundancy\|redundancy]] or only as little redundancy as possible. * Observance of [[Causality conditions\|strong causality]]: small changes in the chromosome should only lead to small changes in the phenotype.<ref>{{Cite ~~journal~~book \|last1=Galván-López \|first1=Edgar \|last2=McDermott \|first2=James \|last3=O'Neill \|first3=Michael \|last4=Brabazon \|first4=Anthony \|~~date~~title=~~2010-07-07~~Proceedings of the 12th annual conference on Genetic and evolutionary computation \|~~title~~chapter=Towards an understanding of locality in genetic programming \|date=2010-07-07 \|chapter-url=https://dl.acm.org/doi/10.1145/1830483.1830646 ~~\|journal=Proceedings of the 12th Annual Conference on Genetic and Evolutionary Computation~~ \|language=en \|___location=Portland Oregon USA \|publisher=ACM \|pages=901–908 \|doi=10.1145/1830483.1830646 \|isbn=978-1-4503-0072-8\|s2cid=15348983 \|url=https://mural.maynoothuniversity.ie/15390/1/EG_towards.pdf }}</ref> This is also called [[Genetic representation#Locality\|locality]] of the relationship between search and problem space. * Designing the chromosome in such a way that it excludes prohibited regions in the search space completely or as much as possible.

Chromosome (evolutionary algorithm): Difference between revisions