Improvement of generation change on SSE algorithm

摘要

The Stochastic Schemata Exploiter (SSE) is one of the evolutionary optimization algorithms for solving the combinatorial optimization problems. For improving the search performance of SSE, we will present the cross generational elitist selection SSE (cSSE) algorithms of which the generation alternation algorithm is improved by using cross generational elitist selection. The SSE and the cSSE are compared with the Minimal Generation Gap (MGG) and the Bayesian Optimization Algorithm (BOA) on deception and knapsack problems in order to discuss their features.