Round-bAsed Public Transit Optimized Router

A TypeScript implementation of RAPTOR algorithm. It includes the following derivatives:

• RAPTOR
• McRAPTOR

All optimizations are included except local pruning ; see this issue. It is implemented on the local-pruning branch

What it is

An algorithm to compute all Pareto-optimal journeys in a dynamic public transit network for multiple criteria, such as arrival time and number of transfers.

Implemented criteria at src/criteria.ts:

• Foot distance, minimizes the foot distance over a journey
• Buffer time (same as the original paper), maximizes the minimum transfer time to hop on a trip over a journey

Additions

Some new features are brought in this implementation:

• Enhancing Pareto front to be maximal in general (with any criterion) — issue, PR
  This is done by scanning subsequent catchable trips, not only the earliest one. The scanning stops when its label is dominated by one of a previously scanned trip. This implies the Pareto front is maximal if every criterion is increasing for increasing trips.

References

• Daniel Delling, Thomas Pajor, Renato F. Werneck (2014) Round-Based Public Transit Routing. Transportation Science 49(3):591-604. doi.org/10.1287/trsc.2014.0534