Travral Selsman Problem solver
The travelling salesman problem (also called the travelling salesperson problem or TSP) asks the following question: "Given a list of cities and the distances between each pair of cities, what is the shortest possible route that visits each city and returns to the origin city?" It is an NP-hard problem in combinatorial optimization, important in operations research and theoretical computer science. more info
In the following implemetation in Java we used:
based on random generated graph with multiple insances size, we created the following graph to compare in term of time, solution quality and costs.
-
In term of time.
-
In term of quality.
-
In term of cost.
