期刊文献+

关于漂移分析的注记

Note on drift analysis
下载PDF
导出
摘要 进化算法成功应用于求解各种复杂优化问题,其理论研究尚处于初级阶段。时间复杂性分析可以估计算法的平均运行时间,是进化算法理论研究中的重要方向和有力工具。讨论了漂移分析和进化算法时间复杂性的关系,利用吸收马尔科夫链给出漂移定理的一个新的证明;用一步平均漂移估计算法计算时间,得到了线性函数进化算法时间复杂度的一个一般性的结果。这些结果有助于更好地理解进化算法的工作原理和性能。 In spite of many successful applications of evolutionary algorithms in various complicated optimization problems, the rigorous theoretical analyses of EAs are still in their infant period. The running time of an evolutionary algorithm for combination optimization problem is an important topic in theoretical study of EAs. This paper discusses the relation between drift analysis and evolutionary algorithms' time complexity. It gives a new proof of the drift theorem. It also uses drift theorem to estimate the expected runtime of global ( 1 + 1 ) for linear function. The result is a better understanding of the performance of evolutionary algorithms.
出处 《计算机工程与应用》 CSCD 2012年第8期21-23,27,共4页 Computer Engineering and Applications
基金 国家自然科学基金(No.61165003 61170081 60873078) 广东省自然科学基金(No.9251064101000010)
关键词 进化算法 时间复杂性 漂移分析 evolutionary algorithms time complexity drift analysis
  • 相关文献

参考文献19

  • 1- Eiben A E, Rudolph G.Theory of evolutionary algorithms: a bird' s eye view[J].Theoretical Computer Science, 1999,229(1/2) :3-9.
  • 2Beyer H G, Schwefel H P, Wegener I.How to analyse evolutionary algorithms[J].Theoretical Computer Science, 2002,287 ( 1 ) : 101-130.
  • 3Goldberg D E.Genetic algorithms in search, optimization and machine learning[M].Boston,MA,USA.-Addison Wesley, 1989.
  • 4Holland J H.Adaptation in natural and artificial systems[M]. Ann Arbor:University of Michigan Press, 1975.
  • 5Nix A E, Vose M D.Modeling genetic algorithms with Markov chains[J].Annals of Mathematics and Artificial Intelligence, 1992,5(1):79-88.
  • 6Rudolph G.How mutation and selection solve long path problems in polynomial expected time[J].Evolutionary Computation, 1996,4(2) : 194-205.
  • 7Gamier J, KaUel L, Schoenauer M.Rigomus hitting times for binary mutations[J].Evolutionary Computation, 1999,7(2) : 167-203.
  • 8Droste S, Jansen T, Wegener I.On the optimization of unimodal functions with the ( 1 + 1 ) evolutionary algorithm[C]//LNCS 1498: Proc of the 5th Conf on Parallel Problem Solving from Nature (PPSN V), 1998:13-22.
  • 9Droste S,Jansen T,Wegener I.On the analysis of the(1+1)- evolutionary algorithm[J].Theoretical Computer Science,2002,276 (1/2) :51-81.
  • 10Wegener 1, Witt C.On the analysis of a simple evolutionary algorithm on quadratic pseudo-Boolean function[J].Journal of Discrete Algorithm,2005(3) :61-78.

共引文献2

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部