Search - heuristic TSP

Search - heuristic TSP - List

[Algorithm] Lin-Kernighan-heuristic-for-the-TSP-and-minimum-w DL : 0: Lin-Kernighan heuristic for the TSP
Date : 2025-12-22 Size : 1.77mb User : Tom
[Algorithm] TSP DL : 0: TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
Date : 2025-12-22 Size : 2kb User : Testy Tum
[Algorithm] TSP-Heuristics DL : 0: Another version of TSP Travelling Salesman Problem Heuristic. We included the MST-Heuristik (Minimum Spaning Tree) as well as the Christofides-Heuristik. Both solve the TSP Problem.
Date : 2025-12-22 Size : 2kb User : Testy Tum
[Algorithm] TspSolver DL : 0: TSP Solver is a very intuitive and user-friendly program that demonstrates two common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory. For a brief description of the TSP, along with a quick reference to the solution methods addressed here, you can have a look at the TSP.pdf that is included. The user is able to the number of the graph nodes, load random distance values or even load or save the values to a file. He can the Heuristic Algorithm or even the computationally unrealistic Exhaustive Algorithm. At the end of the execution of the selected algorithm, they are shown the time in seconds and the estimated flops (floating point operations) used for the calculation. The results can be added to a result list and according to them, they are drawn useful graphics that help the user to understand and study better the solution to the problem and its results.-TSP Solver is a very intuitive and user-friendly program that demonstrates two common ways of solving the TSP (Traveling Salesman Problem) of the Graph Theory. For a brief description of the TSP, along with a quick reference to the solution methods addressed here, you can have a look at the TSP.pdf that is included. The user is able to the number of the graph nodes, load random distance values or even load or save the values to a file. He can the Heuristic Algorithm or even the computationally unrealistic Exhaustive Algorithm. At the end of the execution of the selected algorithm, they are shown the time in seconds and the estimated flops (floating point operations) used for the calculation. The results can be added to a result list and according to them, they are drawn useful graphics that help the user to understand and study better the solution to the problem and its results.
Date : 2025-12-22 Size : 538kb User : suwardee
[Algorithm] LKH-2.0.2 DL : 0: K Helsgaun s Lin-kernighan heuristic implementation for traveling salesman problems, one of the best TSP solver. Pure C implementation.
Date : 2025-12-22 Size : 802kb User : Liu