Ordering Genetic Algorithms and Deception

This paper considers deception in the context of ordering genetic algorithms (GAs). Order-four deceptive ordering problems are designed for absolute and relative ordering decoding. Three different crossover operators are used in both absolute and relative ordering problems, and for each combination of crossover operator and coding, the schema survival probability is calculated. Simulation results show that no single crossover operator is adequate to find the globally optimal solution in both absolute and relative ordering problems. This confirms the fundamental GA theory, that the success of a genetic algorithm depends on how well the crossover operator respects the underlying coding of the