| 引用本文: | 莫鸿强,罗 飞,毛宗源.遗传算法的全局快速寻优[J].控制理论与应用,2002,19(5):809~811.[点击复制] |
| MO Hong-qiang,LUO Fei,MAO Zong-yuan.On global rapid optimum seeking of GAs[J].Control Theory and Technology,2002,19(5):809~811.[点击复制] |
|
| 遗传算法的全局快速寻优 |
| On global rapid optimum seeking of GAs |
| 摘要点击 1473 全文点击 1924 投稿时间：2000-06-13 修订日期：2001-09-20 |
| 查看全文 查看/发表评论 下载PDF阅读器 |
| DOI编号 |
| 2002,19(5):809-811 |
| 中文关键词 遗传算法 模式 全局优化 |
| 英文关键词 genetic algorithms schemata global optimization |
| 基金项目 国家自然科学基金(69864001)资助项目. |
|
| 中文摘要 |
| 分析了遗传算法的全局快速搜索能力, 指出“前t代群体”中包含至少一个位置等价非重叠模式完全集是可靠地进行全局搜索的保证; 而生成适应度值差别大的完全集是缩小搜索范围的起点, 这些模式的阶数越低, 就能越早开始缩小搜索范围, 对算法全局快速寻优也就越有利. |
| 英文摘要 |
| Global rapid optimum seeking of GAs is analyzed in this paper. It is pointed out that in order to make a guaranteed global search, the population of the first t generations (PFtG) should contain at least one same-defining-position-unlapped-exhaustive (SDPUE) set. It is also pointed out that an SDPUE set whose schemata are disparity in average fitness should be included in the PFtG before the searching space can be reduced, and the lower the order of these schemata is, the earlier the search-space reduction begins. |
|
|
|
|
|