| 基于遗传算法的多旅行商问题研究 |
| |
| 引用本文： | 王海龙,周辉仁,郑丕谔,唐万生.基于遗传算法的多旅行商问题研究[J].计算机应用研究,2009,26(5):1726-1728. |
| |
| 作者姓名： | 王海龙 周辉仁 郑丕谔 唐万生 |
| |
| 作者单位： | 天津大学,系统工程研究所,天津,300072 |
| |
| 摘 要： | 针对所有旅行商路径总和最小为优化标准的多旅行商一类问题，用遗传算法优化，并提出了矩阵解码方法。对距离非对称的多旅行商问题的实例进行了仿真，并对不同交叉算子性能进行了比较。结果表明，该算法是有效的，适用于距离对称和非对称的多旅行商问题求解。
|
| 关 键 词： | 遗传算法 多旅行商问题 优化 解码方法 |
Study on multiple traveling salesman problem based on genetic algorithm |
| |
| WANG Hai-long,ZHOU Hui-ren,ZHENG Pi-e,TANG Wan-sheng.Study on multiple traveling salesman problem based on genetic algorithm[J].Application Research of Computers,2009,26(5):1726-1728. |
| |
| Authors: | WANG Hai-long ZHOU Hui-ren ZHENG Pi-e TANG Wan-sheng |
| |
| Affiliation: | (Institute of Systems Engineering, Tianjin University, Tianjin 300072, China) |
| |
| Abstract: | In order to solve MTSP(multiple traveling salesman problem) that employed total-path-shortest as the evaluating rule,this paper used genetic algorithm to optimize it and proposed decoding method with matrix.Simulated asymmetric multiple traveling salesman problems using the different crossover operators.The results suggest that this method is efficient.It is fit for solving symmetric and asymmetric multiple traveling salesman problems. |
| |
| Keywords: | genetic algorithm multiple traveling salesman problem optimization decoding method |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《计算机应用研究》浏览原始摘要信息 |
|
点击此处可从《计算机应用研究》下载全文 |
|
