| 快速寻优的遗传交叉策略 |
| |
| 引用本文： | 陈小平,石 玉,于盛林.快速寻优的遗传交叉策略[J].控制理论与应用,2002,19(6):981-984. |
| |
| 作者姓名： | 陈小平 石 玉 于盛林 |
| |
| 作者单位： | 1. 苏州大学通信与电子工程系,苏州,215021
2. 南京航空航天大学测试工程系,南京,210016 |
| |
| 摘 要： | 介绍了遗传算法中一种新的交叉策略, 它利用逼近方法决定遗传算法中子代个体的位置. 采用这种交叉策略可以使子代快速地向更高适应度的区域移动, 实验数据说明使用这种交叉策略的遗传算法可以极大地提高算法获得最优解的速度.
|
| 关 键 词： | 遗传算法 交叉策略 逼近 |
| 文章编号： | 1000-8152(2002)06-0981-04 |
| 收稿时间： | 9/5/2000 12:00:00 AM |
| 修稿时间： | 2000年9月5日 |
Genetic crossover strategy to obtain optimal solutions quickly |
| |
| CHEN Xiao-ping\,\,\.Genetic crossover strategy to obtain optimal solutions quickly[J].Control Theory & Applications,2002,19(6):981-984. |
| |
| Authors: | CHEN Xiao-ping\ \ \ |
| |
| Affiliation: | Department of Communication and Electronics Engineering, Suzhou University, Suzhou 215021, China;Department of Measurement and Testing Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing 210016, China;Department of Measurement and Testing Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing 210016, China |
| |
| Abstract: | This paper presents a crossover strategy that utilizes an approximation concept to steer the location of progeny in genetic algorithm. The use of such a crossover strategy provides the capacity of quickly moving progeny toward regions with improved fitness. Experiment results demonstrated that genetic algorithms with this crossover strategy could greatly accelerate the speed on obtaining optimal solutions. |
| |
| Keywords: | genetic algorithms crossover strategy approximation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《控制理论与应用》浏览原始摘要信息 |
|
点击此处可从《控制理论与应用》下载全文 |
|
