In the past, gene-set genetic algorithms were proposed, in which gene sets, instead of individual genes, were used in the genetic process to speed up the convergence. In this paper, another escape operation, as well as the mutation operation, is designed for gene-set genetic algorithms to increase the probability of finding global optima. The property that a longer gene set will cause a larger diversity is shown. An escape operation based on the property is thus designed and a modified gene-set genetic algorithm with the escape operation is proposed. The modified gene-set genetic algorithm can consider both the escape from local optima and the search for global optima. Experiments on three problems are also made to show the effectiveness of the modified genetic algorithm.
['Tzung-Pei Hong', 'Min-Thai Wu', 'Ya-Fang Tung', 'Shyue-Liang Wang']
Using escape operations in gene-set genetic algorithms