Comparing Algorithms for the Traveling Salesman Problem
Wolfram Demonstrations Project · 2008
The traveling salesman problem (TSP) is an NP-complete problem. Different approximation algorithms have their advantages and disadvantages. Mathematicas function FindShortestTour offers a choice of four methods (OrZweig OrOpt TwoOpt CCA) which may yield identical results. This Demonstration provides another TSP algorithm called 3-Opt. Experiments show that the 3-Opt algorithm sometime;