Tagged Questions
10
votes
1answer
227 views
Are there any intelligent travelling salesmen?
Jokes aside, I have had a routing problem that is almost a travelling salesman problem (TSP):
the starting point is defined
the end point coincides with the starting point
each node has to be ...
2
votes
3answers
157 views
Looking for TSP with Target different from Source
I know the TSP (traveling sales person) in osm2po is beta but it works quite well.
Is there a way to designate a final target location that is different from the initial source location. In other ...
31
votes
3answers
4k views
Are there newer routing algorithms (than Dijkstra, A*) in GIS databases?
There are works like Reach for A* from Microsoft researchers and Highway Hierarchies by Sanders and Schtolz (if I spell the name correctly) from Karlsruhe Uni. Both of them reduce the calculations ...
