Abstract
We consider a storage loading problem in a stack-based storage area, in which incoming items have to be loaded to stacks, taking into account that some items have already been stored in the storage area and another set of items will arrive later. Each item has an associated value referring to e.g. its weight, length, or departure time. Stacking constraints based on associated values of the items are imposed. While the actual data of the first two item sets are known exactly, a limited number Γ of items arriving later may have uncertain data that deviate from their nominal associated values. Dealing with this Γ-uncertainty, by following the robust optimization paradigm we propose algorithms for finding strictly and adjustable robust solutions to the uncertain problem. Computational results on randomly generated instances show the impact of different parameters on the gain of including robustness in improving stacking solutions.
This is a preview of subscription content, log in via an institution to check access.
References
Álvarez-Miranda, E., Ljubić, I., Toth, P.: A note on the Bertsimas & Sim algorithm for robust combinatorial optimization problems. 4OR 11, 349–360 (2013)
Ben-Tal, A., El Ghaoui, L., Nemirovski, A.: Robust Optimization. Princeton Series in Applied Mathematics. Princeton University Press, Princeton and Oxford (2009)
Bertsimas, D., Sim, M.: Robust discrete optimization and network flows. Math. Program. 98, 49–71 (2003)
Bertsimas, D., Sim, M.: The price of robustness. Oper. Res. 52, 35–53 (2004)
Bertsimas, D., Brown, D. B., Caramanis, C.: Theory and applications of robust optimization. SIAM Rev. 53, 464–501 (2011)
Boysen, N., Emde, S.: The parallel stack loading problem to minimize blockages. Eur. J. Oper. Res. 249, 618–627 (2016)
Bruns, F., Goerigk, M., Knust, S., Schöbel, A.: Robust load planning of trains in intermodal transportation. OR Spectrum 36, 631–668 (2014)
Bruns, F., Knust, S., Shakhlevich, N. V.: Complexity results for storage loading problems with stacking constraints. Eur. J. Oper. Res. 249, 1074–1081 (2016)
Büsing, C., Knust, S., Le, X. T.: Trade-off between robustness and cost for a storage loading problem: rule-based scenario generation. EURO. J. Comput. Optim. 6, 339–365 (2018)
Goerigk, M., Knust, S., Le, X. T.: Robust storage loading problems with stacking and payload constraints. Eur. J. Oper. Res. 253, 51–67 (2016)
Kang, J., Ryu, K.R., Kim, K.H.: Deriving stacking strategies for export containers with uncertain weight information. J. Intell. Manuf. 17, 399–410 (2006)
Kim, K.H., Park, Y.M., Ryu, K.-R.: Deriving decision rules to locate export containers in container yards. Eur. J. Oper. Res. 124, 89–101 (2000)
Koch, T.: Rapid mathematical programming. PhD Thesis, Technical University of Berlin (2004)
Le, X.T.: Robust Solutions to Storage Loading Problems under Uncertainty. PhD thesis, University of Osnabrück (2017)
Le, X.T., Knust, S.: MIP-Based approaches for robust storage loading problems with stacking constraints. Comput. Oper. Res. 78, 138–153 (2017)
Lehnfeld, J., Knust, S.: Loading, unloading and premarshalling of stacks in storage areas: Survey and classification. Eur. J. Oper. Res. 239, 297–312 (2014)
Acknowledgements
This work is supported by Project DLTE00.02/19-20 of Vietnam Academy of Science and Technology. The authors would like to thank anonymous reviewers for their insightful comments and suggestions, that greatly improved this work.
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Knust, S., Le, X.T. & Nga, N.T. The Gain of Robustness for a Storage Loading Problem. Vietnam J. Math. 50, 1–27 (2022). https://doi.org/10.1007/s10013-020-00425-z
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10013-020-00425-z