Skip to main content
  • EN

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.

See https://community.safe.com/s/question/0D5Dm00000YDvONKA1/travelling-salesman-with-multiple-vehicles for more context about this idea.

Solving the multiple traveling salesman problem withing FME would be very beneficial to my workflow.  

The traveling salesman problem should allow for:

  • Multiple vehicles
  • Multiple depots
  • Date and time ranges for each stop.
  • Reverse movement, U-Turn, Left Turn and Right Turn restriction

Community Stats

31,951
Posts
121,336
Replies
39,561
Members

Latest FME

Terms & ConditionsCookie settingsAccessibility statement
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.