| 改进型遗传蚁群混合算法求解旅行商问题 |
| |
| 引用本文： | 黄明,王聪,梁旭. 改进型遗传蚁群混合算法求解旅行商问题[J]. 大连铁道学院学报, 2011, 0(2): 86-88,100 |
| |
| 作者姓名： | 黄明 王聪 梁旭 |
| |
| 作者单位： | 大连交通大学软件学院; |
| |
| 摘 要： | 针对原有遗传蚁群混合算法的遗传算法特性不突出,容易过早收敛的缺陷,提出一种带有基因数量控制的遗传蚁群混合算法,有效地提高了遗传算法部分的基础基因数量,提高了全局最优解能力.通过动态分析基因适应度,生成动态变异概率,提高了最优解的生成概率.精英交叉原理的使用,能保护优秀基因不受交叉变异的影响堕化.
|
| 关 键 词： | 蚁群算法 遗传算法 TSP 动态变异概率 精英交叉 |
Improved Gene Volume Control Hybrid Ant Colony Genetic Algorithm For Traveling Salesman Problem |
| |
| HUANG Ming,WANG Cong,LIANG Xu. Improved Gene Volume Control Hybrid Ant Colony Genetic Algorithm For Traveling Salesman Problem[J]. Journal of Dalian Railway Institute, 2011, 0(2): 86-88,100 |
| |
| Authors: | HUANG Ming WANG Cong LIANG Xu |
| |
| Affiliation: | HUANG Ming,WANG Cong,LIANG Xu(Software Institute,Dalian Jiaotong University,Dalian 116028,China) |
| |
| Abstract: | To overcome the problems of non-prominence and easiness to premature convergence,an improved gene volume control hybrid ant colony genetic algorithm is proposed to improve effectively the number of genetic basis and the ability to generate the global optimal solution.The generating dynamic mutation probability with dynamic analysis of genetic fitness also can improve the ability to generate the global optimal solution.Using the principles of elite cross can protect the good genes from the deterioration made... |
| |
| Keywords: | ant colony algorithm genetic algorithm TSP dynamic mutation probability elite cross |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
