faq 109875602

Implementation of PT Router

by Jishnu Narayan on 2017-06-09 12:03:27

---

Hello everyone! I have some questions regarding the implementation of the default 'pt router' in MATSim. I could not find any detailed explanation regarding what actually the 'pt router' does. I went through Marcel Rieser's thesis in which it is mentioned that a variation of Dijkstra's is used (but not a detailed explanation). The questions that I have are:

1) After choosing 'pt' as a mode, how does an agent decide which stop to board and alight. If there is a search radius, then what happens if no stop is found within that radius?

2) How does an agent decide which route to take for going from their origin stop to their destination stop ?

---

Comments: 1

---

Re: Implementation of PT Router

by Sergio Arturo Ordonez Medina on 2017-06-12 06:12:56

MATSim has a Transit Router based on a Transit Schedule. As explained in Marcel Rieser's thesis, a transit router network is built given the stops are routes of the public transit system. The nodes of this network are located at public transport stops. Given an origin, a destination and a maximum walking distance, a set of possible initial stops and a set of possible final stops are selected. Then a multi-node Dijkstra (which evolved to a LeastCostPathTree) is applied. It selects the best initial and final nodes and an optimal path between them. Thus, the path includes where to board, where to transfer and where to end. The code is in 

org.matsim.pt.router