[1] DYCKHOFF H. A typology of cutting and packing problems [J]. European Journal of Operational Research, 1990, 44(2): 145-159. [2] LÓPEZ-CAMACHO E, OCHOA G, TERASHIMA-MARÍN H, et al. An effective heuristic for the two-dimensional irregular bin packing problem [J]. Annals of Operations Research, 2013, 206(1): 241-264. [3] BAKER B S, COFFMAN E G, RIVEST R L. Orthogonal packings in two dimensions [J]. SIAM Journal on Computing, 1980, 9(4): 846-855. [4] ALLEN S D, BURKE E K, KENDALL G. A hybrid placement strategy for the three-dimensional strip packing problem [J]. European Journal of Operational Research, 2011, 209(3): 219-227. [5] LIU D Q, TENG H F. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles [J]. European Journal of Operational Research, 1999, 112(2): 413-420. [6] HOPPER E, TURTON B C H. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem [J]. European Journal of Operational Research, 2001, 128(1): 34-57. [7] UDAY A, GOODMAN E D, DEBNATH A A. Nesting of irregular shapes using feature matching and parallel genetic algorithms [C]// GECCO 2011: Proceedings of the 12th Annual Conference Companion on Genetic and Evolutionary Computation. New York: ACM, 2001: 429-434. [8] ALBANO A, SAPUPPO G. Optimal allocation of two-dimensional irregular shapes using heuristic search methods [J]. IEEE Transactions on Systems, Man and Cybernetics, 1980, 10(5): 242-248. [9] DOWSLAND K A, VAID S, DOWSLAND W B. An algorithm for polygon placement using a bottom-left strategy [J]. European Journal of Operational Research, 2002, 141(2): 371-381. [10] 刘胡瑶.基于临界多边形的二维排样算法研究[D].上海:上海交通大学,2007:65-81.(LIU H Y, Research of two dimensional nesting algorithm based on no fit polygon [D]. Shanghai: Shanghai Jiao Tong University, 2007:65-81.) [11] LAMBERT M, MARIAM T, SUSAN F. Weiler—Atherton Clipping Algorithm [M]. Beau Bassin: Betascript Publishing, 2010:35-61. [12] OLIVEIRA J F, GOMES A M, FERREIRA J S. TOPOS-a new constructive algorithm for nesting problems [J]. OR-Spektrum, 2000, 22(2): 263-284. [13] ESICUP. EURO Special Interest Group on Cutting and Packing [EB/OL].[2015-12-24]. http://paginas.fe.up.pt/~esicup/tiki-index.php. [14] 刘虓.基于HAPE的二维不规则零件排样算法及其性能研究[D].广州:华南理工大学,2011:52-63.(LIU X. Two-dimensional irregular packing algorithm based on HAPE and its performance study [D]. Guangzhou: South China University of Technology, 2011: 52-63.) [15] 孙艳丰.基于遗传算法和禁忌搜索算法的混合策略及其应用[J].北京工业大学学报,2006,32(3):258-262.(SUN Y F, A hybrid strategy based on genetic algorithm and tabu search[J],Journal of Beijing University of Technology , 2006, 32(3): 258-262.) |