Abstract
In the veneer cutting industry tree trunks are peeled into thin veneer strips which are cut, glued together, and pressed into bentwood pieces for seats, backrests, etc. In this work, a model for optimizing the inherent cutting problem with respect to resource efficiency is presented. Especially the heterogeneous quality of the wood renders existing models for classic cutting stock problems useless and calls for a new modeling approach. By means of the model presented in this paper, the problem is solved to optimality for real-world instances in reasonable time and applicable solutions are generated. Furthermore, in order to deal with uncertainties in the wood quality, the approach of robust optimization is applied to the problem. Robust optimization is an important tool to deal with uncertainties in the formulation of mathematical optimization models. Different concepts of robustness have been provided in the literature, one of which is the concept of minmax robust efficiency for uncertain multi-objective optimization problems. The concept of minmax robust efficiency is applied to a simplified version of the problem, robust efficient solutions are calculated, and the paper concludes with the discussion of the benefit of these solutions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Ben-Tal A, Nemirovski A (1998) Robust convex optimization. Math Oper Res 23(4):769–805
Ben-Tal A, Nemirovski A (1999) Robust solutions of uncertain linear programs. Oper Res Lett 25(1):1–13
Ben-Tal A, El Ghaoui L, Nemirovski A (2009) Robust optimization. Princeton University Press, Princeton, NJ
Benati S (1997) An algorithm for a cutting stock problem on a strip. J Oper Res Soc 48(3):288–294
Birge J, Louveaux F (2011) Introduction to stochastic programming. Springer, New York
Borodin A, El-Yaniv R (1998) Online computation and competitive analysis. Cambridge University Press, Cambridge, MA
Branke J (1998) Creating robust solutions by means of evolutionary algorithms. In: Proceedings of the 5th international conference on parallel problem solving from nature (PPSN), pp 119–128
Deb K, Gupta H (2006) Introducing robustness in multi-objective optimization. Evol Comput 14(4):463–494
Dyckhoff H (1990) A typology of cutting and packing problems. Eur J Oper Res 44:145–159
Ehrgott M (2005) Multicriteria optimization. Springer, Berlin
Ehrgott M, Ide J, Schöbel A (2014) Minmax robustness for multi-objective optimization problems. Eur J Oper Res 239:17–31
Erera A, Morales J, Savelsbergh M (2009) Robust optimization for empty repositioning problems. Oper Res 57(2):468–483
Fischetti M, Monaci M (2009) Light robustness. In: Robust and online large-scale optimization. Springer, Berlin, pp 61–84
Goerigk M, Schöbel A (2011) A scenario-based approach for robust linear optimization. In: Theory and practice of algorithms in (computer) systems, pp 139–150
Kouvelis P, Yu G (1997) Robust discrete optimization and its applications. Kluwer, Dordrecht
Liebchen C, Lübbecke M, Möhring R, Stiller S (2009) The concept of recoverable robustness, linear programming recovery, and railway applications. In: Robust and online large-scale optimization. Springer, Berlin, pp 1–27
Lohmann U (2003) Holzlexikon (in German). DRW-Verlag Weinbrenner GmbH & Co., Leinfelden-Echterdingen
Pareto V (1896) Manuel d’économie politique (in French). F. Rouge, Lausanne
Ràcz J (1961) Untersuchungen über das Auftreten des Buchenrotkerns in Niedersachsen (in German). PhD thesis, Forstliche Fakultät der Georg-August Universität zu Göttingen in Hann.-Münden
Schöbel A (2012) Light robustness and the trade-off between robustness and nominal quality. Techical report, Preprint-Reihe, Institut für Numerische und Angewandte Mathematik, Georg-August Universität Göttingen, submitted
Soyster A (1973) Convex programming with set-inclusive constraints and applications to inexact linear programming. Oper Res 21(5):1154–1157
Wäscher G, Haußner H, Schumann H (2007) An improved typology of cutting and packing problems. Eur J Oper Res 183(3):1109–1130
Zhiping C, Hurkens C, Jong J (1997) A branch-and-price algorithm for solving the cutting strips problem. Appl Math A J Chin Univ 12(2):215–224
Acknowledgments
This research was funded by the DFG research training group 1703 Resource Efficiency in Interorganizational Networks. Furthermore, we thank our practice partner, Fritz Becker KG, for the interesting and fruitful collaboration.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Ide, J., Tiedemann, M., Westphal, S. et al. An application of deterministic and robust optimization in the wood cutting industry. 4OR-Q J Oper Res 13, 35–57 (2015). https://doi.org/10.1007/s10288-014-0265-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10288-014-0265-4