• 24 Posts
  • 4.51K Comments
Joined 2 years ago
cake
Cake day: July 2nd, 2023

help-circle





  • Everyone: he’s 22, he knows a lot of people ok, listen to him on this.

    /s

    you made this thread, and are all up in it desperately trying to justify to yourself what literally everyone reading this knows immediately upon reading this

    I don’t have to even say it because you know what it is. That’s how hard your projecting.













  • That’s not really how Uber eats or similar apps work. Drivers are very rarely on more than 1 delivery at a time.

    And again, until our problem size grows to a point where we cannot solve it in polynomial time, it is in P by definition.

    Traveling salesman starts to evade computational time at around 20 to 30 nodes.

    So because of this, as I said before, it employs a greedy heuristic to make light work on decent guesses for the problem, knowing the problem size will never get out of scope, so doing so is relatively safe.

    You’re right that in theory multiple deliveries look like a tiny version of TSP, but in practice it’s nowhere near the scale that makes TSP an NP problem.