求解约束优化问题的一种新的遗传算法  

A Novel Genetic Algorithm for Solving Constrained Optimization Problems

作　　者：梁昔明[1] 肖伟[2] 

机构地区：[1]北京建筑工程学院理学院,北京100044 [2]中南大学信息科学与工程学院,湖南长沙410083

出　　处：《应用数学》2013年第2期308-313,共6页Mathematica Applicata

基　　金：北京市自然科学基金资助项目(4122022);北京市属高等学校人才强教计划资助项目(201107123);北京建筑工程学院博士启动基金项目

摘　　要：提出一种新的求解约束优化问题的遗传算法,算法通过重新定义可行解与不可行解的适应度函数分别对它们进行选择,有效避免了惩罚函数法引入参数所带来的困难,重新设计的交叉算子使得算法对解空间的寻优范围扩大了.数值实验结果表明算法具有较好的鲁棒性,且对最优解位于约束边界上的一类问题具有很大优势.A novel genetic algorithm for solving constrained optimization is proposed. Feasible and infeasible solution are chosen, separately, via their re-defined fitness function, which effectively avoids the difficulties caused by introducing parameters in penalty function method. Re-designed crossover operators expand the search scope of the proposed algorithm in the optimal solution space. The numerical experience results show that the proposed algorithm has good robust,and has the great advantage for a class of problems whose optimal solution is located on the constraint boundary.

关 键 词：约束优化问题 可行解 不可行解 遗传算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]