Optimal FIFO grouping in public transit networks
Fuente:
arXiv
Guardado en:
| Autor principal: | |
|---|---|
| Formato: | Preprint |
| Publicado: |
2023
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866910506938269696 |
|---|---|
| author | Steil, Patrick |
| author_facet | Steil, Patrick |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2308_06629 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Optimal FIFO grouping in public transit networks Steil, Patrick Data Structures and Algorithms 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. |
| title | Optimal FIFO grouping in public transit networks |
| topic | Data Structures and Algorithms |
| url | https://arxiv.org/abs/2308.06629 |