Impact of DNA length on Genetic Algorithm performance
<p>I've tried to research about this but couldn't find a satisfying answer. How does the length of an individuals DNA impact on the overall performance of the GA? </p>

<p>Imagine that I'm trying to find a solution for a combinatorial problem with many dimensions (x, y, z, w) for example. Representing the DNA in binary would yield a very long sequence.. are there any suggestions to how far I am allowed to go?</p>

<p>In my opinion the search space (should) increase exponentially with the amount of elements exposed to mutation, am I wrong?</p>

<p>What are some guidelines or techniques (preferably derived from experience) that somebody could provide on how to reduce the length of the DNA?</p>