Abstract: In order to solve the problem of slow convergent speed of Genetic Algorithm (GA) in its application to complex optimal searching, this paper presents a new modified genetic algorithm. With the introduction of convergence operator and proceeding operator, which can enhance global searching ability and quicken convergent speed of the canonical genetic algorithm, the new algorithm can adaptively adjust the probabilities of crossover and mutation. Several optimization examples are given in this paper to compare the proposed algorithm with the existing adaptive algorithms and to demonstrate the effectiveness of the algorithm.