Trip/Pathfinding ways

Shortest paths

Car based pathfinding over weighed directed graph (digraph).

Contraction hierarchies

With precomputed graph which has single cost of constructing the searc graph. The following shortest paths can then be quickly computed. On M3 mac milion of short paths takes just a few seconds.

The downside may be when wanting to compute shortest path over graph whose weighs are changing.

• https://github.com/easbar/fast_paths

Multi modal paths

Other criterions, not just path with shortest sum over weights of its edges.

• (Conway and Stewart 2019)
• https://github.com/conveyal/r5
• https://github.com/opentripplanner/OpenTripPlanner

References

Conway, Matthew Wigginton, and Anson F. Stewart. 2019. “Getting Charlie Off the MTA: A Multiobjective Optimization Method to Account for Cost Constraints in Public Transit Accessibility Metrics.” International Journal of Geographical Information Science 33 (9): 1759–87. https://doi.org/10.1080/13658816.2019.1605075.