Skip to Main Content
The traveling salesman problem, or TSP, is one of the most famous and well studied problems in combinatorial optimization. There are many studies with the objective of finding an optimal solution for this problem. These studies have not been successful, since it is considered to be an NP-Hard problem. This means that is not possible to find a method that ensures an optimal solution for all instances of this problem. In this paper we present two techniques to solve this problem, a tabu search based algorithm and a memetic algorithm. The results of both techniques are shown and compared to decide which one of the two alternatives gets better results. Apart from this, several studies are performed to determine certain aspects of the algorithms, such as the crossover function for the memetic algorithm or the size of the tabu list.