The Genetic Algorithm Based on Mixed Genetic Operators
遗传算法的混合算子策略

In a general Genetic Algorithms (GA), it is difficulty to avoid prematurely convergence and raise the speed of the algorithm convergence for complex finding the optimal solution, in which the algorithm is run with a single set of crossover/mutation operators. In this paper, a new run-strategy of Genetic Algorithms based on mixed genetic operators is presented, a heuristic crossover operator based on the edge recombination is also given to raise the ability of the local searching and the speed of convergence in solving the Traveling Salesman Problems (TSP). The efficiency of the algorithm has been shown by simulative experiments.