基于遗传算法的数值优化约束问题的研究  

Study of Numerical Optimization Constraint Problems Based on Genetic Algorithm

作　　者：刘正龙[1] 杨艳梅[2] 

机构地区：[1]川北医学院基础医学院计算机与数学教研室,南充637007 [2]西华师范大学数学与信息学院,南充637000

出　　处：《计算机系统应用》2013年第5期139-142,197,共5页Computer Systems & Applications

基　　金：四川省教育厅自然科学基金(12ZB040);四川省教育厅教育发展研究中心基金(CJF10019)

摘　　要：针对数值优化约束中出现的大规模、多峰多态函数,含离散变量等情况下的全局优化问题,采用常规的优化方法,收敛速度较慢,求得全局极值的概率较低.提出用遗传算法的数值优化约束问题解决,通过数值仿真实验结果表明,该算法性能优于现有其它算法,它不仅可以处理线性等式约束,而且还可以处理非线性等式约束,同时提高了收敛速度和解的精度,是高效稳健的智能算法,具有很高的全局寻优能力和很快的收敛速度,对求解复杂多峰多态函数的优化约束问题具有可行性和有效性.For numerical optimization constraints appear in the large-scale, multi-function polymorphism, on global opti- mization with discrete variables under such circumstances, General optimization method, convergence is slow to seek global extremum of low probability. Made with genetic algorithm of numerical optimization constraints problem solution, by numerical simulation experimental results indicates that, the algorithm performance better than existing other algorithm, it not only can processing linear equation constraints, and also can processing nonlinear equation constraints, while improve has convergence speed reconciliation of precision, is efficient sound of intelligent algorithm, has is high of global found excellent ability and soon of convergence speed, on solution complex more peak more State function of optimization constraints problem has feasibility and effectiveness.

关 键 词：数值优化 遗传算法 约束问题 非线性等式约束 全局优化问题 收敛速度 全局寻优能力 离散变量 

分 类 号：TP18[自动化与计算机技术—控制理论与控制工程]