Abstract: 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 operat

Key words: Genetic algorithms, Genetic operators, Global optimization, Prematurely convergence, Traveling Salesman Problems （TSP）