Author(s)

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

Abstract

A model for allocation of empty freight cars in a railway system is pre- sented. We assume that supply and demand of several types of empty cars are given over some planning period. The trains are assumed to have limited capacities. The cost types considered in the model are linear transporta- tion and shortage costs and fixed charges representing either train setup costs or marshalling operation costs. The resulting mathematical program- ming problem is an integer capacitated network design problem. Solution methods are discussed. 1 Introduction To make up for the unbalances in freight flows in a railway system, it is necessary to transport empty cars. The consequences of a badly planned empty car allocation can be unnecessary expensive allocation of the empties

Keywords