Multi-Complex Evolution Algorithm for Constraint Nonlinear Optimization Problems
Jian Wang · 2001
The essential concepts and the characters of the SCE UA method are reviewed, and some limitations of the SCE UA method are pointed out, such as (1) the global optimum of the method depends on the variety of the initial point sets, if the initial point sets can not be selected properly, the global optimum can not be obtained,(2) the general inequality constraint nonlinear optimization problems can not be solved effectively. In this paper, a more effective method called Multi Complex Evolution Algorithm for Constraint Nonlinear Optimization Problems is presented. This new method can use the information of the objective function to search for the optimum objectively. This new method is a global optimization method,which can be used for general inequality constraint nonlinear optimization problems efficiently and effectively.