作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

›› 2004, Vol. 30 ›› Issue (18): 42-.

• 论文 • 上一篇    下一篇

用遗传算法求解的非线性规划问题

陈崚,沈洁   

  1. 扬州大学计算机科学系,扬州大学计算机科学系 扬州 225009;南京大学软件新技术国家重点实验室,南京 210093
  • 发布日期:2004-09-25

Solving Nonlinear Programming Using Genetic Algorithm

CHEN Ling1,2,SHEN Jie1   

  1. (1.Department of Computer Science, Yangzhou University, Yangzhou 225009; 2.National Key Lab of Novel Software Tech., Nanjing Univ., Nanjing 210093)
  • Published:2004-09-25

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

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

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.

中图分类号: