Genetic algorithm to solve optimization problem with equality constrains

Aiming at difficultly solving optimization with equality constraint in genetic algorithm, based on independence analysis of design variables, a descending dimension method was used to deal with equality constraint. In this way, not only equality constraints can be strictly satisfied during optimization, but also there are only inequality constrains in optimization. Furthermore, referring to the multi-objective idea, individuals was ranked through violation degree and violation times simultaneously, which is more in accord with practice. Finally, three numerical examples were used to examine the proposed method, satisfying results were achieved, which indicates the method is valid and feasible.