Appling contractive mapping hybrid genetic algorithms to finding all solutions of global optimization

To solve the schema deception and premature convergence problem in the pure genetic algorithm, based on the theory method of interval, Banach fixpoint and genetic algorithms, the contractive-mapping-hybrid-genetic algorithms (CMGA) were constructed and quadratic extension of Lipschitz was applied to testify the multi mode function extremum. The calculating examples validated the algorithmpsilas excellent performance in the global optimization problem The verifying terms are simple and easy to be actualized. The algorithms speed up the convergence obviously and improved reliability, thus the schema deception and premature convergence problem can be well solved.