A New Method of Evolutionary Algoriths for Mixed-Integer Nonlinear Optimization Problem ——Automatically Constracting Search Space to Optimal Solution
Zeng San · Wuhan University Journal · 2000
A new method of evolutionary algorithms,called automatically constracting search space to optimal solution( ACSSOS) ,is proposed in this study .In this method,search space was gradually constracted to optimal solution while evolutionary algorithm was used repeatedly and incompletely.When the constracted space would cause the evolutionary algorithm trapped local optimum,the algorithm ran completely. In the evolutionary algorithm integer variables,relaxed as real variables during crossover operating,and the relaxed variables in the offsprings were rounded back before evaluating fitness. Real coding was used,and only crossoveroperators were adopted buttwo kindsof crossoveroperators were used in the method.The new method may not only be used to solve mixed- integer nonlinear optimization problems,but also used to solve the real or integer nonlinear optimization problems.The computation results demonstratored that the ACSSOS is superior to other methods in terms of solution quality , robustness and convergent speed.