Search - heuristic TSP

Search - heuristic TSP - List

[Software Engineering] SA-TSP DL : 0: Simulated Annealing (SA) is the oldest probabilistic meta-heuristic algorithm and one of the first algorithms having ability to avoid being trapped in local minima. It is inspired by the process of annealing in metallurgy. In this process a material is heated and slowly cooled into solid crystal state with minimum energy and larger crystal size to reduce defects in metallic structures. Once the system has cooled, the configuration will represent a sample at or close to a global optimum.
Date : 2025-12-22 Size : 2kb User : sorayya
[Software Engineering] WSPOOKA.ZIP DL : 0: Lin-Kernighan heuristic for the TSP and minimum weight perfect matching
Date : 2025-12-22 Size : 142kb User : Jone
[Software Engineering] HM-TSP DL : 0: Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers-Heuristic method for the Traveling Salesman Problem A number of nearest neighbour tours are generated randomly selected starting points. Each tour is improved by 2-opt heuristics (pairwise exchange of edges) and the best result is selected. function tspplot(p,X,nodenum) #ok TSPPLOT Plot 2D tour TSPPLOT(P,X), P is the tour and X is the coordinate matrix TSPPLOT(P,X,1) also adds node numbers
Date : 2025-12-22 Size : 2kb User : ahmed