[1]
|
A. Lodi, S. Martello and M. Monaci, Two-dimensional packing problems: A survey, European Journal of Operational Research, 141 (2002), 241-252.
doi: 10.1016/S0377-2217(02)00123-6.
|
[2]
|
K. A. Dowsland and W. B. Dowsland, Packing problems, European Journal of Operational Research, 56 (1992), 2-14.
|
[3]
|
H. F. Lee and E. C. Sewell, The strip-packing problem for a boat manufacturing firm, IIE Transactions, 31 (1999), 639-651.
doi: 10.1080/07408179908969865.
|
[4]
|
D. S. Hochbaum and W. Maass, Approximation schemes for covering and packing problems in image processing and VLSI, Journal of the Association for Computing Machinery, 32 (1985), 130-136.
doi: 10.1145/2455.214106.
|
[5]
|
B. S. Baker, Jr. E. G. Coffman and R. L. Rivest, Orthogonal packing in two dimensions, SIAM Journal on Computing, 9 (1980), 846-855.
doi: 10.1137/0209064.
|
[6]
|
B. Chazelle, The bottom-left bin packing heuristic: An efficient implementation, IEEE Transactions on Computers, 32 (1983), 697-707.
doi: 10.1109/tc.1983.1676307.
|
[7]
|
S. Jakobs, On genetic algorithms for the packing of polygons, European Journal of Operational Research, 88 (1996), 165-181.
doi: 10.1016/0377-2217(94)00166-9.
|
[8]
|
D. Q. Liu and H. F. Teng, An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles, European Journal of Operational Research, 112 (1999), 413-420.
doi: 10.1016/S0377-2217(97)00437-2.
|
[9]
|
E. Hopper and B. Turton, An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem, European Journal of Operational Research, 128 (2001), 34-57.
doi: 10.1016/S0377-2217(99)00357-4.
|
[10]
|
Y. L. Wu, W. Q. Huang, S. C. Lau, C. K. Wong and G. H. Young, An effective quasi-human based heuristic for solving the rectangle packing problem, European Journal of Operational Research, 141 (2002), 341-358.
doi: 10.1016/S0377-2217(02)00129-7.
|
[11]
|
W. Q. Huang and D. B. Chen, An efficient heuristic algorithm for rectangle-packing problem, Simulation Modelling Practice and Theory, 15 (2007), 1356-1365.
|
[12]
|
D. F. Zhang, Y. Kang and A. S. Deng, A new heuristic recursive algorithm for the strip rectangular packing problem, Computers & Operations Research, 33 (2006), 2209-2217.
|
[13]
|
L. J. Wei, D. F. Zhang and Q. S. Chen, A least wasted first heuristic algorithm for the rectangular packing problem, Computers & Operations Research, 36 (2009), 1608-1614.
doi: 10.1016/j.cor.2008.03.004.
|
[14]
|
R. Alvarez-Valdes, F. Parreño and J. M. Tamarit, Reactive GRASP for the strip-packing problem, Computers & Operations Research, 35 (2008), 1065-1083.
doi: 10.1016/j.cor.2006.07.004.
|
[15]
|
K. He, W. Q. Huang and Y. Jin, An efficient deterministic heuristic for two-dimensional rectangular packing, Computers & Operations Research, 39 (2012), 1355-1363.
doi: 10.1016/j.cor.2011.08.005.
|
[16]
|
W. S. Xiao, L. Wu, X. Tian and J. L. Wang, Applying a new adaptive genetic algorithm to study the layout of drilling equipment in semisubmersible drilling platforms, Mathematical Problems in Engineering, 2015 (2015), Article ID 146902, 9 pages.
doi: 10.1155/2015/146902.
|
[17]
|
L. Wu, L. Zhang, W.S. Xiao, Q. Liu, C. Mu and Y.W. Yang, A novel heuristic algorithm for two-dimensional rectangle packing area minimization problem with central rectangle, Computers & Industrial Engineering, 102 (2016), 208-218.
doi: 10.1016/j.cie.2016.10.011.
|
[18]
|
E. K. Burke, G. Kendall and G. Whitwell, A new placement heuristic for the orthogonal stock-cutting problem, Operations Research, 52 (2004), 655-671.
doi: 10.1287/opre.1040.0109.
|