ramone
Member level 3
- Joined
- Oct 5, 2003
- Messages
- 58
- Helped
- 1
- Reputation
- 2
- Reaction score
- 0
- Trophy points
- 1,286
- Location
- Patras University
- Activity points
- 721
tsp maths formulation
Hi there! I'm working on some robotics and i use the Traveling Salesman Problem to make some paths. At the moment i'm trying to model this game:
the salesman starts from a city (say 1) and has n cities to travel but he has only T time units. Assuming that every travel between 2 cities is one time unit then which is the best path to take?
This means i have to reformulate the problem in some way. I have thought of a solution but how can i gurrante if it is the optimal or not? What maths to use???
Hi there! I'm working on some robotics and i use the Traveling Salesman Problem to make some paths. At the moment i'm trying to model this game:
the salesman starts from a city (say 1) and has n cities to travel but he has only T time units. Assuming that every travel between 2 cities is one time unit then which is the best path to take?
This means i have to reformulate the problem in some way. I have thought of a solution but how can i gurrante if it is the optimal or not? What maths to use???