Table of Contents

• Introduction
• List of Algorithms
• Usage Instructions
• Contributing
• Creators
• References
• Copyright and license

Introduction

This repository provides various efficient algorithms to solve bicriteria shortest path problems in public transit routing. For documentation refer the link below

• Website: https://transnetlab.github.io/transit-routing/html/index.html

We mainly focus on two popular approaches: Round-Based Public Transit Routing (RAPTOR) and Trip-Based public Transit Routing (TBTR) working on arrival time and number of transfers as the two optimization criteria. Apart from the already published HypRAPTOR, we also include our variant of HypTBTR. Furthermore, both HypRAPTOR and HypTBTR have been extended using multilevel partitioning (MhypTBTR and MhypRAPTOR).

Additionally, to make the RAPTOR and TBTR approach more practical, we also include One-To-Many rTBTR and One-To-Many rRAPTOR. These not only reduce the preprocessing times of the partitioning variants but also significantly outperform the existing approach for location-based queries (as a location can have multiple stops near it)

Switzerland's public transit network has been provided as a test case. The figure below shows the transit stop location (left) and 4-way partitioning using KaHyPar (right).

List of Algorithms

Algorithm	SOURCE	Status	Comments
RAPTOR	link	Complete
TBTR	link	Complete
rRAPTOR	link	Complete
rTBTR	link	Complete
One-To-Many rRAPTOR	link	Complete
One-To-Many rTBTR	link	Complete
HypRAPTOR	link	Test case to be updated soon
HypTBTR	link	Test case to be updated soon
MHypTBTR	link	Test case to be updated soon
MHypTBTR	link	Test case to be updated soon
Transfer Patterns	link	To be updated soon
Scalable Transfer Patterns	link	To be updated soon

Usage Instructions

Refer https://transnetlab.github.io/transit-routing/html/index.html.

Contributing

We welcome all suggestions from the community. If you wish to contribute or report any bug please contact the creaters or create an issue on issue tracking system.

Creators

• Prateek Agarwal

  • Ph.D. at Indian Institute of Science (IISc) Bengaluru, India.
  • Mail Id: [email protected]

• Tarun Rambha

  • Assistant Professor in the Department of Civil Engineering and the Center for Infrastructure, Sustainable Transportation and Urban Planning (CiSTUP) at Indian Institute of Science (IISc) Bengaluru, India.
  • Mail Id: [email protected]
  • http://civil.iisc.ernet.in/~tarunr/

References

• Delling, D., Pajor, T. and Werneck, R.F., 2015. Round-based public transit routing. Transportation Science, 49(3), pp.591-604.
• Delling, D., Dibbelt, J., Pajor, T. and Zündorf, T., 2017. Faster transit routing by hyper partitioning. In 17th Workshop on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2017). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.
• Witt, S., 2015. Trip-based public transit routing. In Algorithms-ESA 2015 (pp. 1025-1036). Springer, Berlin, Heidelberg.
• Agarwal, P., & Rambha, T., 2021. Scalable Algorithms for Bicriterion Trip-Based Transit Routing (Under Review).
• Bast, Hannah, Matthias Hertel, and Sabine Storandt. "Scalable transfer patterns." 2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments (ALENEX). Society for Industrial and Applied Mathematics, 2016.
• Bast, Hannah, et al. "Fast routing in very large public transportation networks using transfer patterns." European symposium on algorithms. Springer, Berlin, Heidelberg, 2010.

Copyright and license

The content of this repository is bounded by MIT License. For more information see COPYING file