Optimizing Travel Time and Regenerative Energy for Periodic Timetables
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2026
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866917457529143296 |
|---|---|
| author | Roth, Sarah Jäger, Sven Lindner, Niels Schöbel, Anita |
| author_facet | Roth, Sarah Jäger, Sven Lindner, Niels Schöbel, Anita |
| contents | Regenerating braking energy is one major pathway to make rail traffic energy-efficient. It is therefore desirable to design timetables that exploit this feature. However, timetables that allow to regenerate energy are often bad for the passengers. We hence formulate and analyze a bicriteria optimization problem (PESP-Passenger-Energy) to find periodic railway timetables that maximize the regenerated energy in terms of the brake-traction overlap time and minimize the travel time of the passengers. Our model extends the Periodic Event Scheduling Problem (PESP) and offers a rich combinatorial theory. We investigate its computational complexity on one-station networks, building on matchings and Hamiltonian paths. Besides showing its NP-hardness even for a single objective, we identify several polynomial-time solvable special cases. Finally, we provide two case studies, underlining the practicability of our model, and analyzing the Pareto front. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_02355 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Optimizing Travel Time and Regenerative Energy for Periodic Timetables Roth, Sarah Jäger, Sven Lindner, Niels Schöbel, Anita Optimization and Control Discrete Mathematics 90B35 (Primary) 68Q17, 90B06, 90B50, 90C11 (Secondary) J.2; F.2.2; G.2.2 Regenerating braking energy is one major pathway to make rail traffic energy-efficient. It is therefore desirable to design timetables that exploit this feature. However, timetables that allow to regenerate energy are often bad for the passengers. We hence formulate and analyze a bicriteria optimization problem (PESP-Passenger-Energy) to find periodic railway timetables that maximize the regenerated energy in terms of the brake-traction overlap time and minimize the travel time of the passengers. Our model extends the Periodic Event Scheduling Problem (PESP) and offers a rich combinatorial theory. We investigate its computational complexity on one-station networks, building on matchings and Hamiltonian paths. Besides showing its NP-hardness even for a single objective, we identify several polynomial-time solvable special cases. Finally, we provide two case studies, underlining the practicability of our model, and analyzing the Pareto front. |
| title | Optimizing Travel Time and Regenerative Energy for Periodic Timetables |
| topic | Optimization and Control Discrete Mathematics 90B35 (Primary) 68Q17, 90B06, 90B50, 90C11 (Secondary) J.2; F.2.2; G.2.2 |
| url | https://arxiv.org/abs/2605.02355 |