Geographic Information Systems Stack Exchange is a question and answer site for cartographers, geographers and GIS professionals. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

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
I work with linear programming and routing issues. I'm still not clear on what you're trying to achieve – dassouki Dec 16 '14 at 16:25

Your Answer


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

Browse other questions tagged or ask your own question.