Shunting Minimal Rail Car Allocation
- 125 Downloads
We consider the rail car management at industrial in-plant railroads. Demands for loaded or empty cars are characterized by a track, a car type, and the desired quantity. If available, we assign cars from the stock, possibly substituting types, otherwise we rent additional cars. Transportation requests are fulfilled as a short sequence of pieces of work, the so-called blocks. Their design at a minimal total transportation cost is the planning task considered in this paper. It decomposes into the rough distribution of cars among regions, and the NP-hard shunting minimal allocation of cars per region. We present mixed integer programming formulations for the two problem levels. Our computational experience from practical data encourages an installation in practice.
KeywordsMixed integer programming shunting minimization decomposition rail transport
Unable to display preview. Download preview PDF.
- 7.J. Håstad, “Some optimal inapproximability results,” in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997. ACM Press: El Paso, Texas, pp. 1–10.Google Scholar
- 8.K. Holmberg, M. Joborn, and J.T. Lundgren, “Computational experiments with an empty freight car distribution model,” in Computers in Railways V, J. Allan, C.A. Brebbia, R.J. Hill, G. Sciutto, and S. Sone (Ed.), Computational Mechanics Publications: Southampton, UK, 1996, pp. 511–520.Google Scholar
- 10.E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Dower: Mineola, New York, 2001, Unabrigded reprint of the 1976 edition.Google Scholar
- 13.Y.-S. Shan, “A dynamic multicommodity network flow model for real time optimal rail freight car management,” PhD Thesis, Princeton Unviersity, Princeton, NJ, 1985.Google Scholar