| 遗传算法在旅行商问题中的实践与探究 |
| |
| 作者单位： | 江苏电大武进学院 |
| |
| 摘 要： | TSP问题是组合优化领域的经典问题之一,旨在求出遍历若干个城市的最短路径。本文通过遗传算法GA的选择和变异算子的确定和、交叉算子的改进,并在TSP问题中的实践来探索这个经典的NP(Nondeterministic Polynomial)难题。
|
| 关 键 词： | 旅行商问题 遗传算法 |
Traveling Salesman Problem Solution Using Genetic Algorithms |
| |
| Authors: | Tang Ying |
| |
| Abstract: | Traveling Salesman Problem is one of combinatorial optimization f ield classical problems. The purpose is seeking out the shortest paths between each cities when traversing all the cities one time. Traveling salesman problem is soluted using Genetic Algorithms in this paper. Some practice and exploration for Traveling Salesman Problems is conducted. |
| |
| Keywords: | traveling salesman problem genetic algorithm |
| 本文献已被 CNKI 等数据库收录！ |
