| Title | Program | Version | Remarks | Author |
|---|---|---|---|---|
| State-of-the-Art | ||||
| LKH | C | 2.0.2 | An effective implementation of the Lin-Kernighan heuristic | Keld Helsgaun |
| Concorde | C | 03.12.19 | The concorde TSP solver & Chained Lin-Kernighan (CLK) | William Cook |
| MAOS_TSP | JAVA | m01.00.02 | Multiagent Optimizer with Generalized Edge Assembly Crossover [DOC] | Xiao-Feng Xie |
| Miscellaneous | ||||
| CDT | Fortran | 1995 | A branch-and-bound algorithm for asymmetric TSP | M. Dell'Amico et al |
| TSP1&2 | PASCAL | 1.2 | Solving TSP with 1-tree Relaxation | ORSEP |
| SA_TSPt | Matlab | Rev1.0 | A GUI for sovling TSP using Simulated Annealing (SA) | Aravind Seshadri |
| TSPUNIX | C | 1997 | Algorithm based on the outline of (Lin, 1965) for unix | K. L. Dunn |
| DP_TSP | C | - | Dynamic Programming Code for the TSP | Neil Simonetti |
| LK | C | 0.5.0 | Lin-Kernighan heuristic for the TSP and minimum weight perfect matching | David Neto |
| SA-TSP | C | 1996 | Simulated annealing (SA) for the Symmetric Euclidean TSP | Lionnel Maugis |
| ACOTSP | C | 1.3.6 | Ant Colony Optimization (ACO) applied to the symmetric TSP | Thomas Stützle |
| PSO-TSP | C | - | Particle Swarm Optimization (PSO) for the TSP | Maurice Clerc |
| GATSS | C++ | - | Genetic Algorithm (GA) based solver for the Traveling Salesman Problem | Thomas Pederson |
| Tsp_Solve | C++ | 1.0 | Various operators for the Travelling Salesman Problem | Chad Hurwitz |
| GA_TSP | C# | 2006 | Genetic Algorithms (GA) with a greedy crossover | Michael LaLena |