| 演化算法时间复杂性的趋势条件 |
| |
| 引用本文： | 何军,姚新,康立山. 演化算法时间复杂性的趋势条件[J]. 软件学报, 2001, 12(12): 1775-1783 |
| |
| 作者姓名： | 何军 姚新 康立山 |
| |
| 作者单位： | 1. 伯明翰大学计算机学院,伯明翰,B15,2TT,
2. 武汉大学软件工程国家重点实验室, |
| |
| 基金项目： | Supported by the National Natural Science Foundation of China under Grant Nos. 60133010, 60073043 and 70071042 (国家自然科学基金);the Research Foundation of the State Key Laboratory of Software Engineering at Wuhan University of China (武汉大学软件工程国） |
| |
| 摘 要： | 计算时间复杂性是演化理论中的一个重大课题.将趋势分析引入演化算法的平均时间复杂性分析,可用于很广一类演化算法及许多问题.基于趋势分析,研究了确定演化算法时间复杂性的一些有用的趋势条件.这些条件应用于完全欺骗问题以验证其有效性.
|
| 关 键 词： | 演华算法 时间复杂性 Markov链 组合优化 |
| 文章编号： | 1000-9825/2001/12(12)1775-09 |
| 收稿时间： | 2000-09-11 |
| 修稿时间： | 2000-09-11 |
Drift Conditions for Time Complexity of Evolutionary Algorithms |
| |
| HE Jun,YAO Xin and KANG Li-shan. Drift Conditions for Time Complexity of Evolutionary Algorithms[J]. Journal of Software, 2001, 12(12): 1775-1783 |
| |
| Authors: | HE Jun YAO Xin KANG Li-shan |
| |
| Abstract: | 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. |
| |
| Keywords: | evolutionary algorithms time complexity Markov chain combinatorial optimisation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《软件学报》浏览原始摘要信息 |
|
点击此处可从《软件学报》下载全文 |
