Search - TSP LOCAL

Search - TSP LOCAL - List

[matlab] ACO---pso-MTSP- DL : 0: 基于蚁群—粒子群的TSP求解，可以解决蚁群算法陷入局部最优解的问题，更好求出TSP问题-Based on ACO- pso MTSP solving the problem can be solved ant colony algorithm into local optimal solution, obtaining better TSP problem
Date : 2025-12-30 Size : 8kb User : tong
[matlab] ACATSP DL : 0: 蚁群算法是一种分布式内在并行算法。单个蚂蚁的搜索过程是彼此独立的，易于局部最优，通过个体间不断的信息交流和传递有利于发现较好解；并且该算法是一种正反馈算法。路径上的信息素浓度较高，将吸引更多的蚂蚁沿这条路径运动，又使得信息素浓度增加，加快了算法的进化过程。本文通过求解TSP问题，通过在特定情况下对路径进行逐步遍历比较来降低陷入局部最优解的可能性, 找出最优解。-Ant colony algorithm is an inherent distributed parallel algorithm. Single ant search process is independent of each other, easy local optimum, through continuous exchange of information between individuals and found in favor of passing a good solution and the algorithm is a positive feedback algorithm. The higher the concentration of the pheromone on the path, it will attract more ants motion along this path, but also makes the pheromone concentration, speed up the evolutionary process of the algorithm. By solving the TSP, under certain circumstances by stepwise traversal path into comparison to reduce the possibility of local optimal solution, to find the optimal solution.
Date : 2025-12-30 Size : 2kb User : 和数天
[matlab] TSP-pso DL : 0: 自适应离散粒子群算法求解TSP问题，包含有三个基本实例，其中含扰动变量可防止陷入局部最优-Adaptive particle swarm optimization for TSP, contains three basic example, which prevents the disturbance variable containing local optimum
Date : 2025-12-30 Size : 4kb User : 冬冬东
[matlab] 基于遗传算法的 TSP 算法 DL : 0: tsp问题（全称：TravellingSalesmanProblem），又称为旅行商问题、货郎担问题、TSP问题，是一个多局部最优的最优化问题，遗传算法是一种基于种群演变一种优化的算法，在此基础上的优化程序会自动寻找出最短路(TSP (full name: TravellingSalesmanProblem), also known as the traveling salesman problem, traveling salesman problem, but TSP problem is an optimization problem of multi local optimum, genetic algorithm is an optimization algorithm based on the evolution of a population, on the basis of the optimization program will automatically find the shortest path)
Date : 2025-12-30 Size : 143kb User : 淡然踏歌
[matlab] Ga_tsp DL : 0: TSP问题（旅行商问题），用遗传算法解决TSP问题，得到问题的最优解，是局部最优解。(TSP problem (traveling salesman problem), using genetic algorithm to solve TSP problem, get the optimal solution of the problem, is the local optimal solution.)
Date : 2025-12-30 Size : 13kb User : yaru