Given that The Traveling Salesman Problem is NP hard, I’m gonna guess that the paths given to the pickers are not in fact ‘optimal’.
Given that The Traveling Salesman Problem is NP hard, I’m gonna guess that the paths given to the pickers are not in fact ‘optimal’.