引用本文:陈小平,石　玉,于盛林.快速寻优的遗传交叉策略[J].控制理论与应用,2002,19(6):981~984.[点击复制]
CHEN Xiao-ping\+1, \+2, \+2 (1.Department of Communication and Electronics Engineering, Suzhou University, Suzhou 215021, China;\ \ \ \ \ \ \ \ 2.Department of Measurement and Testing Engineering, Nanjing University of Aeronautics & Astronautics, Nanjing,SHI Yu,YU Sheng-lin.Genetic crossover strategy to obtain optimal solutions quickly[J].Control Theory and Technology,2002,19(6):981~984.[点击复制]
快速寻优的遗传交叉策略
Genetic crossover strategy to obtain optimal solutions quickly
摘要点击 3291  全文点击 1221  投稿时间：2000-09-05  修订日期：2001-08-28
查看全文  查看/发表评论  下载PDF阅读器
DOI编号  10.7641/j.issn.1000-8152.2002.6.037
  2002,19(6):981-984
中文关键词  遗传算法  交叉策略  逼近
英文关键词  genetic algorithms  crossover strategy  approximation
基金项目  
作者单位E-mail
陈小平 苏州大学 通信与电子工程系, 苏州 215021 chenxp26@publicl.sz.js.cn  
石　玉 南京航空航天大学 测试工程系, 南京 210016  
于盛林 南京航空航天大学 测试工程系, 南京 210016  
中文摘要
      介绍了遗传算法中一种新的交叉策略, 它利用逼近方法决定遗传算法中子代个体的位置. 采用这种交叉策略可以使子代快速地向更高适应度的区域移动, 实验数据说明使用这种交叉策略的遗传算法可以极大地提高算法获得最优解的速度.
英文摘要
      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.