| 一种提高局部搜索能力的混合遗传算法 |
| |
| 引用本文： | 田延硕,刘晓云.一种提高局部搜索能力的混合遗传算法[J].电子科技大学学报(社会科学版),2006(2). |
| |
| 作者姓名： | 田延硕 刘晓云 |
| |
| 作者单位： | 电子科技大学自动化工程学院 成都610054 |
| |
| 摘 要： | 针对遗传算法局部搜索能力弱的缺陷,提出了一种改进的混合遗传算法。根据遗传的不同阶段分为两个不同的群体——竞争群体和适应性群体,提出相关的遗传算子——繁殖因子。将运筹学中的单纯形法应用于遗传算法中,增强了遗传算法的局部搜索能力。对复杂函数的寻优实验验证了混合遗传算法的有效性,并通过与传统SGA的实算结果对比,更进一步说明了算法的改进效果。
|
| 关 键 词： | 遗传算法 竞争群体 适应性群体 繁殖因子 单纯形算法 混合遗传算法 |
A Mixed Genetic Algorithm of Improve Local Search Ability |
| |
| TIAN Yan-shuo,LIU Xiao-yun.A Mixed Genetic Algorithm of Improve Local Search Ability[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2006(2). |
| |
| Authors: | TIAN Yan-shuo LIU Xiao-yun |
| |
| Abstract: | There are some limitations that using genetic algorithms. This paper presents the Mixed Genetic Algorithm(MGA). Based on the phase of genetic,the colonies are differentiated to two different colonies-adaptive population and competing population. The correlated operator, propagate gene, is brought forward. The local search ability of the genetic algorithm is enhenced by using the simplex algorithm of operational research. The emulation experiment data shows the optimizing convergence reliability and higher converging velocity. |
| |
| Keywords: | genetic algorithm adaptive population competing population propagate gene simplex algorithm mixed genetic algorithm |
| 本文献已被 CNKI 等数据库收录！ |
