| 一种多精英保存策略的遗传算法 |
| |
| 引用本文： | 朱灿,梁昔明.一种多精英保存策略的遗传算法[J].计算机应用,2008,28(4):939-941. |
| |
| 作者姓名： | 朱灿 梁昔明 |
| |
| 作者单位： | 1. 中南大学,信息科学与工程学院,长沙,410083;长沙理工大学,计算机与通信工程学院,长沙,410076
2. 中南大学,信息科学与工程学院,长沙,410083 |
| |
| 基金项目： | 国家重点基础研究发展规划(973计划) |
| |
| 摘 要： | 根据种子到当前最优点的距离将种群分成两部分，小于或等于某一自适应距离值的种子归入当前最优种群，大于该距离值的次优种子形成次优种群集合。对此两个种群分别按照不同的进化策略协同进化并重组。通过界定最优种群边界来提高遗传算法局部搜索能力，通过对次优种群自适应变异，比较好地平衡种群的“选择压力”和“种群多样性”。数值结果表明了本方法的有效性和稳定性。
|
| 关 键 词： | 遗传算法 多精英保存 种群保存 进化策略 自适应变异 |
| 文章编号： | 1001-9081(2008)04-0939-03 |
| 收稿时间： | 2007-10-16 |
| 修稿时间： | 2007年10月15 |
Novel genetic algorithm with multi-elitist preservation method |
| |
| ZHU Can,LIANG Xi-ming.Novel genetic algorithm with multi-elitist preservation method[J].journal of Computer Applications,2008,28(4):939-941. |
| |
| Authors: | ZHU Can LIANG Xi-ming |
| |
| Affiliation: | ZHU Can1,2,LIANG Xi-ming1(1.College of Information Science , Engineering,Central South University,Changsha Hunan 410083,China,2.School of Computer & Communication Engineering,Changsha University of Science & Technology,Changsha Hunan 410076,China) |
| |
| Abstract: | A novel genetic algorithm with several elitists preserved was proposed.The population was divided into two parts according to the distances between individuals and the current individual.One was the optimal population of current generation,and the other aggregated hypo-opt individuals.This method can enhance local searching performance by bounding constrained optimal population and can raise the population diversity by introducing self-adaptive mutation probability in hypo-opt population.Some numerical test... |
| |
| Keywords: | genetic algorithms multi-elitists preservation population division evolution strategy adaptive mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用》浏览原始摘要信息 |
|
点击此处可从《计算机应用》下载全文 |
|
