Abstract
For exactly solving the one-dimensional cutting stock problem (CSP) with several stock material lengths, a cutting plane approach (CPA) is proposed. This work is a continuation of [12] where firstly column generation technique and CPA have been combined for the CSP with identical stock material pieces. In order to ensure efficient implementation of the generation problems in case of no and of additional cutting planes, some modifications of known methods have been performed. The efficiency of the algorithm is demonstrated by extensive numerical results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Belov G., Scheithauer G. (2000) Solving the general one-dimensional cutting stock problem with a cutting plane approach. Technical Report MATH-NM-11–2000, Dresden University of Technology
Degraeve Z., Peeters M. (2000) Optimal integer solutions to industrial cutting stock problems: Part 2, Benchmark Results. Technical Report, Katholieke Universiteit Leuven
Dyckhoff H., Scheithauer G., Terno J. (1997) Cutting and packing, in: M. Dell’Amico, F. Maffioli, S. Martello (eds), Annotated Bibliographies in Combinatorial Optimization, ch. 22, 393–412, John Wiley & Sons, Chichester
Gilmore P.C., Gomory R.E. (1963) A linear programming approach to the cutting-stock problem (Part II). Operetions Research 11:863–887
Kupke J. (1998) Lösung von ganzzahligen Verschnittproblemen mit Branch-and-Price. Diplomarbeit, Universität zu Köln
Marcotte O. (1986) An instance of the cutting stock problem for which the rounding property does not hold. OR Letters 4(5):239–243
Martello S., Toth P. (1990) Knapsack Problems — Algorithms and Computer Implementations. John Wiley & Sons, Chichester et al.
Nemhauser G.L., Wolsey L.A. (1988) Integer and Combinatorial Optimization. John Wiley & Sons, New York
Nitsche C., Scheithauer G., Terno J. Tighter relaxations for the cutting stock problem. European Journal of Operational Research 112/3:654–663
Scheithauer G., Terno J. (1995) The modified integer round-up property of the one-dimensional cutting stock problem. European Journal of Operational Research 84:562–571
Scheithauer G., Terno J. (1995) A branch-and-bound algorithm for solving one-dimensional cutting stock problems exactly. Applicationes Mathematicae 23.2:151–167
Scheithauer G., Terno J., Müller A., Belov G. (1999) Solving one-dimensional cutting stock problems exactly with a cutting plane algorithm. Technical Report MATH-NM-06–1999, Dresden Univ. of Technology (to appear in JORS)
Schwerin P., Wäscher G. (1999) A new lower bound for the bin-packing problem and its integration to MTP. Pesquisa Operational, Vol.19, No.2, 111–130
Terno J., Lindemann R., Scheithauer G. (1987) Zuschnittprobleme und ihre praktische Lösung. Verlag Harri Deutsch Thun und Frankfurt/Main
Vance F. (1998) Branch-and-price algorithms for the one-dimensional cutting stock problem. Computational Optimization and Applications 9(3), 212–228
Vanderbeck F. (1000) Computational study of a column generation algorithm for bin packing and cutting stock problems. Mathematical Programming 86, Ser.A, 565–594
Wäscher G., Gau T. (1996) Heuristics for the one-dimensional cutting stock problem: a computational study. OR Spektrum 18:131–144
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Scheithauer, G., Belov, G. (2002). Solving One-Dimensional Cutting Stock Problems with Multiple Stock Material Lengths Using Cutting Plane Approach. In: Chamoni, P., Leisten, R., Martin, A., Minnemann, J., Stadtler, H. (eds) Operations Research Proceedings 2001. Operations Research Proceedings 2001, vol 2001. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-50282-8_36
Download citation
DOI: https://doi.org/10.1007/978-3-642-50282-8_36
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43344-6
Online ISBN: 978-3-642-50282-8
eBook Packages: Springer Book Archive