Question

Shortest path between many points and one destination

  • 24 October 2017
  • 5 replies
  • 13 views

Badge

Hi!

I am trying to find the shortest paths between many points and one destination, any idea on how I can easiest do this? I would like to reach a similar effect as v.net.distance in QGIS. I have looked at shortestpathfinder and networkcostcalculator, but I cannot see how I should use them, or which other tools to combine them with, in order to reach my goal.


5 replies

Userlevel 4
Badge +30

Hi @elinbr,

You can use the transformer NeighborFinder.

This transformer generate the attributes:

Thanks,

Danilo

Userlevel 4

Here's a good walk-through of the ShortestPathFinder and how to use it:

https://knowledge.safe.com/articles/28065/shortest-route-calculations.html

Here's an older video for FME 2013, but I think most of it still applies:

https://www.youtube.com/watch?v=5BzxKw_LONE

Let us know if you have specfic questions.

Badge

Hi!

Thanks! However, I need the equvalence of v.net.distance in QGIS. Is that not possible in FME?

Badge

Hi!

Thanks! However, I need the equvalence of v.net.distance in QGIS. Is that not possible in FME?

Hi again! Okay I see, I need to first create lines between my from-Points and my to-Point. Thanks again!

 

 

Badge +3

Assuming you have a network (maybe road centerlines). You create points on the network by for instance neighborfinder or buffering and overlayers.

Create a from to by merging all from's to to's (unconditionaly merging

many points to your one destination)

Then use the shortest pathfinder.

Reply