Combinatorial benders' cuts for the strip packing problem

Operations Research

Volumn 62, Issue 3, 2014, Pages 643-661

  Côté, Jean François ^a   Dell'Amico, Mauro ^b   Iori, Manuel ^b  

^a UNIVERSITÉ LAVAL   (Canada)

^b UNIVERSITY OF MODENA AND REGGIO EMILIA   (Italy)

Author keywords

Benders' decomposition; Combinatorial Benders' cut; Exact algorithm; Strip packing problem

Indexed keywords

BENCHMARKING; COMPUTATIONAL COMPLEXITY; SCHEDULING;

BENDERS' DECOMPOSITIONS; COMBINATORIAL BENDERS' CUT; COMPUTATIONAL EFFORT; COMPUTATIONAL TESTS; CONTAINER-LOADING PROBLEMS; EXACT ALGORITHMS; STRIP PACKING PROBLEM; TWO-DIMENSIONAL RECTANGULAR;

HEURISTIC ALGORITHMS;

EID: 84902994397     PISSN: 0030364X     EISSN: 15265463     Source Type: Journal    
DOI: 10.1287/opre.2013.1248     Document Type: Article

References (41)

1. Alvarez-Valdes R, Parreño F, Tamarit J (2008) Reactive grasp for the strip-packing problem. Comput. Oper. Res. 35:1065-1083. (Pubitemid 47404761)
2. Alvarez-Valdes R, Parreño F, Tamarit J (2009) A branch and bound algorithm for the strip packing problem. OR Spectrum 31:431-459.
3. Arahori Y, Imamichi T, Nagamochi H (2012) An exact strip packing algorithm based on canonical forms. Comput. Oper. Res. 39:2991-3011.
4. Augustine J, Banerjee S, Irani S (2009) Strip packing with precedence constraints and strip packing with release times. Theoret. Comput. Sci. 410:3792-3803.
5. Beasley JE (1985) Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. 36:297-306. (Pubitemid 15513982)
6. Bekrar A, Kacem I, Chu C (2007) A comparative study of exact algorithms for the two dimensional strip packing problem. J. Indust. Systems Engrg. 1:151-170.
7. Belov G, Rohling H (2013) LP bounds in an interval-graph algorithm for orthogonal-packing feasibility. Oper. Res. 61:483-497.
8. Benders JF (1962) Partitioning procedures for solving mixed variables programming problems. Numerische Mathematik 4:238-252.
9. Berkey JO, Wang PY (1987) Two dimensional finite bin packing algorithms. J. Oper. Res. Soc. 38:423-429.
10. Boschetti MA, Montaletti L (2010) An exact algorithm for the twodimensional strip-packing problem. Oper. Res. 58:1774-1791.
11. Burke EK, Hyde MR, Kendall G (2011) A squeaky wheel optimization methodology for two-dimensional strip packing. Comput. Oper. Res. 38:1035-1044.
12. Burke EK, Kendall G, Whitwell G (2004) A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. 52:655-671.
13. Caprara A, Monaci M (2009) Bidimensional packing by bilinear programming. Math. Programming 118:75-108.
14. Castro PM, Oliveira JF (2011) Scheduling inspired models for twodimensional packing problems. Eur. J. Oper. Res. 215:45-56.
15. Christofides N, Whitlock C (1977) An algorithm for two-dimensional cutting problems. Oper. Res. 25:30-44.
16. Clautiaux F, Carlier J, Moukrim A (2007) A new exact method for the two-dimensional orthogonal packing problem. Eur. J. Oper. Res. 183:1196-1211.
17. Codato G, Fischetti M (2006) Combinatorial Benders' cuts for mixedinteger linear programming. Oper. Res. 54:756-766. (Pubitemid 44521585)
18. Geoffrion AM (1972) Generalized Benders decomposition. J. Optim. Theory Appl. 10 (4):237-260.
19. Gilmore PC, Gomory RE (1961) A linear programming approach to the cutting-stock problem. Oper. Res. 9:849-859.
20. Gilmore PC, Gomory RE (1965) Multistage cutting stock problems of two and more dimensions. Oper. Res. 13:94-120.
21. Grandcolas S, Pinto C (2010) A SAT encoding for multi-dimensional packing problems. Lodi A, Milano M, Toth P, eds. Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, Lecture Notes in Computer Science, Vol. 6140 (Springer, Berlin, Heidelberg), 141-146.
22. Harren R, Jansen K, Prädel L, Van Stee R (2011) A (5/3+ ε)-approximation for strip packing. Dehne F, Iacono J, Sack JR, eds. Proc. 12th Internat. Conf. Algorithms and Data Structures, WADS'11 (Springer- Verlag, Berlin, Heidelberg), 475-487.
23. Herz JC (1972) Recursive computational procedure for two-dimensional stock cutting. IBM J. Res. Development 16:462-469.
24. Hooker JN (2000) Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (John Wiley & Sons, New York).
25. Hooker JN (2007) Planning and scheduling by logic-based Benders decomposition. Oper. Res. 55:588-602. (Pubitemid 351159511)
26. Hooker JN, Ottosson G (2003) Logic-based Benders decomposition. Math. Programming 96:33-60. (Pubitemid 44757847)
27. Iori M, Salazar González JJ, Vigo D (2007) An exact approach for the vehicle routing problem with two-dimensional loading constraints. Transportation Sci. 41:253-264.
28. Jain V, Grossmann IE (2001) Algorithms for hybrid MILP/CP models for a class of optimization problems. INFORMS J. Comput. 13:258-276. (Pubitemid 33645944)
29. Jansen K, Solis-Oba R (2009) Rectangle packing with one-dimensional resource augmentation. Discrete Optim. 6:310-323.
30. Kenmochi M, Imamichi T, Nonobe K, Yagiura M, Nagamochi H (2009) Exact algorithms for the two-dimensional strip packing problem with and without rotations. Eur. J. Oper. Res. 198:73-83.
31. Kenyon C, Rémila E (2000) A near-optimal solution to a two-dimensional cutting stock problem. Math. Oper. Res. 25:645-656.
32. Lesh N, Marks J, McMahon A, Mitzenmacher M (2004) Exhaustive approaches to 2D rectangular perfect packings. Inform. Processing Lett. 90:7-14.
33. Leung SCH, Zhang D, Sim KM (2011) A two-stage intelligent search algorithm for the two-dimensional strip packing problem. Eur. J. Oper. Res. 215:57-69.
34. Martello S, Vigo D (1998) Exact solution of the two-dimensional finite bin packing problem. Management Sci. 44:388-399. (Pubitemid 128568186)
35. Martello S, Monaci M, Vigo D (2003) An exact approach to the strip packing problem. INFORMS J. Comput. 15:310-319. (Pubitemid 39042723)
36. Martello S, Pisinger D, Toth P (1999) Dynamic programming and strong bounds for the 0-1 knapsack problem. Management Sci. 45:414-424.
37. Mesyagutov MA, Mukhacheva EA, Belov GN, Scheithauer G (2011) Packing of one-dimensional bins with contiguous selection of identical items: An exact method of optimal solution. Automation and Remote Control 72:141-159.
38. Sawaya NW, Grossmann IE (2005) A cutting plane method for solving linear generalized disjunctive programming problems. Comput. Chemical Engrg. 29:1891-1913.
39. Soh T, Inoue K, Tamura N, Banbara M, Nabeshima H (2010) A SATbased method for solving the two-dimensional strip packing problem. Fundamenta Informaticae 102:467-487.
40. Wei L, Oon W-C, Zhu W, Lim A (2011) A skyline heuristic for the 2D rectangular packing and strip packing problems. Eur. J. Oper. Res. 215:337-346.
41. Westerlund J, Papageorgiou LG, Westerlund T (2007) A MILP model for N-dimensional allocation. Comput. Chemical Engrg. 31:1702-1714.