Robust load planning of trains in intermodal transportation
- 565 Downloads
In this paper, the problem of robust load planning for trains in intermodal container terminals is studied. The goal of load planning is to choose wagon settings and assign load units to wagons of a train such that the utilization of the train is maximized, and setup and transportation costs in the terminal are minimized. However, in real-world applications, many of the parameters needed for the model are not known exactly. Since feasibility of the resulting load distribution has always to be guaranteed, we decided to use a robust approach. In particular, we apply the concepts of strict and adjustable robustness to enhance the load planning problem. Based on a formulation developed in Bruns and Knust (OR Spectrum 34:511–533, 2012) for the deterministic load planning problem, we propose mixed-integer linear programming formulations for most of the respective robust counterparts, dependent on the type of uncertainty. An experimental study shows that most of the robust problems can be solved within runtimes of a few minutes, which is good enough for real-world applications. Furthermore, our results indicate that robust solutions may improve the planning considerably, and that it is promising to add robustness even to large mixed-integer programs with many and diverse technical constraints.
KeywordsLoad planning Intermodal transportation Robustness Strict robustness Adjustable robustness
We gratefully acknowledge the help of two anonymous referees who gave several constructive comments to improve the paper. Additionally, we thank Marco Lenk (Deutsche Umschlaggesellschaft Schiene-Straße mbH) for providing information about uncertainties in the practical load planning setting.
- Alvarez PP, Vera JR (2011) Application of robust optimization to the sawmill planning problem. Ann Oper Res 1–19. doi: 10.1007/s10479-011-1002-4
- Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton and OxfordGoogle Scholar
- Bessas A, Kontogiannis S, Zaroliagis C (2011) Robust line planning in case of multiple pools and disruptions. In: Marchetti-Spaccamela A, Segal M (eds) Theory and practice of algorithms in (Computer) systems. Lecture Notes in Computer Science, vol 6595 , Springer, Berlin, pp 33–44Google Scholar
- Boysen N, Fliedner M, Jaehn F, Pesch E (2013) A survey on container processing in railway yards. Transp Sci. doi: 10.1287/trsc.1120.0415
- Fischetti M, Monaci M (2009) Light robustness. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture notes in computer science, vol 5868. Springer, Berlin, pp 61–84Google Scholar
- Garey MR, Johnson DS (1979) Computers and intractability—a guide to the theory of NP-completeness. Freeman, San FranciscoGoogle Scholar
- Goerigk M, Knoth M, Müller-Hannemann M, Schmidt M, Schöbel A (2011) The price of robustness in timetable information. In: Caprara A, Kontogiannis S (eds) Proceedings of ATMOS11, vol 20. Open Access Series in Informatics (OASIcs)Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Germany, pp 76–87Google Scholar
- Goerigk M, Schöbel A (2010) An empirical analysis of robustness concepts for timetabling. In: Erlebach T, Lübbecke M (eds) Proceedings of ATMOS10, vol 14. OpenAccess Series in Informatics (OASIcs)Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Germany, pp 100–113Google Scholar
- Goerigk M, Schöbel A (2012) A note on the relation between strict robustness and adjustable robustness. Institute for Numerical and Applied Mathematics, University of Göttingen, Technical reportGoogle Scholar
- Liebchen C, Lübbecke M, Möhring RH, Stiller S (2009) The concept of recoverable robustness, linear programming recoery, and railway applications. In: Ahuja RK, Möhring RH, Zaroliagis CD (eds) Robust and online large-scale optimization. Lecture notes in computer science, vol 5868. Springer, BerlinGoogle Scholar
- Subramani K (2004) Analyzing selected quantified integer programs. In: David B, Michaël R (eds) Automated Reasoning. Lecture notes in computer science, vol 3097. Springer, Berlin, pp 342–356Google Scholar
- WASCOSA AG Luzern, Doppeltaschenwagen T2000. http://www.txlogistik.eu/assets/Uploads/WASCOSA-Doppeltaschenwagen-T2000.pdf. Accessed August 2013.