Author(s)

K. Holmberg, M. Joborn & J.T. Lundgren

Abstract

In this paper we make computational experiments with an empty freight car distribution model. The model takes the limited transportation capacities of the trains into account, and it can be characterized as a multicommodity network flow model with integer requirements. The tests indicate that the model is solvable and that the model can be used for operational planning and strategic analyses. 1 Introduction In a railway transportation system there are often imbalances in the freight flows. The imbalances are worsened by the fact that there exist many types of freight cars, and all goods cannot be transported in all types of cars. To make up for these imbalances in freight flows and to enable fulfill- ment of demand for transport, empty freight cars are repositioned. In the empty fr

Keywords