Hi
I have a travelling salesman use case, where a fleet of perhaps 2-4 vehicles need to reach a shared set of locations in a municipality. The locations are patients that are to be visited during the day by one of the vehicles. The list of locations (patients) is shared between the vehicles and only one of the vehicles needs to visit each patient. Also, all of the vehicles always start and end the day at the same location (the health clinic). In short, I would like FME to calculate the shortest paths for a shared set of locations for a few vehicles.
