+6Hi
I have a travelling salesman use case, where a fleet of perhaps 2-4 vehicles need to reach a set of locations in a municipality. I have used the shortestpathfinder before, but not with multiple agents/vehicles. Is that possible (finding the optimal plan for, say, 3 vehicles for an address list)? I found https://engage.safe.com/blog/2016/11/fmeevangelist158/, but it doesn´t mention more than one vehicle.
+21Hi @magnus You'll need 1 From-To line for every vehicle, which in your case should result in 2-4 paths. Each From-To line will be a line with at least two vertices, but will contain all locations. You might want to use the FromToBuilder to create your From-To lines. The ShortestPathFinder has the option of reordering the vertices in the From-To line to optimize the output path.
+6Thank you for the reply, Dan. I´ll add a few more details:
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). Is it possible to calculate the shortest paths for a shared set of locations for a few vehicles?
+21Thank you for the reply, Dan. I´ll add a few more details:
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). Is it possible to calculate the shortest paths for a shared set of locations for a few vehicles?
Hi @magnus Dividing a set of points into multiple optimal routes isn't possible. But it's a great idea! Please suggest this at https://community.safe.com/s/bridea/acideasULT__brIdea__c/00B4Q00000AWlEVUA1
+6Thanks for the suggestion, Dan. I posted it here, https://community.safe.com/s/bridea/a0rDm000001ReNJIA0/travelling-salesman-with-multiple-vehicles.
Hi @magnus Dividing a set of points into multiple optimal routes isn't possible. But it's a great idea! Please suggest this at https://community.safe.com/s/bridea/acideasULT__brIdea__c/00B4Q00000AWlEVUA1
Thank you for the suggestion!
Hi @magnus Dividing a set of points into multiple optimal routes isn't possible. But it's a great idea! Please suggest this at https://community.safe.com/s/bridea/acideasULT__brIdea__c/00B4Q00000AWlEVUA1
Thanks for the link.
