Location:
Search - tsp NN
Search list
Description: 用模拟退火算法求解TSP问题-simulated annealing algorithm for TSP
Platform: |
Size: 2048 |
Author: 吴晟祖 |
Hits:
Description: AI-NN-PR Matlab
Used MATLAB language. 33 cities in the ant algorithm. Solve the TSP problem.
-AI-NN-PR Matlab
Used MATLAB language. 33 cities in the ant algorithm. Solve the TSP problem.
Platform: |
Size: 2048 |
Author: esse |
Hits:
Description: tsp problem, nn algorithm
Platform: |
Size: 2048 |
Author: Franco Setti |
Hits:
Description: 旅行商问题（TSP）的最近邻（NN）算法
近邻算法产生不同的结果，取决于选择哪个城市作为起点。此功能决定近邻路线为多个出发点，并返回这些航线的最佳。
-TSP_NN Traveling Salesman Problem (TSP) Nearest Neighbor (NN) Algorithm
The Nearest Neighbor algorithm produces different results depending on which city is selected as the starting point. This function determines the Nearest Neighbor routes for multiple starting points and returns the best of those routes
Platform: |
Size: 3072 |
Author: fuwalinzi |
Hits:
Description: 用人工神经网络方法解决TSP旅行商问题的matlab源代码-matlab codes for TSP problem using NN
Platform: |
Size: 5120 |
Author: yyh |
Hits:
Description: Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007).-Nearest Neighbour algorithm for a TSP with 7 cities. The solution changes as the starting point is changed
The nearest neighbour (NN) algorithm (a greedy algorithm) lets the salesperson choose the nearest unvisited city as his next move. This algorithm quickly yields an effectively short route. For N cities randomly distributed on a plane, the algorithm on average yields a path 25 longer than the shortest possible path.[17] However, there exist many specially arranged city distributions which make the NN algorithm give the worst route (Gutin, Yeo, and Zverovich, 2002). This is true for both asymmetric and symmetric TSPs (Gutin and Yeo, 2007).
Platform: |
Size: 4096 |
Author: ahmed |
Hits: