| 一种新的收敛于全局最优解的遗传算法 |
| |
| 引用本文： | 涂承媛,涂承宇.一种新的收敛于全局最优解的遗传算法[J].信息与控制,2001,30(2):116-119. |
| |
| 作者姓名： | 涂承媛 涂承宇 |
| |
| 作者单位： | 北京工业大学 |
| |
| 基金项目： | 北京市跨世纪优秀人才工程基金资助 |
| |
| 摘 要： | 提出了一种新遗传算法,其特点是增加了复原
、重构和录优等三种新操作,据以产生一组有界单调的适应度值数列,实现全局优选,在搜索
过程保持完备随机性的前提下收敛于全局最优解．文中列举了一些应用算例，以说明作者提
出的新遗传算法的优越性．
|
| 关 键 词： | 遗传算法 全局优选 复原操作 重构操作 录优操作 |
| 文章编号： | 1002-0411(2001)02-116-04 |
A NEW GENETIC ALGORITHM CONVERGING TO THE GLOBALLY-OPTIMAL SOLUTION |
| |
| TU Cheng-yuan,TU Cheng-yu.A NEW GENETIC ALGORITHM CONVERGING TO THE GLOBALLY-OPTIMAL SOLUTION[J].Information and Control,2001,30(2):116-119. |
| |
| Authors: | TU Cheng-yuan TU Cheng-yu |
| |
| Abstract: | A new genetic algorithm is developed, being remarked for the addition of three new operations: restoration, reconstruction and recording the better so as to create a limited monotonic fitness-value-sequence to realize the globally-optimal selection, and to converge to the globally-optimal solution within a thoroughly stochastic process. Also, two examples are given, illustrating the superiority of this new genetic algorithm developed by the authors. |
| |
| Keywords: | genetic algorithm globally-optimal selection restoration reconstruction recording the better |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《信息与控制》浏览原始摘要信息 |
|
点击此处可从《信息与控制》下载全文 |
|
