Optimal FIFO grouping in public transit networks

TL;DR

This paper addresses the problem of optimally grouping public transit vehicles into FIFO routes to improve route planning efficiency by minimizing overtaking conflicts.

Contribution

It introduces a formal approach to minimal FIFO grouping of trips, enhancing route planning algorithms in public transit networks.

Findings

Proposes a method for minimal FIFO grouping

Improves route planning runtime

Ensures no overtaking within routes

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.