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

一个通用的混合非线性规划问题的演化算法
引用本文:康卓,李艳,刘溥,康立山.一个通用的混合非线性规划问题的演化算法[J].计算机研究与发展,2002,39(11):1471-1477.
作者姓名:康卓  李艳  刘溥  康立山
作者单位:武汉大学软件工程国家重点实验室,武汉,430072;武汉大学计算中心,武汉,430072
基金项目:国家自然科学基金资助 ( 6 0 1330 10 ,6 0 0 730 43,70 0 710 42)
摘    要:提出了一种新的求解非线性规划问题的演化算法,它是在郭涛算法的基础上提出的,新算法的主要特点是引入了变维子空间,加入了子空间搜索过程和规范化约束条件以及增加了处理带等式约束的实数规划,整数规划,0-1规划和混合整数规划问题的功能,使之成为一种求解非线性规划(NLP)问题的通用算法,数值实验表明,新算法不仅是一种通用的算法,而且与已有算法的计算结果相比,其解的精确度也最好。

关 键 词:混合非线性规划  演化算法  郭涛算法  数值试验

AN ALL-PURPOSE EVOLUTIONARY ALGORITHM FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS
KANG Zhuo,LI Yan,LIU Pu,and KANG Li-Shan.AN ALL-PURPOSE EVOLUTIONARY ALGORITHM FOR SOLVING NONLINEAR PROGRAMMING PROBLEMS[J].Journal of Computer Research and Development,2002,39(11):1471-1477.
Authors:KANG Zhuo  LI Yan  LIU Pu  and KANG Li-Shan
Abstract:A new evolutionary algorithm for solving the nonlinear programming (NLP) problems is proposed in this paper. It's based on Guo's algorithm and has added some capabilities for solving NLP problems, such as introdusing the variable subspace, adding a search process of subspace and normalized constraints, and adding the function to deal with the equality constraints, integer NLP problems, 0-1 NLP problems and mixed-integer NLP problems that make it a really all-purpose algorithm for solving nonlinear programming problems. Numerical experiments show that the new algorithm is not only an all-purpose algorithm, but also a high-performance algorithm with better results than others.
Keywords:nonlinear programming problems  evolutionary algorithm  Guo's algorithm
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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