A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case

<table><tr><td><table class="algorithm" id="alg4"><tr><td colspan="2">CGC1. Compress the common genes detected by CGD—by choosing a</td></tr><tr><td colspan="2">  <i> </i>representative for, and saving away the information associated with,</td></tr><tr><td colspan="2">  <i> </i>each segment of the common genes.</td></tr><tr><td colspan="2">CGC2. Remove the common genes compressed in step 1 so that the later</td></tr><tr><td colspan="2">  <i> </i>generations of the GA will only see the representatives chosen in step 1.</td></tr></table></td></tr></table>

Outline of common genes compression algorithm.

The Scientific World Journal

alg4

Algorithm 4

Algorithm 4: A High-Performance Genetic Algorithm: Using Traveling Salesman Problem as a Case 