Optimal FIFO grouping in public transit networks
Data Structures and Algorithms
2024-07-02 v4
Abstract
This technical report is about grouping vehicles in public transport into routes so that two vehicles of a route do not overtake each other. We say that such a set of routes satisfies the FIFO property. A natural question is: Given a set of trips, find a minimal FIFO grouping into routes. This question is especially interesting for route planning algorithms since a better route grouping leads to a better runtime.
Cite
@article{arxiv.2308.06629,
title = {Optimal FIFO grouping in public transit networks},
author = {Patrick Steil},
journal= {arXiv preprint arXiv:2308.06629},
year = {2024}
}
Comments
1 page, 0 figures