Skip to main content
SpringerLink
Log in

A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem

  • Conference paper
  • First Online:
Operations Research Proceedings 2015

Part of the book series: Operations Research Proceedings ((ORP))

Abstract

We consider the 3-staged Strip Packing Problem, in which rectangular items have to be arranged onto a rectangular strip of fixed width, such that the items can be obtained by three stages of guillotine cuts while the required strip height is to be minimized. We propose a new logic-based Benders decomposition with two kinds of Benders cuts and compare it with a compact integer linear programming formulation.

The authors thank Christina Büsing from TU Wien for her support on this paper.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. Baker, B.S., Coffman Jr., E.G., Rivest, R.L.: Orthogonal packings in two dimensions. SIAM J. Comput. 9(4), 846–855 (1980)

    Article  Google Scholar 

  2. Côté, J.F., Dell’Amico, M., Iori, M.: Combinatorial benders’ cuts for the strip packing problem. Operations Research 62(3), 643–661 (2014)

    Article  Google Scholar 

  3. Graham, R.L., Lawler, E.L., Lenstra, J.K., Kan, A.R.: Optimization and approximation in deterministic sequencing and scheduling: a survey. Ann. Discret. Math. 5, 287–326 (1979)

    Article  Google Scholar 

  4. Hifi, M.: Exact algorithms for the guillotine strip cutting/packing problem. Computers & Operations Research 25(11), 925–940 (1998)

    Article  Google Scholar 

  5. Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Math. Program. 96(1), 33–60 (2003)

    Article  Google Scholar 

  6. Lodi, A., Martello, S., Vigo, D.: Models and bounds for two-dimensional level packing problems. J. Comb Optim. 8(3), 363–379 (2004)

    Article  Google Scholar 

  7. Puchinger, J., Raidl, G.R.: Models and algorithms for three-stage two-dimensional bin packing. Eur. J. Oper. Res. 183(3), 1304–1327 (2007)

    Article  Google Scholar 

  8. Puchinger, J., Raidl, G.R., Koller, G.: Solving a real-world glass cutting problem. Evolutionary Computation in Combinatorial Optimization, pp. 162–173. Springer, Berlin (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Computer Graphics and Algorithms, Tu Wien, Favoritenstraße 9–11, Vienna, Austria

    Johannes Maschler & Günther R. Raidl

Authors
  1. Johannes Maschler
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Günther R. Raidl
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Johannes Maschler .

Editor information

Editors and Affiliations

  1. Department of Business Administration, University of Vienna, Vienna, Austria

    Karl Franz Dörner

  2. Decision Sciences and Statistics (IDS) Department, ESSEC Business School of Paris, Cergy Pontoise Cedex, France

    Ivana Ljubic

  3. Department of Statistics and Operations Research, University of Vienna, Vienna, Austria

    Georg Pflug

  4. Operations Research and Control Systems, TU Wien, Vienna, Austria

    Gernot Tragler

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing Switzerland

About this paper

Cite this paper

Maschler, J., Raidl, G.R. (2017). A Logic-Based Benders Decomposition Approach for the 3-Staged Strip Packing Problem. In: Dörner, K., Ljubic, I., Pflug, G., Tragler, G. (eds) Operations Research Proceedings 2015. Operations Research Proceedings. Springer, Cham. https://doi.org/10.1007/978-3-319-42902-1_53

Download citation

Publish with us

Policies and ethics

Search

Navigation