作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2009, Vol. 35 ›› Issue (15): 203-205. doi: 10.3969/j.issn.1000-3428.2009.15.071

• 人工智能及识别技术 • 上一篇    下一篇

遗传算法中模式的竞争度研究

汪 彤,李云强   

  1. (解放军信息工程大学电子技术学院,郑州 450004)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2009-08-05 发布日期:2009-08-05

Research on Mode Competitive Degree in Genetic Algorithm

WANG Tong, LI Yun-qiang   

  1. (Electronic Technique Institute, PLA Information Engineering University, Zhengzhou 450004)
  • Received:1900-01-01 Revised:1900-01-01 Online:2009-08-05 Published:2009-08-05

摘要:

针对Goldberg提出的利用竞争模式对欺骗问题进行度量所存在的弊端,提出模式竞争度的度量新方法,定义竞争函数及竞争度,给出模式竞争度的性质,证明模式竞争度和重要模式之间的关系,利用模式竞争度对2个典型的模式欺骗性与GA欺骗性不符的函数的遗传算法运行机理做了合理解释,表明模式竞争度作为新度量方法的合理性。

关键词: 模式, 竞争函数, 竞争度

Abstract: Aiming at for the disadvantages of using competitive mode to analyze deceptive functions which is promoted by Goldberg, this paper gives a new measuring method from a new angle. It defines competitive function and competitive degree, gives some characteristics of it, proves the connections between competitive degree and important mode, and by using competitive degree rationally explains how the Genetic Algorithm(GA) solves two representative functions which mode deception is not in correspond with GA’s deception. It proves that competitive degree as a new measuring method is rational.

Key words: mode, competitive function, competitive degree

中图分类号: