An analysis of a reordering operator on a GA-hard problem

This paper analyzes the performance of a genetic algorithm that combines reproduction, crossover, and a reordering operator. Reordering operators have often been suggested as one way to avoid thecoding traps — the combinations of loose linkage and deception among important, lower order schemata — of fixed codings. The analysis confirms this role and suggests directions for further research.