-1

I need to build a different kind of a navigation route: Instead of the common shortest (time/length) path between A->B or TSP in general, here the task is to create route for a mobile mapping survey. Thus the requirements are:

  1. Traverse every possible maneuver (every road is not enough).

  2. Efficiently - if some maneuver took you to cover future parts, take this into consideration.

If this is a well known topic I would like to get some references - since I made quit a research and found none (incl. libs and tools if exists).

What I did so far is as follows:

  1. Dump first/last points from typical roads layers.

  2. TSP for single junction (OSRM etc.).

  3. Run directions requests (OSRM etc.).

The next step us challenging - how to merge all single junctions into one holistic route?

Thus:

  1. Determine order of visiting the junctions.
  2. Detect duplicated parts and take advantage for better Efficiency.

put on hold as too broad by PolyGeo 2 days ago

Please edit the question to limit it to a specific problem with enough detail to identify an adequate answer. Avoid asking multiple distinct questions at once. See the How to Ask page for help clarifying this question. If this question can be reworded to fit the rules in the help center, please edit the question.