I have an optimisation problem I want to understand and tackle.
I think it is a Travelling Salesman variation, where I want to find an answer to the question:
"What is the most efficient route for a set of Visits?"
The variables for this question are dependent on:
- Set of Visits logically within a daily window
- Each Visit has a Duration
- Some Visits have a fixed Start Time that must be adhered too. The remaining Visits are not fixed in their Start Time.
- Visits are geocoded to provide distance + travelling time between all
My question is, is this a Travelling Salesman variation type problem?
If yes, how do I frame it as so?
If not, any nudge in the direction of how to frame it would be really appreciated.