The traditional crossover operator used in genetic search exhibits a position-dependent bias called the dcfining-length bias. We show how this bias results in hidden biases that are difficult to anticipate and compensate for. We introduce a new crossover operator, shuffle crossover, that eliminates the position dependent bias of the traditional crossover operator by shuffling the representation...

Robust combinatorial optimization problems with cardinality constrained uncertainty may be solved by a finite number of nominal problems. In this paper, we show that the number of nominal problems to be solved can be reduced significantly.

This paper presents a comparison in the performance analysis between a newly developed crossover operator called Rayleigh Crossover (RX) and an existing crossover operator called Laplace Crossover (LX). Coherent to the previously defined Scaled Truncated Pareto Mutation (STPM) operator to form two (2) generational RCGAs called RX-STPM and LX-STPM, both crossovers are utilized. A set of ten (10)...