%0 Journal Article
%T Drift Conditions for Time Complexity of Evolutionary Algorithms<br>演化算法时间复杂性的趋势条件
%A HE Jun
%A YAO Xin
%A KANG Li-shan
%A <br>何军
%A 姚新
%A 康立山
%J 软件学报
%D 2001
%I 
%X The computational time complexity is an important topic in the theory of evolutionary algorithms. This paper introduces drift analysis into analysing the average time complexity of evolutionary algorithms, which are applicable to a wide range of evolutionary algorithms and many problems. Based on the drift analysis, some useful drift conditions to determine the time complexity of evolutionary algorithms are studied. These conditions are applied into the fully deceptive problem to verify their efficiency.
%K evolutionary algorithms
%K time complexity
%K Markov chain
%K combinatorial optimisation<br>演华算法
%K 时间复杂性
%K Markov链
%K 组合优化
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=7735F413D429542E610B3D6AC0D5EC59&aid=365A96A66E4E9582&yid=14E7EF987E4155E6&vid=59906B3B2830C2C5&iid=59906B3B2830C2C5&sid=AE8A2F3A47BD276F&eid=5B3A9A8E2DA941E3&journal_id=1000-9825&journal_name=软件学报&referenced_num=1&reference_num=18