Description

Travelling Salesman Problem (TSP) is a problem in discrete or combinatorial optimization. It is a prominent illustration of a class of problems in computational complexity theory which are hard to solve.

The aim of this project is to apply different algorithms on different versions of Traveling Salesman Problem. For instance, modifying the problem in such a way that more than one salesman travels on the map. Putting limits to the traveling time or length for each salesman can be a constraint. We will also discuss the results of applying different techniques to the proposed algorithms.

The algorithms we will evaluate are:

Updates