The genetic algorithm (GA) is a problem-solving method that is modeled after the process of natural selection. We are interested in studying a specific aspect of the GA: the effect of noncoding segments on GA performance. Noncoding segments are segments of bits in an individual that provide no contribution, positive or negative, to the fitness of that individual. Previous research on noncoding segments suggests that including these structures in the GA may improve GA performance. Understanding when and why this improvement occurs will help us to use the GA to its full potential. In this article we discuss our hypotheses on noncoding segments and describe the results of our experiments. The experiments may be separated into two categories: testing our program on problems from previous related studies, and testing new hypotheses on the effect of noncoding segments.

This content is only available as a PDF.
You do not currently have access to this content.