| 一种间接求解约束优化问题的遗传算法 |
| |
| 引用本文： | 张静,林淑飞.一种间接求解约束优化问题的遗传算法[J].忻州师范学院学报,2006,22(5):126-128. |
| |
| 作者姓名： | 张静 林淑飞 |
| |
| 作者单位： | 忻州师范学院,山西,忻州,034000 |
| |
| 摘 要： | 传统的遗传算法在求解带约束的数值优化问题时,主要采用罚函数法。文章针对罚函数法在实际应用中的不足,提出了一种将约束优化问题转化为双目标优化问题,然后使用双目标遗传算法进行求解的方法。仿真结果表明该方法是一种有效的约束问题寻优方法。
|
| 关 键 词： | 遗传算法 约束优化 双目标优化 双目标遗传算法 |
| 文章编号： | 1671-1491（2006）05-0126-03 |
| 收稿时间： | 2006-07-02 |
| 修稿时间： | 2006-07-02 |
A Genetic Algorithm of Indirect Solution for Constrained Optimization Problems |
| |
| ZHANG Jing,LIN Shu-fei.A Genetic Algorithm of Indirect Solution for Constrained Optimization Problems[J].Journal of Xinzhou Teachers University,2006,22(5):126-128. |
| |
| Authors: | ZHANG Jing LIN Shu-fei |
| |
| Abstract: | The traditional genetic algorithm is usually based on the penalty function methods to handle the constrained optimization problems.But it is difficult to choose the appropriate penalty parameters for practical application of the penalty function methods.This paper presents a new method that changes the constrained optimization problems into the double object optimization problems and uses the genetic algorithm with double object to resolve the problems.The simulation results show the well performances of the presented algorithm. |
| |
| Keywords: | genetic algorithm constrained optimization double object optimization double object genetic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
