A model for allocation of empty freight cars in a railway system is presented. 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 transportation and shortage costs and fixed charges representing either train setup costs or marshalling operation costs. The resulting mathematical programming problem is an integer capacitated network design problem. Solution methods are discussed.
Read full abstract