Henning Homfeld

Learn More
We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account, such as cyclic departures of the trains, time windows on(More)
In this paper, we develop heuristic algorithms for a complex locomotive scheduling problem in freight transport that arises at Deutsche Bahn AG. While for small instances an approach based on an ILP formulation and its solution by a commercial ILP solver was rather successful, it was found that effective heuristic algorithms are needed for providing better(More)
We present a new model for a strategic locomotive scheduling problem arising at the Deutsche Bahn AG. The model is based on a multi-commodity min-cost flow formulation that is also used for public bus scheduling problems. However, several new aspects have to be additionally taken into account, such as cyclic departures of the trains, time windows on(More)
Cars in rail freight service follow prescribed routes from their origin via intermediate shunting yards to their destination. The goal in designing such routes is to reduce the number of trains and their travel distances. Various real-world hard constraints make the problem difficult to formulate and also to solve. We present integer programming(More)
  • 1