Planning and operating public transport networks in an optimized way is an ubiquitous task, both from the passengers’ and operators’ perspective. Mathematical methods play a key role in numerous problems in traffic optimization. Many problems can be approached by techniques from discrete optimization.
The lecture deals with the mathematical modeling and algorithmic investigation of the following applications:
* Shortest routes in public transportation networks
* Line planning
* Timetabling
* Railway track allocation
* Vehicle scheduling
This includes the following mathematical problems and techniques:
* Modeling public transportation networks
* Shortest paths in graphs, time-dependent and resource-constrained
* Single- and multi-commodity network flows
* Cycle spaces and cycle bases in graphs
* Basic complexity theory (polynomial-time reductions, NP-completeness)
* Mixed integer linear programming, cutting planes and column generation
* Periodic Event Scheduling
Prerequisites: Basics of graph theory, e.g., Discrete Mathematics I. As a complement, you may optionally visit the lecture Discrete Mathematics II (= Optimization I) or the seminar on Optimization in Public Transport.