faq 276201475

Transit least cost path tree based on link travel time

by Jishnu Narayan on 2018-05-07 15:45:10

---

Hello all,

Is there a method/interface which returns the least cost path tree for a given origin and destination stop (not a set of initial and final stops) based on the link travel times of the transit network. The current method I found is:

TransitLeastCostPathTree tree = new TransitLeastCostPathTree(transitNetwork, travelDisutility, travelTime, FromNodes, ToNodes, person);

But I am looking for a least cost path tree generator for a single origin and destination transit node and not a set of initial and final nodes. And this would not depend on the agent but based on the link travel times (not schedule dependent) For instance:

TransitLeastCostPathTree tree = new TransitLeastCostPathTree(transitNetwork, InitialNode, FinalNode);

Thanks!

---

Comments: 1

---

Re: Transit least cost path tree based on link travel time

by Kai Nagel on 2018-08-05 13:52:53

I know. Somebody put that method name in there, without the method actually doing what it claims to do. :-(

Just made this into an "issue", https://matsim.atlassian.net/browse/MATSIM-844 . We have the same problem elsewhere.

---

We currently mostly use the SBB Raptor as pt router. In principle, it should be possible there to compute the whole tree in one go. However, that piece of code is not maintained by ourselves (as of now, may change). Maybe , who is the main author of that software, will get back to us.