计算机工程与应用 ›› 2010, Vol. 46 ›› Issue (12): 46-49.DOI: 10.3778/j.issn.1002-8331.2010.12.012

• 研究、探讨 • 上一篇    下一篇

一种新型遗传算法

刘 峰1,左晓静2,张 坤1   

  1. 1.南阳师范学院 计算机与信息工程学院,河南 南阳 473000
    2.漯河职业技术学院 计算机工程系,河南 漯河 462000
  • 收稿日期:2009-12-01 修回日期:2010-02-22 出版日期:2010-04-21 发布日期:2010-04-21
  • 通讯作者: 刘 峰

Novel genetic algorithm

LIU Feng1,ZUO Xiao-jing2,ZHANG Kun1   

  1. 1.School of Computer and Information Engineering,Nanyang Normal University,Nanyang,Henan 473000,China
    2.Department of Computer Science,Luohe Vocational and Technical College,Luohe,Henan 462000,China
  • Received:2009-12-01 Revised:2010-02-22 Online:2010-04-21 Published:2010-04-21
  • Contact: LIU Feng

摘要: 给出了一种基于拉马克学习和精英保留策略的新型遗传算法。设计了拉马克学习规则和拉马克遗传算法框架,给出了算法收敛性的数学证明,并利用测试函数与经典遗传算法进行了对比实验。实验结果表明,该算法具有较好的收敛性能和局部搜索能力,可以用于求解各种工程优化问题。

Abstract: A novel genetic algorithm based on Lamarck learning and the elite reservation strategy is given.The rule of Lamarck learning and structure of Lamarck genetic algorithm are designed,the convergence of the algorithm is analyzed,and experiments are done to validate the algorithm.Experimental result shows that the algorithm has the advantages of good convergence and local search ability.The algorithm can be used for solving optimization problems.

中图分类号: