遗传算法求解有约束组合优化问题是对目标函数在整个遗传空间中搜索满足约束条件的可行解。
GA to solve constrained optimization problem is searching the feasibility answers satisfied the constraint condition in the global genetic type space.
第二步通过求解非线性代数方程(组)来处理非线性并通过解饱和来满足约束。
The second step deals with nonlinearity by solving a nonlinear algebraic equation (group) and satisfies constraint by desaturation.
在为机组组合问题编制算法的过程中，因需要满足错综复杂的约束条件，容易使程序结构混乱、逻辑判断出错，最终导致算法求解失败。
During the programming of the algorithm for the unit commitment problem, the complex constraints often lead the program to bad structure or wrong result.
应用推荐