I'm working on a Traveling Salesman Problem. I've included the background and goals I'm trying to achieve.
Background:
- I have a topological network that I can create a route over.
- I have locations on the network that require maintenance.
- Each location has a unique minimum and maximum number of days allowed between maintenance visits.
- I have the speed in which the maintenance team can travel, the length of time maintenance requires, the hours per day that maintenance works, and days per week worked.
- The maintenance staff do not return to a starting point between visits, but travel directly from one location to the next.
Goal:
- I want to create the ShortestPath for the maintenance vehicle that ensures that each location is visited during the timeframe allowed.
Problem:
- I am able to create a ShortestPath between the locations, but I can not figure out how to include the earliest and last dates that the locations should be visited in the algorithm.
