Abstract
Because of the sharp development of (commercial) MILP software and hardware components, pseudo-polynomial formulations have been established as a viable tool for solving cutting and packing problems in recent years. Constituting a natural (but independent) counterpart of the well-known cutting stock problem, the one-dimensional skiving stock problem (SSP) asks for the maximal number of large objects (specified by some threshold length) that can be obtained by recomposing a given inventory of smaller items. In this paper, we introduce a new arcflow formulation for the SSP applying the idea of reflected arcs. In particular, this new model is shown to possess significantly fewer variables as well as a better numerical performance compared to the standard arcflow formulation.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Assmann, S.F., Johnson, D.S., Kleitman, D.J., Leung, J.Y.-T.: On a dual version of the one-dimensional Bin Packing Problem. J. Algorithms 5, 502–525 (1984)
Chen, Y., Song, X., Ouelhadj, D., Cui, Y.: A heuristic for the skiving and cutting stock problem in paper and plastic film industries. Int. Trans. Oper. Res. 26(1), 157–179 (2019)
Côté, J.-F., Iori, M.: The meet-in-the-middle principle for cutting and packing problems. INFORMS J. Comput. 30(4), 646–661 (2018)
Christofides, N., Whitlock, C.: An algorithm for two-dimensional cutting problems. Oper. Res. 25(1), 30–44 (1977)
Delorme, M., Iori, M.: Enhanced pseudo-polynomial formulations for bin packing and cutting stock problems. Technical Report OR-17-6, DEI “Guglielmo Marconi”, Università di Bologna (2017)
Delorme, M., Iori, M., Martello, S.: Bin packing and cutting stock problems: mathematical models and exact algorithms. Eur. J. Oper. Res. 255, 1–20 (2016)
Johnson, M.P., Rennick, C., Zak, E.J.: Skiving addition to the cutting stock problem in the paper industry. SIAM Rev. 39(3), 472–483 (1997)
Martinovic, J., Scheithauer, G.: Integer linear programming models for the skiving stock problem. Eur. J. Oper. Res. 251(2), 356–368 (2016)
Martinovic, J., Jorswieck, E., Scheithauer, G., Fischer, A.: Integer linear programming formulations for cognitive radio resource allocation. IEEE Wirel. Commun. Lett. 6(4), 494–497 (2017)
Martinovic, J., Scheithauer, G., Valério de Carvalho, J.M.: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems. Eur. J. Oper. Res. 266(2), 458–471 (2018)
Nemhauser, G., Wolsey, L.: Integer and Combinatorial Optimization. Wiley, New York (1988)
Scheithauer, G.: Introduction to Cutting and Packing Optimization – Problems, Modeling Approaches, Solution Methods. Springer, Chur (2018)
Valério de Carvalho, J.M.: LP models for bin packing and cutting stock problems. Eur. J. Oper. Res. 141(2), 253–273 (2002)
Zak, E.J.: The skiving stock problem as a counterpart of the cutting stock problem. Int. Trans. Oper. Res. 10, 637–650 (2003)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Martinovic, J., Delorme, M., Iori, M., Scheithauer, G. (2019). An Improved Arcflow Model for the Skiving Stock Problem. In: Fortz, B., Labbé, M. (eds) Operations Research Proceedings 2018. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-030-18500-8_18
Download citation
DOI: https://doi.org/10.1007/978-3-030-18500-8_18
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-18499-5
Online ISBN: 978-3-030-18500-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)