| 最优子种群实数编码遗传算法的研究 |
| |
| 引用本文： | 黄隽,谢俊. 最优子种群实数编码遗传算法的研究[J]. 徐州师范大学学报(自然科学版), 2005, 23(2): 53-56 |
| |
| 作者姓名： | 黄隽 谢俊 |
| |
| 作者单位： | 1. 镇江高等专科学校,数理系,江苏,镇江,212003
2. 江苏大学,机械工程学院,江苏,镇江,212013 |
| |
| 摘 要： | 提出了最优子种群实数编码遗传算法理论，通过从种群中选出适应值最高的若干数量的个体，组成该代最优子种群，将最优子种群中的个体与种群中其它个体进行交叉变异，最优子种群中的个体间也进行交叉变异，从而产生新的种群．该遗传算法对于示例中多极值的问题非常有效，收敛速度也非常快．
|
| 关 键 词： | 实数编码遗传算法 种群 最优 算法理论 收敛速度 个体 适应值 多极值 变异 交叉 示例 |
| 文章编号： | 1007-6573(2005)02-0053-04 |
| 修稿时间： | 2005-01-21 |
On Decimal Genetic Algorithm of Optimal Filial-population |
| |
| HUANG Jun,XIE Jun. On Decimal Genetic Algorithm of Optimal Filial-population[J]. Journal of Xuzhou Normal University(Natural Science Edition), 2005, 23(2): 53-56 |
| |
| Authors: | HUANG Jun XIE Jun |
| |
| Affiliation: | HUANG Jun 1,XIE Jun 2 |
| |
| Abstract: | A kind of new decimal genetic algorithm of optimal filial-population is put forward. A certain number of individuals with high fitness are chosen from the population for making up an optimal filial-population. Crossover and mutation are made between the individuals of the optimal filial-population and the other ones of the population, and also between the different inner ones of the filial-population. Then the next new population is produced. This genetic algorithm is very effective on multi-extremum programming and converges quickly. |
| |
| Keywords: | genetic algorithm optimal filial-population decimal code |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
