The Travelling Salesman Problem: a 2-opt solution

G. Raimondon. The Traveling Salesman Problem. Technical Report June, ROSE, Ecole Politechnique Federale de Lausanne, Ecoublens, CH-1015, Switzerland, 2005.


This tech report contains a technical solution for the TSP (Travelling Salesman Problem). The solution of the problem requires an algorithm that is computationally heavy. This paper describe the implementation of the 2-opt solution that is able to find a local minima of the problem that reduces drammatically the number of the computations required.

Leave a Reply