Generating subtour elimination constraints for the Traveling Salesman Problem

摘要

The traveling salesman problem (TSP) has commanded much attention from mathematicians and computer scientists specifically because it is so easy to describe and so difficult to solve. In this work we solved the Traveling Salesman Problem, with three different formulations, the formulation DFJ (Danzig-Fulkerson-Johnson), MTZ formulation (Miller-Tucker-Zemlin) and DL formulation (Desrochers-Laporte). The goal of this work is to solve the Traveling Salesman Problem with a big size of network, in the first we explain the resolution method and we will present some numerical result.