No.
Just. No.
There's a lot wrong here.
First off, this is
@zubenelgenubi 's actual question:
And you went off on a tangent about brute forcing.
Let's look at chess.
Computers can play chess at rating higher than 3000 Elo (Higher than any human player).
Chess suffers from the same type of combinatoric explosion that ORION does. And yet they have it down to a science. Almost no errors.
The reason for this is because of a process known as "pruning". Basically, this is what an engine will do when it encounters a "branch" on the search tree that do not have a significant reason to be looked through.
The exact same method should be usable with ORION. You aren't going to deliver one stop on one side of your route, and then drive to the other side of the route. That will almost never make sense. And so the algorithm could cull it, and reduce the number of branches that it must traverse by a massive amount.
You clearly aren't familiar with ASICS.
Just look at the cryptocurrency mining scene. You can get a computer capable of running 67 trillion SHA256 hashes (not a small feat, for the mathematically challenged here) per second for less than 2K USD.
Completely wrong.
First off, ORION has basically been around for decades, in the form of the travelling salesman problem.
That is typically one of the first things you learn when you take artificial intelligence classes, and it absolutely qualifies as AI.
Neural nets are a process of taking statistics and using them to come to decisions about inputted data. Yes. OCR is AI.
You clearly aren't a programmer.