Abstract
The Stochastic Schemata Exploiter(SSE) is one of the evolutionary optimization algorithms for solving the combinatorial optimization problems. The SSE can improve the global search ability by maintaining the diversity of the population. In this paper, we present the Cross generational elitist selection SSE(cSSE) algorithms which improves the generation alternation model of the SSE. The SSE and the cSSE are compared with the Minimal Generation Gap(MGG) and the Bayesian Optimization Algolithm(BOA) in 0/1 combinatorial optimization problem in order to discuss their convergence property. As a result, we indicate that cSSE has an excellent convergence property and the global search ability.
