-1

I am trying to solve a large vehicle routing problem with many pickup and delivery constraints and time windows and demands. There are so many first search strategies and I am a novice user that does not know which one to try first and how to set it up. Is there a brute force solve method that tries one solver after the other? Which first solution strategies should I definitely try?

Leevi L
  • 1,538
  • 2
  • 13
  • 28

1 Answers1

1

The way I did it was one by one and checked the answers, there are not that many first solution strategy. "PathCheapestArc works the best based on my experience.

Albert
  • 11
  • 2
  • in terms of performance (running time) or in terms of finding a solution? I am currently running a for loop over all options in https://developers.google.com/optimization/routing/routing_options – Leevi L Oct 17 '19 at 13:02
  • I looked at my results again, "Global Cheapest Arc" and "Local Cheapest Arc" as First solution strategy, combined with "Guided Local search" as Local Search Option for 30 sec gives the best result in terms of total travel time. Even without local search option, these two had the best result in terms of total travel time. – Albert Oct 18 '19 at 15:18