一种基于特殊个体的改进遗传算法

A Genetic Algorithm without Mutation

提出了一种不需要变异操作，只由交换操作就能遍历搜索空间所有状态点的改进遗传算法。这种算法通过在种群中增加两个特殊个体，就足以提供交换所需的基因材料。在计算量上这种算法比简单的遗传算法明显要小。

We propose a modified genetic algorithm(GA) without mutation operators in order to reduce computation time and to simplify designing. In the absence of mutation, we add two individuals to the population so that evolution can still go ahead. Our modified GA, using only crossover operator, can reach every point in the searching space of the problem to be solved. We discuss in detail how, compared with simple GA, our modified GA reduces computation time significantly. Elimination of mutation operator simplifies designing. Simulation results (Figs.2 and 3) show the effectiveness of our modified GA.