'Algorithm - Find locations close/nearby to a given route
My problem is somewhat similar to Dijkstra's shortest paths algorithm but I am not sure if it's suitable for my case. So, I 'm going to explain this with an example.
Let's say we have a shipping company that delivers boxes (via road) to 10 destinations. I want to find the min amount of travels that serve the most destinations? If a travel starts from location A and has a destination of B, maybe there is another location C on the same direction that can be served as well?
What I am thinking to do is find the destination (let's call it Z) that is further from the origin A and create a 'route' from A to Z. Then for all other locations get a radius and check if it intersects the calculated route.
I hope that makes sense. Any insight would be greatly appreciated.
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|