Shunting minimal rail car allocation

Computational Optimization and Applications

Volumn 31, Issue 3, 2005, Pages 295-308

  Lübbecke, Marco E ^a   Zimmermann, Uwe T ^b  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

Decomposition; Mixed integer programming; Rail transport; Shunting minimization

Indexed keywords

COMPUTATIONAL METHODS; DECOMPOSITION; INTEGER PROGRAMMING; PLANNING; PROBLEM SOLVING; RAILROAD TRACKS; RAILROAD TRANSPORTATION; RAILROADS;

IN-PLANT RAILROADS; MIXED INTEGER PROGRAMMING; RAIL TRANSPORT; SHUNTING MINIMIZATION;

RAIL MOTOR CARS;

EID: 23944501286     PISSN: 09266003     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10589-005-3229-y     Document Type: Article

References (15)

1. W.P. Allman, quot;An optimization approach to freight car allocation under time-mileage per diem rental rates,quot; Management Sci., vol. 18, no. 10, pp. B-567-B-574, 1972.
2. C. Barnhart, H. Jin, and P.H. Vance, quot;Railroad blocking: A network design application,quot; Oper. Res., vol. 48, no. 4, pp. 603-614, 2000.
3. N.J. Bojović, quot;Application of optimization techniques to the railroad empty car distribution process: A survey,quot; Yugoslav J. Oper. Res., vol. 10, no. 1, pp. 63-74, 2000.
4. A. Charnes and M.H. Miller, quot;A model for the optimal programming of railway freight train movements,quot; Management Sci., vol. 3, pp. 74-92, 1956.
5. E. Dahlhaus, P. Horak, M. Miller, and J.F. Ryan, quot;The train marshalling problem,quot; Discrete Appl. Math., vol. 103, nos. 1-3, pp. 41-54, 2000.
6. M.R. Garey and D.S. Johnson, quot;Computers and intractability - a guide to the theory of NP-completeness,quot; W.H. Freeman and Company: San Francisco, 1979.
7. J. Håstad, quot;Some optimal inapproximability results,quot; in Proceedings of the Twenty-Ninth Annual ACM Symposium on the Theory of Computing, 1997. ACM Press: El Paso, Texas, pp. 1-10.
8. K. Holmberg, M. Joborn, and J.T. Lundgren, quot;Computational experiments with an empty freight car distribution model,quot; 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.
9. K. Holmberg, M. Joborn, and J.T. Lundgren, quot;Improved empty freight car distribution,quot; Transportation Sci., vol. 32, no. 2, pp. 163-173, 1998.
10. E.L. Lawler, Combinatorial Optimization: Networks and Matroids, Dower: Mineola, New York, 2001, Unabrigded reprint of the 1976 edition.
11. M.E. Lübbecke and U.T. Zimmermann, quot;Engine routing and scheduling at industrial in-plant railroads,quot; Transportation Sci., vol. 37, no. 2, pp. 183-197, 2003.
12. H.N. Newton, C. Barnhart, and P.H. Vance, quot;Constructing railroad blocking plans to minimize handling costs,quot; Transportation Sci., vol. 32, no. 4, pp. 330-345, 1998.
13. Y.-S. Shan, quot;A dynamic multicommodity network flow model for real time optimal rail freight car management,quot; PhD Thesis, Princeton Unviersity, Princeton, NJ, 1985.
14. H.D. Sherali and A.B. Suharko, quot;A tactical decision support system for empty railcar management,quot; Transportation Sci., vol. 32, no. 4, pp. 306-329, 1998.
15. T. Winter and U.T. Zimmermann, quot;Real-time dispatch of trams in storage yards,quot; Ann. Oper. Res., vol. 96, pp. 287-315, 2000.