| 旅行商问题(TSP)的现代优化算法研究 |
| |
| 引用本文： | 蔡晨晓,漆宇星.旅行商问题(TSP)的现代优化算法研究[J].舰船电子工程,2008,28(12). |
| |
| 作者姓名： | 蔡晨晓 漆宇星 |
| |
| 作者单位： | 南京理工大学自动化学院,南京,210094 |
| |
| 摘 要： | TSP(Traveling Salesman Problem)旅行商问题是一类典型的NP完全问题,遗传算法是解决NP问题的一种较理想的方法.通过介绍基本遗传算法的基本原理;针对TSP问题,给出遗传算法在选择算子、交叉算子和变异算子等方面的编码实现.并就TSP问题的一个具体城市算例,进行了计算验证.在此基础上,对交叉算子和变异算子提出了改进,大量的计算数据验证了改进方法的有效性.
|
| 关 键 词： | 遗传算法 |
Modern Optimization of Traveling Salesman Problem |
| |
| Cai Chenxiao,Qi Yuxing.Modern Optimization of Traveling Salesman Problem[J].Ship Electronic Engineering,2008,28(12). |
| |
| Authors: | Cai Chenxiao Qi Yuxing |
| |
| Institution: | Cai Chenxiao Qi Yuxing(Institute of Automation,Nanjing University of Science , Technology,Nanjing 210094) |
| |
| Abstract: | TSP(Traveling Salesman Problem) is a kind of typical NP problems.GA(Genetic Algorithm) is a better method for NP problems.The paper presnets the basic principles of the GA,and introducts coding in the selection operator,crossover operator and mutation operator about genetic algorithm for the specific TSP.The calculation is verified for TSP problem on a specific city example.And on the basis,the improvements is proposed for selection operator,crossover operator and mutation operator,and a large number of cal... |
| |
| Keywords: | TSP |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
