A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

References

• Alvarez-Valdes R, Parreño F, Tamarit JM. Reactive GRASP for the strip-packing problem. Comput. Oper. Res. (2008) 35:1065–1083Crossref, Google Scholar
• Baker BS, Coffman EG, Rivest RL. Orthogonal packing in two dimensions. SIAM J. Comput. (1980) 9(4):846–855Crossref, Google Scholar
• Beasley JE. Algorithms for unconstrained two-dimensional guillotine cutting. J. Oper. Res. Soc. (1985) 36:297–306Crossref, Google Scholar
• Beasley JE. OR-Library. (1990) . http://people.brunel.ac.uk/~mastjjb/jeb/info.htmlGoogle Scholar
• Bengtsson BE. Packing rectangular pieces—A heuristic approach. Comput. J. (1982) 25:353–357Crossref, Google Scholar
• Bortfeldt A. A genetic algorithm for the two-dimensional strip-packing problem with rectangular pieces. Eur. J. Oper. Res. (2006) 172(3):814–837Crossref, Google Scholar
• Burke EK, Kendall G, Whitwell G. A new placement heuristic for the orthogonal stock-cutting problem. Oper. Res. (2004) 52(4):655–671Link, Google Scholar
• Burke EK, Kendall G, Whitwell G. A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS J. Comput. (2009) 21(3):505–516Link, Google Scholar
• Chazelle B. The bottom-left bin packing heuristic: An efficient implementation. IEEE Trans. Comput. (1983) 32(8):697–707Crossref, Google Scholar
• Cui Y, Yang Y, Cheng X, Song P. A recursive branch-and-bound algorithm for the rectangular guillotine strip-packing problem. Comput. Oper. Res. (2008) 35(4):1281–1291Crossref, Google Scholar
• Dagli CH, Poshyanonda P. New approaches to nesting rectangular patterns. J. Intelligent Manufacturing (1997) 3(3):177–190Crossref, Google Scholar
• Dowsland KA, Dowsland WB. Packing problems. Eur. J. Oper. Res. (1992) 56(1):2–14Crossref, Google Scholar
• Dowsland KA. Some experiments with simulated annealing techniques for packing problems. Eur. J. Oper. Res. (1993) 68:389–399Crossref, Google Scholar
• Dowsland KA, Herbert E, Kendall G, Burke E. Using tree-search bounds to enhance a genetic algorithm approach to two rectangle packing problems. Eur. J. Oper. Res. (2006) 168:390–402Crossref, Google Scholar
• Hifi M. The strip cutting/packing problem: Incremental substrip algorithms-based heuristics. Pesquisa Operacional, Special Issue on Cutting and Packing Problems (1999) 19(2):169–188Google Scholar
• Hifi M, M'Hallah R. A hybrid algorithm for the two-dimensional layout problem: The cases of regular and irregular shapes. Internat. Trans. Oper. Res. (2003) 10:1–22Crossref, Google Scholar
• Hopper E, Turton BCH. An empirical investigation of metaheuristic and heuristic algorithms for a 2D packing problem. Eur. J. Oper. Res. (2001) 128:34–57Crossref, Google Scholar
• Huang W, Chen D, Xu R. A new heuristic algorithm for rectangle packing. Comput. Oper. Res. (2007) 34(11):3270–3280Crossref, Google Scholar
• Kröger B. Guillotinable bin packing: A genetic approach. Eur. J. Oper. Res. (1995) 84(3):645–661Crossref, Google Scholar
• Liu D, Teng H. An improved BL-algorithm for genetic algorithms of the orthogonal packing of rectangles. Eur. J. Oper. Res. (1999) 112(2):413–420Crossref, Google Scholar
• Lodi A, Martello S, Monaci M. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. (2002) 141(2):241–252Crossref, Google Scholar
• Lodi A, Martello S, Vigo D. Heuristic and metaheuristic approaches for a class of two-dimensional bin packing problems. INFORMS J. Comput. (1999) 11(4):345–357Link, Google Scholar
• Martello S, Pisinger D, Vigo D. The three-dimensional bin packing problem. Oper. Res. (2000) 48:256–267Link, Google Scholar
• Martello S, Monaci M, Vigo D. An exact approach to the strip-packing problem. INFORMS J. Comput. (2003) 15(3):310–319Link, Google Scholar
• Oliveira JFC, Ferreira JAS, Vidal RVV. Algorithms for nesting problems. Applied Simulated Annealing, LNEMS 396 (1993) (Springer)255–274Crossref, Google Scholar
• Pinto E, Oliveira JF. Algorithm based on graphs for the non-guillotinable two-dimensional packing problem. (2005) Second ESICUP MeetingSouthamptonGoogle Scholar
• Pisinger D. Heuristics for the container loading problem. Eur. J. Oper. Res. (2002) 141(2):382–392Crossref, Google Scholar
• Ramesh Babu A, Ramesh Babu N. Effective nesting of rectangular parts in multiple rectangular sheets using genetic and heuristic algorithms. Internat. J. Productions Res. (1999) 37(7):1625–1643Crossref, Google Scholar
• Valenzuela CL, Wang PY. Heuristics for large strip packing problems with guillotine patterns: An empirical study. Proc. 4th Metaheuristics Internat. Conf. (2001) 417–421Google Scholar
• Wäscher G, Haußner H, Schumann H. An improved typology of cutting and packing problems. Eur. J. Oper. Res. (2007) 183:1109–1130Crossref, Google Scholar
• Wu Y, Huang W, Lau S, Wong CK, Young GH. An effective quasi-human based heuristic for solving the rectangle packing problem. Eur. J. Oper. Res. (2002) 141(2):341–358Crossref, Google Scholar
• Zhang D, Kang Y, Deng A. A new heuristic recursive algorithm for the strip rectangular packing problem. Comput. Oper. Res. (2006) 33(8):2209–2217Crossref, Google Scholar
• Zhang D, Liu Y, Chen S, Xie X. A metaheuristic algorithm for the strip rectangular packing problem. Lecture Notes in Comput. Sci. (2005) 3612:1235–1241Crossref, Google Scholar