| 基于改进遗传算法的TSP问题研究 |
| |
| 引用本文： | 周涛.基于改进遗传算法的TSP问题研究[J].微电子学与计算机,2006,23(10):104-106,110. |
| |
| 作者姓名： | 周涛 |
| |
| 作者单位： | 陕西理工学院,数学系,陕西,汉中,723000;西北工业大学,计算机学院,陕西,西安,710072 |
| |
| 基金项目： | 陕西理工学院校科研和教改项目 |
| |
| 摘 要： | 通过对遗传算法和TSP问题的研究．提出了离散赌轮选择算子EPMX交叉算子和Dmutation变异算子等，对遗传算法的各个算子进行了改进。利用改进的遗传算法有效的解决了TSP问题．实验验证其与传统的解决方式相比有更好的收敛特性，解的准确性更好。
|
| 关 键 词： | 旅行商问题 遗传算法 离散赌轮选择算子 EPMX交叉算子 Dmutation变异算子 |
| 文章编号： | 1000-7180（2006）10-0104-03 |
| 收稿时间： | 2006-04-28 |
| 修稿时间： | 2006-04-28 |
The Study of TSP Based on Improved Genetic Algorithm |
| |
| ZHOU Tao.The Study of TSP Based on Improved Genetic Algorithm[J].Microelectronics & Computer,2006,23(10):104-106,110. |
| |
| Authors: | ZHOU Tao |
| |
| Abstract: | In this paper, Genetic Algorithm and TSP were studied, Discrete Bet Wheel of Select operator, EPMX Crossover operator, Dmutation mutation operator were proposed, which is improve traditional three operators. TSP was resolved efficiently using this algorithm. Its merits, like as convergence, veracities are proved by experiment contrasted with traditional method. |
| |
| Keywords: | TSP GA Discrete bet wheel of select EPMX crossover Dmutation mutation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
