| 遗传算法局部最优的定向移民策略 |
| |
| 引用本文： | 李敏,施洪昌.遗传算法局部最优的定向移民策略[J].兵工自动化,2004,23(5):65-66. |
| |
| 作者姓名： | 李敏 施洪昌 |
| |
| 作者单位： | 1. 西南科技大学,信控学院,四川,绵阳,621002
2. 中国空气动力研究中心,四所,四川,绵阳,621000 |
| |
| 摘 要： | 基于定向移民策略的改进遗传算法,把定向移民引入遗传算法,经定向移民产生初始种群的集合,再复制、交叉和变异进化,随机选取高品质移民,组成新种群.由新种群开始复制、交叉和变异,直至寻出最优个体.试验结果表明,初始种群克服了GA自适应随机搜索局部最优和过早收敛问题.
|
| 关 键 词： | 定向移民 遗传算法 局部最优 过早收敛 遗传算法 局部 最优个体 定向移民 策略 Genetic Algorithm Optimization Local Strategy 收敛问题 随机搜索 自适应 结果 试验 新种群 组成 高品质 随机选取 交叉和变异 复制 |
| 文章编号： | 1006-1576(2004)05-0065-02 |
| 修稿时间： | 2004年6月8日 |
Directional Immigrant Strategy for Local Optimization of Genetic Algorithm |
| |
| LI Min,SHI Hong-chang.Directional Immigrant Strategy for Local Optimization of Genetic Algorithm[J].Ordnance Industry Automation,2004,23(5):65-66. |
| |
| Authors: | LI Min SHI Hong-chang |
| |
| Abstract: | The improved genetic algorithm (GA) based on directional immigrant strategy is that directional immigrant was inducted into GA. The set of original group was produced by directional immigrant, after copying, crossing, mutation evolution, and choose excellent immigrant to make up of new group. The new group begins to copy, cross and mutate until the best unit will be found. The experiment result shows that problems of local optimization and premature constringency were resolved with the original group in GA adaptive random search. |
| |
| Keywords: | Directional immigrant Genetic algorithm Part optimization Prematurity constringency |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
