首页 | 本学科首页   官方微博 | 高级检索  
     检索      

遗传算法求解约束非线性规划及Matlab实现
引用本文:倪金林.遗传算法求解约束非线性规划及Matlab实现[J].大学数学,2005,21(1):91-95.
作者姓名:倪金林
作者单位:合肥工业大学,理学院,应用数学系,合肥,230009
基金项目:安徽省教育教学研究项目
摘    要:对于约束非线性规划问题,传统的方法:可行方向法、惩罚函数法计算烦琐且精度不高.用新兴的遗传算法来解决约束非线性规划,核心是惩罚函数的构造.以前的惩罚函数遗传算法有的精度较低,有的过于复杂.本文在两个定义的基础上构造了新的惩罚函数,并在新的惩罚函数的基础上,提出了一种解决约束非线性最优化问题的方法.通过两个例子应用Matlab说明了这个算法的可行性.

关 键 词:遗传算法  约束非线性规划  惩罚函数  交叉  变异
文章编号:1672-1454(2005)01-0091-05
修稿时间:2004年1月25日

The Solution of Optimization with Nonliear Constraints Programming with Genetic Algorithm and Demonstration by Matlab
NI Jin-lin.The Solution of Optimization with Nonliear Constraints Programming with Genetic Algorithm and Demonstration by Matlab[J].College Mathematics,2005,21(1):91-95.
Authors:NI Jin-lin
Abstract:To optimization with nonlinear constraints programming, traditional method, such as feasible direction, penalty function, is complicated and imprecise. Solving optimization with nonlinear constraints programming by genetic algorithm, penalty function is core. The former genetic algorithm with penalty function is not perfect, imprecise and complicated. Based on two definition, the new penalty function is found. Throught new penalty function, the article develops the new method of solution of optimization with nonliear constraints programming. Two examples show that the improved method is effective.
Keywords:genetic algorithm  optimization with nonliear constraints programming  penalty function  mutation  crossover
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号