求解一类非线性规划问题的混合遗传算法  

Hybrid Genetic Algorithm for Solving a Class of Nonlinear Programming Problems

作　　者：王登刚[1] 刘迎曦[2] 李守巨[2] 

机构地区：[1]上海交通大学建筑工程与力学学院,上海200030 [2]大连理工大学工业装备结构分析国家重点实验室,大连116024

出　　处：《上海交通大学学报》2003年第12期1953-1956,共4页Journal of Shanghai Jiaotong University

基　　金：国家自然科学基金资助项目(10072014;10302023)

摘　　要：提出了一种求解目标函数和约束条件均二阶可导的非线性规划问题的混合计算智能算法.该算法是把一种浮点数编码遗传算法和约束变尺度法相结合提高求取全局解的速度和概率.在该算法中,选择、交叉和变异等遗传操作算子是以非线性规划问题的一个惩罚函数为求解对象,目的是把解引向全局解附近,为约束变尺度算子提供初值;而约束变尺度算子直接以原非线性规划问题为求解对象,以发挥其局部搜索能力强的优点.数值实验表明,混合算法是一种可靠、高效的全局优化算法.A hybrid genetic algorithm for solving nonlinear programming problems with twice differentiable objective and twice differentiable constraints was presented. In the algorithm, a constrained variable metric method is set in a real-code genetic algorithm to improve the genetic algorithm's global convergence speed and global convergence probability. The constrained variable metric method is taken as an optimization operator paralleling to the selection operator, crossover operator and mutation operator. The selection operator, the crossover operator and the mutation operator are used to optimize the penalty functions of the original nonlinear programming problems to provide good initial values for the constrained variable metric method. However, the constrained variable metric method directly solves the original nonlinear programming problem to take advantage of its powerful local searching ability. The numerical experiments illustrate that the present hybrid algorithm is an efficient and reliable global optimization approach.

关 键 词：非线性规划 优化 混合遗传算法 

分 类 号：O39[理学—工程力学] O221.2[理学—力学]