Search - TSP LOCAL

Search - TSP LOCAL - List

[AI-NN-PR] 2opt DL : 0: 求解tsp问题的局部优化算法-the local optimization algorithm
Date : 2025-12-30 Size : 44kb User : 曲晓威
[AI-NN-PR] 优化TSP局部搜索法 DL : 0: TSP算法，应用局部搜索法得到最优路径，已经经过优化。没有密码，可以使用，vc环境下使用。-TSP algorithm, using local search to be optimal path has been optimized. No password can be used, vc environments.
Date : 2025-12-30 Size : 1.29mb User : 霍哲
[AI-NN-PR] 1 DL : 0: 用禁忌算法求解tsp（旅行商问题）具有速度快，收敛性好，不易陷入局部最优解等特点-Algorithm with the taboo tsp (TSP) has fast convergence, and not easily trapped into local optimal solution, etc.
Date : 2025-12-30 Size : 965kb User : 张聪誉
[AI-NN-PR] particle_swarm_optimization1 DL : 0: 用局部最优探索算法求解tsp问题。。。matlab编写。附有城市坐标用于检验。 -Using local optimization algorithm to explore the issue tsp. . . matlab prepared. Coordinate with the city for inspection.
Date : 2025-12-30 Size : 3kb User : 何金深
[AI-NN-PR] memetic_for_TSP DL : 0: TSP问题是组合优化中的经典问题。其解决方法有局部优化方法和一些启发式算法,局部搜索方法充分考虑问题的邻域结构,遗传算法有很好的全局搜索能力,memetic算法把遗传算法和局部优化算法相结合,试验结果证明,能很好地解决TSP问题。-TSP problem is a classic combinatorial optimization problem. Its solution has a number of local optimization methods and heuristic algorithms, local search methods take full account of the issue of neighborhood structure, genetic algorithm has good ability of global search, memetic algorithm for the genetic algorithm and local optimization algorithm combining test results proved that well positioned to solve the TSP problem.
Date : 2025-12-30 Size : 100kb User : 文龙
[AI-NN-PR] Anadaptiveantcolonyalgorithmanditssimulation DL : 0: 蚁群算法是一种新型的进化算法，蚁群算法与其它进化算法同样存在易于限于局部最小点等缺陷．本文提出一种自适应的蚁群算法雌克服上述缺陷。通过自适应地改变算法的挥发度等系数，本文中的算法可以在保证收敛速度的条件下提高解的全局性，通过对TSP问题的仿真证明本文中的算法相对与原始的蚁群算法收敛速度和解的性能椭一定的提高．-Ant colony algorithm is a new evolutionary algorithm, evolutionary algorithm ant colony algorithm also exists with other local minimum points, and so easy to be limited to defects. This paper presents an adaptive ant colony algorithm to overcome these defects in the female. Adaptive algorithm by changing the coefficient of volatility, etc., this algorithm can guarantee the convergence of the conditions to improve the overall solution, the problem through the TSP simulation shows the algorithm in this article relative to the original ant colony algorithm convergence rate reconciliation, to improve the performance of certain ellipsoid.
Date : 2025-12-30 Size : 338kb User : lifei
[AI-NN-PR] GFLS-TSP DL : 0: A paper of Guided Local Search
Date : 2025-12-30 Size : 773kb User : Abdullah
[AI-NN-PR] hopfield DL : 0: TSP问题，是一个多局部最优的最优化问题：有n个城市，一个推销员要从其中某一个城市出发，唯一走遍所有的城市，再回到他出发的城市，求最短的路线。-TSP, is more than one local optimum optimization problem: There are n cities, where a salesman one city starting only traveled all the cities, and then returned to his departure city, seeking the shortest route.
Date : 2025-12-30 Size : 13kb User : 梁超
[AI-NN-PR] TSP DL : 0: TSP问题，是一个多局部最优的最优化问题：有n个城市，一个推销员要从其中某一个城市出发，唯一走遍所有的城市，再回到他出发的城市，求最短的路线。-TSP, is more than one local optimum optimization problem: There are n cities, where a salesman one city starting only traveled all the cities, and then returned to his departure city, seeking the shortest route.
Date : 2025-12-30 Size : 2kb User : 梁超