| 基于退火不可行度的约束优化问题遗传算法 |
| |
| 引用本文： | 詹士昌.基于退火不可行度的约束优化问题遗传算法[J].应用基础与工程科学学报,2004,12(3):299-304. |
| |
| 作者姓名： | 詹士昌 |
| |
| 作者单位： | 杭州师范学院物理系,浙江,杭州,310012 |
| |
| 基金项目： | 杭州师范学院科研基金重点项目(项目编号2004XNZ04) |
| |
| 摘 要： | 传统的遗传算法在求解带约束的数值优化问题时，主要采用罚函数法．本文针对罚函数法在实际应用中的困难和不足，提出了基于退火不可行度的遗传算法来处理各类约束优化问题．仿真结果表明该方法是一种有效的约束问题寻优算法．
|
| 关 键 词： | 约束优化问题 罚函数法 遗传算法 求解 数值优化 寻优 退火 仿真结果 |
| 文章编号： | 1005-0930(2004)03-0299-06 |
| 修稿时间： | 2003年12月10 |
Genetic Algorithm for Constrained Optimization Problems Which is Based on the Annealing Infeasible Degree |
| |
| ZHAN Shichang.Genetic Algorithm for Constrained Optimization Problems Which is Based on the Annealing Infeasible Degree[J].Journal of Basic Science and Engineering,2004,12(3):299-304. |
| |
| Authors: | ZHAN Shichang |
| |
| Abstract: | Genetic algorithm based on the penalty function methods are usually applied to handle the constrained optimization problems. But it is difficult to choose the appropriate penalty parameters for practical application of the penalty function methods. In this paper, a genetic algorithm based on annealing infeasible degree selection is proposed for constrained optimization problems. The simulation results show the well performances of the presented algorithm. |
| |
| Keywords: | genetic algorithms annealing infeasible degree selection constrained optimization problems |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
