| 解决背包问题的改进遗传算法 |
| |
| 引用本文： | 杨泽星,雍正正,俞敏,杨锐. 解决背包问题的改进遗传算法[J]. 深圳大学学报(理工版), 2006, 23(2): 128-132 |
| |
| 作者姓名： | 杨泽星 雍正正 俞敏 杨锐 |
| |
| 作者单位： | 深圳大学信息工程学院,深圳,518060 |
| |
| 摘 要： | 提出一种改进的基于进步数的变异遗传算法,提出用进步数这个概念表征遗传算法的收敛程度和指导染色体变异.该算法以精英种子进行固定有代表性的变异和基于进步数的自适应变异,能根据进步数跳出局部最优,避免早熟.通过测试函数和背包问题进行实验,实验表明,该算法全局寻优和收敛性良好.
|
| 关 键 词： | 进步数 遗传算法 优劣树 背包问题 |
| 文章编号： | 1000-2618(2006)02-0128-05 |
| 收稿时间： | 2005-10-09 |
| 修稿时间： | 2006-01-10 |
Mutated genetic algorithm based-on advanced number solving KP |
| |
| YANG Ze-xing,YONG Zheng-zheng,YU Min,YANG Rui. Mutated genetic algorithm based-on advanced number solving KP[J]. Journal of Shenzhen University(Science &engineering), 2006, 23(2): 128-132 |
| |
| Authors: | YANG Ze-xing YONG Zheng-zheng YU Min YANG Rui |
| |
| Affiliation: | College of Information Engineering Shenzhen University Shenzhen 508060 P. R. China |
| |
| Abstract: | A new mutated genetic algorithm based-on advance number(MGA_BA) was proposed by introducing a concept of advance number,which could represent the convergence condition of population and help the chromosome mutate adaptively.With typical sampling(mutating) of the best individual and adaptation based on advance number,this algorithm could escape local optimization and avoid prematurity.Experiment results of numerical function and knapsack problem demonstrate that MGA_BA has a good performance in global search and convergence. |
| |
| Keywords: | advance number genetic algorithm tree ordered by fitness knapsack problem |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
