Search - tsp NN

Search - tsp NN - List

[AI-NN-PR] TSP111 DL : 0: 用模拟退火算法求解TSP问题-simulated annealing algorithm for TSP
Date : 2025-07-13 Size : 2kb User : 吴晟祖
[AI-NN-PR] matlab-ant-tsp DL : 0: 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.
Date : 2025-07-13 Size : 2kb User : esse
[matlab] tsp DL : 0: tsp problem, nn algorithm
Date : 2025-07-13 Size : 2kb User : Franco Setti
[matlab] tsp_nn DL : 0: 旅行商问题（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
Date : 2025-07-13 Size : 3kb User : fuwalinzi
[AI-NN-PR] NN_TSP DL : 0: 用人工神经网络方法解决TSP旅行商问题的matlab源代码-matlab codes for TSP problem using NN
Date : 2025-07-13 Size : 5kb User : yyh
[Software Engineering] Traveling-Salesman-Problem---Nearest-Neighbor DL : 0: 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).
Date : 2025-07-13 Size : 4kb User : ahmed