Take the 2-minute tour ×
Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. It's 100% free, no registration required.

I am working on a transportation (linear programming) problem. Each potential solution also requires checking the distance of approx 20,000 routes with 5 to 15 nodes per route. Calculating the shortest path for each route is likely to be time consuming using a TSP or similar call in pgrouting.

Would it be feasible to sacrifice some accuracy (for example < 10%) and instead build a minimal spanning tree for each route using a pre-calculated distance table of the shortest path from one node to another (say using OSRM).

Apologies if answer is blindingly obvious, I am new to GIS.

share|improve this question
add comment

Your Answer

 
discard

By posting your answer, you agree to the privacy policy and terms of service.

Browse other questions tagged or ask your own question.