Skip to main content
Question

Calculating journey times

  • November 5, 2014
  • 3 replies
  • 193 views
Z
Hi

 

 

I have a set of origin points "origins" and a set of destination points "destinations" for which I would like to calculate the journey time between each of them (for every OD pair).

 

I also have network shapefile "network" that has the road centrelines which contains speed and distance attributes.

 

 

I think I need to use "shortest path finder" and weight it by the speed but is anyone able to help describe this in more detail/ suggest an alternative method to create a OD matrix with journey times and another with journey distances for each OD combination?

 

 

Thanks

 

 
This post is closed to further activity.
It may be an old question, an answered question, an implemented idea, or a notification-only post.
Please check post dates before relying on any information in a question or answer.
For follow-up or related questions, please post a new question or idea.
If there is a genuine update to be made, please contact us and request that the post is reopened.

3 replies

takashi
Celebrity
  • takashiCelebrity
  • November 5, 2014
Hi,

 

 

I think the ShortestPathFinder is a good choice.

 

The transformer requires a "From-To" line (i.e. origin-destination) feature to compte a shortest path. So you will have to create every origin-destination line at first.

 

After reading the origin / destination points:

 

1) Add a CooridinateExtractor to extract x, y of each destination points.

 

2) Add a FeatureMerger, send the origin points to the Requestor port, the destination points to the Supplier port, and perform unconditional merging so that every destination x, y will be migrated to all the origin points.

 

Join On: 1 to 1 (constant)

 

Process Duplicate Suppliers: Yes

 

Duplicate Supplier List: _dest

 

3) Connect a ListExploder to the Merged port of the FeatureMerger, explode the features on the "_dest{}".

 

4) Add a VertexCreator to add destination coordinate to every origin point. i.e. transform the origin points into From-To (origin-destination) lines based on the destination x, y value.

 

 

You can then send the lines to the ShortestPathFinder to get shortest path for each origin-destination pair.

 

 

Takashi
Why not inspect features with Visual/Data Preview and Feature/Record Information before writing them into a destination dataset?
gio
Contributor
Forum|alt.badge.img+15
  • gioContributor
  • Contributor
  • November 6, 2014
A unconditional merger is very usefull to have.

 

You can use the one in the fme-store.

 

Or build one yourself, wich is very easy.

 

 

I did, so i can merge more requestors simultaneously and to have tha ability to group during the merger.

 

 

Creting a network is also easy with fme by using topologybuilder(s) and NetworkFloworientors etc.
Z
  • zoerhiannon
  • Author
  • November 6, 2014
thanks very much everyone! :)

Community Stats

32,431
Posts
123,238
Replies
40,557
Members
Terms & ConditionsCookie settingsAccessibility statement
A product of
Safe Software respectfully acknowledges that we live, learn and work on the traditional and unceded territories of the Kwantlen, Katzie, and Semiahmoo First Nations.