| 遗传算法的运行机理分析 |
| |
| 引用本文： | 恽为民,席裕庚.遗传算法的运行机理分析[J].控制理论与应用,1996,13(3):297-304. |
| |
| 作者姓名： | 恽为民 席裕庚 |
| |
| 作者单位： | 上海交通大学自动化系 |
| |
| 基金项目： | 国家自然科学基金,上海市自然科学基金 |
| |
| 摘 要： | 遗传算法是一种自适应启发工群体型迭代式全局搜索算法，正受到许多学科的重视。本文首先以函数优化为例分析了遗传算法的运行过程，然后着重探讨了遗传算法的全局收敛性和效率问题，提出了有效基因的新概念及有效基因突变操作，推导出每次遗传搜索产生Ｏ（２＾ｌ－１）数量级的新模式，最后给出了结论。
|
| 关 键 词： | 遗传算法 收敛性 机器学习 人工智能 |
| 收稿时间： | 1993/12/15 0:00:00 |
| 修稿时间： | 1995/3/30 0:00:00 |
The Analysis on Running Mechanism of Genetic Algorithm |
| |
| YUN Weimin and XI Yugeng.The Analysis on Running Mechanism of Genetic Algorithm[J].Control Theory & Applications,1996,13(3):297-304. |
| |
| Authors: | YUN Weimin and XI Yugeng |
| |
| Abstract: | Genetic algorithm(GA) is a kind of adaptive, heuristic, probabilistic and iterated searching algorithm, which has attracted many subjects. The architecture and running process of genetic algorithm are analyzed first as the example of function optimization in the paper, then, the global optimum and seaching efficiency are studied. The new concept of effective gene and effective gene mutation are proposed. The new schema produced during one.genetic operation are derived as O(2n-1). Finally, the conclusion is given. |
| |
| Keywords: | Genetic algorithm global optimum searching effciency |
| 本文献已被 CNKI 维普 等数据库收录！ |
| 点击此处可从《控制理论与应用》浏览原始摘要信息 |
|
点击此处可从《控制理论与应用》下载全文 |
|
