(Baker et al., 19804 BAKER BS, COFFMAN JR EG & RIVEST RL. 1980. Orthogonal packings in two dimensions. SIAM Journal on Computing, 9(4): 846-855.) |
(Jakobs, 199631 JAKOBS S. 1996. On genetic algorithms for the packing of polygons. European Journal of Operational Research, 88(1): 165-181.) |
GA |
(Alvarez-Valdes et al., 20051 ALVAREZ-VALDES R, PARREÑO F & TAMARIT JM. 2005. A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems. Journal of the Operational Research Society, 56(4): 414-425.) |
GRASP |
(Coffman Jr et al., 198020 COFFMAN JR EG, GAREY MR, JOHNSON DS & TARJAN RE. 1980. Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4): 808-826.) |
(Hopper & Turton, 199926 HOPPER E & TURTON B. 1999. A genetic algorithm for a 2D industrial packing problem. Computers and Industrial Engineering, 37(1985): 375-378.) |
GA |
(Bortfeldt, 20069 BORTFELDT A. 2006. A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces. European Journal of Operational Research, 172(3): 814-837.) |
GA |
(Chazelle, 198317 CHAZELLE B. 1983. The bottomn-left bin-packing heuristic: An efficient implementation. Computers, IEEE Transactions on, 100(8): 697-707.) |
(Liu & Teng, 199935 LIU D & TENG H. 1999. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of Operational Research, 112(2): 413-420.) |
GA |
(Zhang et al., 200762 ZHANG D-F, CHEN S-D & LIU Y-J. 2007. An Improved Heuristic Recursive Strategy Based on Genetic Algorithm for the Strip Rectangular Packing Problem. Acta Automatica Sinica, 33(9): 911-916.) |
GA |
(Berkey & Wang, 19877 BERKEY JO & WANG PY. 1987. Two-dimensional finite bin-packing algorithms. Journal of the Operational Research Society, 38(5): 423-429.) |
(Hopper & Turton, 2001b28 HOPPER E & TURTON BCH. 2001b. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, 128: 34-57.) |
GA; SA; NE; LS |
(Alvarez-Valdés et al., 20082 ALVAREZ-VALDÉS R, PARREÑO F & TAMARIT JM. 2008. Reactive grasp for the strip-packing problem. Computers & Operations Research, 35(4): 1065-1083.) |
GRASP |
(Burke et al., 200415 BURKE EK, KENDALL G & WHITWELL G. 2004. A New Placement Heuristic for the Orthogonal Stock-Cutting Problem. Operations Research, 52(4): 655-671.) |
(Hadjiconstantinou & Iori, 200725 HADJICONSTANTINOU E & IORI M. 2007. A hybrid genetic algorithm for the two-dimensional single large object placement problem. European Journal of Operational Research, 183(3): 1150-1166.) |
GA |
(Neveu et al., 200841 NEVEU B, TROMBETTONI G, ARAYA I & RIFF M-C. 2008. A Strip Packing Solving Method Using an Incremental Move Based on Maximal Holes. International Journal on Artificial Intelligence Tools, 17(5): 881-901.) |
LS |
(Zhang et al., 200663 ZHANG D, KANG Y & DENG A. 2006. A new heuristic recursive algorithm for the strip rectangular packing problem. Computers and Operations Research, 33(8): 2209-2217.) |
(Pisinger, 200746 PISINGER D. 2007. Denser packings obtained in o (n log log n) time. INFORMS Journal on Computing, 19(3): 395-405.) |
SA |
|
|
(Ntene, 200742 NTENE N. 2007. An algorithmic approach to the 2D oriented strip packing problem, PhD thesis, Department of Logistics, University of Stellenbosch.) |
(Belov et al., 20086 BELOV G, SCHEITHAUER G & MUKHACHEVA EA. 2008. One-dimensional heuristics adapted for two-dimensional rectangular strip packing. Journal of the Operational Research Society, 59(6): 823-832.) |
SVC |
|
|
(Cui et al., 200822 CUI Y, YANG Y, CHENG X & SONG P. 2008. A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem. Computers and Operations Research, 35(4): 1281-1291.) |
(Salto et al., 200848 SALTO C, ALBA E, MOLINA JM & LEGUIZAMÓN G. 2008. Greedy seeding procedure for GAs solving a strip packing problem. Inteligencia Artificial, 12(40): 73-85.) |
GA |
|
|
(Aşik & Özcan, 20093 AŞIK ÖB & ÖZCAN E. 2009. Bidirectional best-fit heuristic for orthogonal rectangular strip packing. Annals of Operations Research, 172(1): 405-427.) |
(Burke et al., 200916 BURKE EK, KENDALL G & WHITWELL G. 2009. A simulated annealing enhancement of the best-fit heuristic for the orthogonal stock-cutting problem. INFORMS Journal on Computing, 21(3):505-516.) |
SA |
|
|
(Imahori & Yagiura, 201030 IMAHORI S & YAGIURA M. 2010. The best-fit heuristic for the rectangular strip packing problem: An efficient implementation and the worst-case approximation ratio. Computers and Operations Research, 37(2): 325-333.) |
(Wei et al., 200958 WEI L, ZHANG D & CHEN Q. 2009. A least wasted first heuristic algorithm for the rectangular packing problem. Computers and Operations Research, 36(5): 1608-1614.) |
LS |
|
|
(Ortmann et al., 201044 ORTMANN FG, NTENE N & VAN VUUREN JH. 2010. New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems. European Journal of Operational Research, 203(2): 306-315.) |
(Burke et al., 201013 BURKE EK, HYDE M, KENDALL G & WOODWARD J. 2010. A genetic programming hyper-heuristic approach for evolving 2-D strip packing heuristics. IEEE Transactions on Evolutionary Computation, 14(6): 942-958.) |
HH; GA |
|
|
(Kotov & Cao, 201132 KOTOV VM & CAO D. 2011. A heuristic algorithm for the non-oriented 2d rectangular strip packing problem. Buletinul Academiei de Ştiinţe a Republicii Moldova. Matematica, 66(2): 81-88.) |
(Burke et al., 201114 BURKE EK, HYDE MR & KENDALL G. 2011. A squeaky wheel optimisation methodology for two-dimensional strip packing. Computers and Operations Research, 38(7): 1035-1044.) |
LS |
|
|
(Bortfeldt & Jungmann, 201211 BORTFELDT A & JUNGMANN S. 2012. A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint. Annals of Operations Research, 196(1):53-71.) |
(Leung & Zhang, 201134 LEUNG SCH, ZHANG D & SIM KM. 2011. A two-stage intelligent search algorithm for the two-dimensional strip packing problem. European Journal of Operational Research, 215(1): 57-69.) |
SA; LS |
|
|
(Cui et al., 201321 CUI Y, YANG L & CHEN Q. 2013. Heuristic for the rectangular strip packing problem with rotation of items. Computers and Operations Research, 40(4): 1094-1099.) |
(Leung et al., 201133 LEUNG SCH & ZHANG D. 2011. A fast layer-based heuristic for non-guillotine strip packing. Expert Systems with Applications, 38(10): 13032-13042.) |
LS |
|
|
(Özcan et al., 201345 ÖZCAN E, KAI Z & DRAKE JH. 2013. Bidirectional best-fit heuristic considering compound placement for two dimensional orthogonal rectangular strip packing. Expert Systems with Applications, 40(10): 4035-4043.) |
(Wei et al., 201155 WEI L, OON WC, ZHU W & LIM A. 2011. A skyline heuristic for the 2D rectangular packing and strip packing problems. European Journal of Operational Research, 215(2): 337-346.) |
TS |
|
|
(Verstichel et al., 201352 VERSTICHEL J, DE CAUSMAECKER P & BERGHE GV. 2013. An improved best-fit heuristic for the orthogonal strip packing problem. International Transactions in Operational Research, 20(5): 711-730.) |
(Chen et al., 201219 CHEN J, ZHU W & PENG Z. 2012. A heuristic algorithm for the strip packing problem. Journal of Heuristics, 18(4): 677-697.) |
LS |
|
|
(Buchwald & Scheithauer, 201612 BUCHWALD T & SCHEITHAUER G. 2016. Upper bounds for heuristic approaches to the strip packing problem. International Transactions in Operational Research, 23(1-2): 93-119.) |
(Yang et al., 201359 YANG S, HAN S & YE W. 2013. A simple randomized algorithm for two-dimensional strip packing. Computers and Operations Research, 40(1): 1-8.) |
SA |
|
|
(Wei, Tian, Zhu & Lim, 201457 WEI L, TIAN T, ZHU W & LIM A. 2014. A block-based layer building approach for the 2d guillotine strip packing problem. European Journal of Operational Research, 239(1): 58-69.) |
(Wauters et al., 201354 WAUTERS T, VERSTICHEL J & VANDEN BERGHE G. 2013. An effective shaking procedure for 2D and 3D strip packing problems. Computers and Operations Research, 40(11): 2662-2669.) |
ShP |
|
|
(Zhang, Shi, Leung & Wu, 201664 ZHANG D, SHI L, LEUNG SC & WU T. 2016. A priority heuristic for the guillotine rectangular packing problem. Information Processing Letters, 116(1): 15-21.) |
(Zhang et al., 201365 ZHANG D, WEI L, CHEN Q & LEUNG SCH. 2013. A Binary Search Heuristic Algorithm based on Randomized Local Search for the Rectangular Strip Packing Problem. INFORMS Journal on Computing, 25(2): 332-345.) |
LS |
|
|
|
(Borgulya, 20148 BORGULYA I. 2014. A parallel hyper-heuristic approach for the two-dimensional rectangular strip-packing problem. Journal of Computing and Information Technology, 22(4): 251-265.) |
HH; GA; LS |
|
|
|
(Thomas & Chaudhari, 201451 THOMAS J & CHAUDHARI NS. 2014. A new metaheuristic genetic-based placement algorithm for 2D strip packing. Journal of Industrial Engineering International, 10(1): 1-16.) |
GA |
|
|
|
(Wei, Qin, Cheang & Xu, 201457 WEI L, TIAN T, ZHU W & LIM A. 2014. A block-based layer building approach for the 2d guillotine strip packing problem. European Journal of Operational Research, 239(1): 58-69.) |
LS |
|
|
|
(Chen et al., 201518 CHEN B, WANG Y & YANG S. 2015. A Hybrid Demon Algorithm for the Two-Dimensional Orthogonal Strip Packing Problem. Mathematical Problems in Engineering, 2015: 14 pp.) |
LS |
|
|
|
(Zhang, Che, Ye, Si & Leung, 201664 ZHANG D, SHI L, LEUNG SC & WU T. 2016. A priority heuristic for the guillotine rectangular packing problem. Information Processing Letters, 116(1): 15-21.) |
VNS; LS |
|
|