Skip to main content
SpringerLink
Log in

Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem

  • S.I.: CLAIO 2014
  • Published:
Annals of Operations Research Aims and scope Submit manuscript

Abstract

In this work we present a new generalized disjunctive programming (GDP) formulation for the strip packing problem. The new formulation helps to break some of the symmetry that arises in this problem. The new formulation is further improved for the case in which the heights and lengths of the rectangles are integer numbers. The GDP model can be formulated and solved as a mixed-integer linear programming (MILP) model, using different GDP-to-MILP reformulations. The results show that the MILP reformulations of the new GDP model (and its improvement for rectangles with integer heights and widths) can be solved faster than the previously proposed GDP formulation.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7

Similar content being viewed by others

References

  • Alvarez-Valdes, R., Parreno, F., & Tamarit, J. (2009). A branch and bound algorithm for the strip packing problem. OR Spectrum, 31, 431–459.

    Article  Google Scholar 

  • Balas, E. (1979). Disjunctive programming. Annals of Discrete Mathematics, 5, 3–51.

    Article  Google Scholar 

  • Brooke, A., Kendrick, D., & Meeraus, A. (1998). Raman GAMS, a users guide. Redwood City: The Scientific Press.

    Google Scholar 

  • Castro, P. M., & Grossmann, I. E. (2012). From time representation in scheduling to the solution of strip packing problems. Computers and Chemical Engineering, 44, 45–57.

    Article  Google Scholar 

  • Castro, P. M., & Oliveira, J. F. (2011). Scheduling inspired models for two-dimensional packing problems. European Journal of Operational Research, 215, 45–56.

    Article  Google Scholar 

  • Grossmann, I. E., & Lee, S. (2003). Generalized disjunctive programming: Nonlinear convex hull relaxation and algorithms. Computational Optimization and Applications, 26, 83–100.

  • Grossmann, I. E., & Trespalacios, F. (2013). Systematic modeling of discrete-continuous optimization models through generalized disjunctive programming. AIChE Journal, 59, 3276–3295.

    Article  Google Scholar 

  • Lee, S., & Grossmann, I. E. (2000). New algorithms for nonlinear generalized disjunctive programming. Computers and Chemical Engineering, 24, 2125–2141.

    Article  Google Scholar 

  • Lodi, A., Martello, S., & Vigo, D. (1999). Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS Journal on Computing, 11, 345–357.

    Article  Google Scholar 

  • Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141, 241–252.

    Article  Google Scholar 

  • Margot, F. (2010). In 50 years of Iinteger programming 1958–2008 (pp. 647–686). Berlin: Springer.

    Google Scholar 

  • Martello, S., Monaci, M., & Vigo, D. (2003). An exact approach to the strip-packing problem. INFORMS Journal on Computing, 15, 310–319.

    Article  Google Scholar 

  • Optimization, G. et al. (2012). Gurobi optimizer reference manual. URL: http://www.gurobi.com

  • Raman, R., & Grossmann, I. E. (1994). Modelling and computational techniques for logic based integer programming. Computers and Chemical Engineering, 18, 563–578.

    Article  Google Scholar 

  • Sawaya, N. W., & Grossmann, I. E. (2005). A cutting plane method for solving linear generalized disjunctive programming problems. Computers and Chemical Engineering, 29, 1891–1913.

    Article  Google Scholar 

  • Trespalacios, F., & Grossmann, I. E. (2014). Review of mixed-integer nonlinear and generalized disjunctive programming methods. Chemie Ingenieur Technik, 86, 991–1012.

    Article  Google Scholar 

  • Trespalacios, F., & Grossmann, I. E. (2015). Improved Big-M reformulation for generalized disjunctive programs. Computers and Chemical Engineering, 76, 98–103.

    Article  Google Scholar 

  • Wäscher, G., Haußner, H., & Schumann, H. (2007). An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109–1130.

    Article  Google Scholar 

  • Westerlund, J., Papageorgiou, L. G., & Westerlund, T. (2007). A MILP model for N-dimensional allocation. Computers and Chemical Engineering, 31, 1702–1714.

    Article  Google Scholar 

  • Wolsey, L. A., & Nemhauser, G. L. (2014). Integer and combinatorial optimization. Hoboken: Wiley.

    Google Scholar 

Download references

Acknowledgments

The authors would like to acknowledge financial support from the Center for Advanced Process Decision-making (CAPD).

Author information

Authors and Affiliations

  1. Department of Chemical Engineering, Carnegie Mellon University, 5000 Forbes Avenue, Pittsburgh, PA, 15213, USA

    Francisco Trespalacios & Ignacio E. Grossmann

Authors
  1. Francisco Trespalacios
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ignacio E. Grossmann
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ignacio E. Grossmann.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Trespalacios, F., Grossmann, I.E. Symmetry breaking for generalized disjunctive programming formulation of the strip packing problem. Ann Oper Res 258, 747–759 (2017). https://doi.org/10.1007/s10479-016-2112-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10479-016-2112-9

Keywords

Search

Navigation