Select to view content in your preferred language

calculating shortest path using different methods

07-25-2014 09:45 AM
New Contributor II

Dear all,

I am trying to get the shortest path in behave of (time - distance) between a set of 200 nodes.

I have two method to find it:

  1. using shortest path method ( calculated between two points - it will take a lot of time).
  2. using OD matrix method ( very fast).

So i have created a small network (6 nodes) to check the results of each method.

  • For distance: the results from two methods are the same.
  • For Time: there are differences between the two methods. Also, there are differences when i change between the origin and destination for the both methods (for example: time from node 2 to node 3 & from node 3 to node 2).


I hope any one can tell me about the reasons of different results.


*attached  the results of the simple network.

0 Kudos
1 Reply
MVP Emeritus

It is sometimes the case that going from A to B is not the same as going from B to A because of the differences in costs associated with the traversal.  This could be complicated by one-way streets, differences in speed limits, turn restrictions etc.  So without knowing exactly what was done, it is possible to make any conclusions as to the differences

0 Kudos