Integrating uncertainties into the optimization process is crucial to obtain solutions suitable for practical needs. In particular, the considered uncertainty set has a huge impact on the quality of the computed solutions. In this paper, we consider a storage loading problem in which a set of items must be loaded into a partly filled storage area, regarding stacking constraints and taking into account stochastic data of items arriving later. We propose a robust optimization approach dealing with the stochastic uncertainty. With a focus on constructing the uncertainty set, we offer a rule-based scenario generation approach to derive such a set from the stochastic data. To evaluate the robustness of stacking solutions, we introduce the concept of a security level, which is the probability that a stacking solution is feasible when the data of the uncertain items are realized. Computational results for randomly generated problem instances are presented showing the impact of various factors on the trade-off between robustness and cost of the stacking solutions.
This is a preview of subscription content, log in to check access
The authors would like to thank two anonymous referees for their constructive comments. This work was partially supported by the Deutsche Forschungsgemeinschaft (DFG, Germany) under Grant Number GRK 1916/1, and the National Foundation for Science and Technology Development (NAFOSTED, Vietnam) under Grant Number 101.01-2017.315.
Artzner P, Delbaen F, Eber J, Heath D (1999) Coherent measures of risk. Math Finance 9(3):203–228CrossRefGoogle Scholar
Forbes C, Evans M, Hastings N, Peacock B (2011) Statistical distributions, 4th edn. Wiley, HobokenGoogle Scholar
Gharehgozli AH, Yu Y, de Koster R, Udding JT (2014) A decision-tree stacking heuristic minimising the expected number of reshuffles at a container terminal. Int J Prod Res 52(9):2592–2611CrossRefGoogle Scholar
Goerigk M, Knust S, Le XT (2016) Robust storage loading problems with stacking and payload constraints. Eur J Oper Res 253(1):51–67CrossRefGoogle Scholar
Kang J, Ryu KR, Kim KH (2006) Deriving stacking strategies for export containers with uncertain weight information. J Intell Manuf 17(4):399–410CrossRefGoogle Scholar
Kim KH, Park YM, Ryu KR (2000) Deriving decision rules to locate export containers in container yards. Eur J Oper Res 124(1):89–101CrossRefGoogle Scholar
Koch T (2004) Rapid mathematical programming. Ph.D. thesis, Technische Universität BerlinGoogle Scholar
Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer Academic Publishers, DordrechtCrossRefGoogle Scholar
Le XT, Knust S (2017) MIP-based approaches for robust storage loading problems with stacking constraints. Comput Oper Res 78:138–153CrossRefGoogle Scholar
Lehnfeld J, Knust S (2014) Loading, unloading and premarshalling of stacks in storage areas: survey and classification. Eur J Oper Res 239(2):297–312CrossRefGoogle Scholar
Li M, Gabriel SA, Shim Y, Azarm S (2011) Interval uncertainty-based robust optimization for convex and non-convex quadratic programs with applications in network infrastructure planning. Netw Spatial Econ 11(1):159–191CrossRefGoogle Scholar
Steenken D, Winter T, Zimmermann U (2001) Stowage and transport optimization in ship planning. In: Online optimization of large scale systems. Springer, pp 731–745Google Scholar
Trivikram D, Goerigk M (2017) An experimental comparison of uncertainty sets for robust shortest path problems. In: Proceedings of the 17th workshop on algorithmic approaches for transportation modelling, optimization, and systems (ATMOS2017)Google Scholar