Abstract: In crossover and mutation operations of the genetic algorithm for solving nonlinear programming, to ensure the feasibility of the solutions in each generation, the paper presents a method in which the bounds of every variable in the solution are estimated beforehand according to the constrained conditions.The experimental results show that the method is efficient and can obtain better results in less computation time.

摘要： 针对用遗传算法求解非线性规划问题时交叉、变异过程中所产生的新一代近似解合法性问题,提出了预先定界的方法,根据约束条件确定下一代近似解的合法的取值范围。实验证明该方法有效,且能保证在较短的时间里取得较好的结果。

关键词: 遗传算法, 非线性规划, 交叉, 变异

CLC Number: 

• TP18