This is really just a means for this: Set TSP in jsprit?
My idea is:
- for every set of locations (e.g. all nodes in a osm tile at a certain zoom level, roughly one mile by one mile), I create a virtual node with edges to these actual nodes
- I could then ask graphhopper to route from one such virtual node to another virtual node and I’d get the shortest / most optimal path that connects the two OSM tiles
- Now the set traveling salesman problem is reduced to a regular traveling salesman problem
- I’d then feed the distances / costs of these paths to jsprit and let it solve the TSP
I don’t quite see yet how I can use QueryGraphs for that, am I missing something?