EXPLORING THE RELATIONSHIP OF THE CLOSENESS OF A GENETIC ALGORITHM’S CHROMOSOME ENCODING TO ITS PROBLEM SPACE
For historical reasons, implementers of genetic algorithms often use a haploid binary primitive type for chromosome encoding. I will demonstrate that one can reduce development effort and achieve higher fitness by designing a genetic algorithm with an encoding scheme that closely matches the proble...
| Main Author: | |
|---|---|
| Format: | Others |
| Published: |
DigitalCommons@CalPoly
2010
|
| Subjects: | |
| Online Access: | https://digitalcommons.calpoly.edu/theses/247 https://digitalcommons.calpoly.edu/cgi/viewcontent.cgi?article=1257&context=theses |