摘要
提出了一种新的求解非线性规划问题的演化算法 .它是在郭涛算法的基础上提出来的 ,新算法的主要特点是引入了变维子空间 ,加入了子空间搜索过程和规范化约束条件以及增加了处理带等式约束的实数规划、整数规划、0 - 1规划和混合整数规划问题的功能 ,使之成为一种求解非线性规划 (NL P)问题的通用算法 .数值实验表明 ,新算法不仅是一种通用的算法 ,而且与已有算法的计算结果相比 ,其解的精确度也最好 .
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.
出处
《计算机研究与发展》
EI
CSCD
北大核心
2002年第11期1471-1477,共7页
Journal of Computer Research and Development
基金
国家自然科学基金资助 ( 6 0 1330 10
6 0 0 730 43
70 0 710 42)
关键词
混合非线性规划
演化算法
郭涛算法
数值试验
nonlinear programming problems, evolutionary algorithm, Guo's algorithm
