Modeling and Solution Methods for the Energy-Efficient Train Timetables Problem

摘要

Timely recuperation of energy through regenerative braking is crucial in order to ensure energy ecient railway timetables. This requires a careful synchronisation of train departures such that high energy peaks, as a result of simultaneously accelerating trains, can be avoided. In this report we consider a variant of this problem as presented in the FAU Open Research Challenge in Discrete Optimization. We propose a mixed integer linear programming formulation (MILP) together with a number of heuristics based on this model. We show that the MILP can obtain optimal solutions to most of the instances proposed as part of the challenge, and that the matheuristics can nd good solutions in short computation times.