Page 32 - 《软件学报》2021年第12期
P. 32

3696                                Journal of Software  软件学报 Vol.32, No.12, December 2021

         References:
          [1]    Lodi A, Silvano M, Michele M. Two-dimensional packing problems: A survey. European Journal of Operational Research, 2002,
             141(2):241−252.
          [2]    Hifi M.  Exact algorithms for  the  guillotine  strip cutting/packing  problem. Computers & Operations Research,  1998,25(11):
             925−940.
          [3]    Martello S, Michele M, Daniele V. An exact approach to the strip-packing problem. INFORMS Journal on Computing, 2003,15(3):
             310−319.
          [4]    Kenmochi M, Takashi I, Koji N, et al. Exact algorithms for the two-dimensional strip packing problem with and without rotations.
             European Journal of Operational Research, 2009,198(1):73−83.
          [5]    Côté JF,  Mauro  DM,  Manuel I.  Combinatorial Benders’  cuts for the strip packing problem.  Operations  Research, 2014,62(3):
             643−661.
          [6]    Baker BS, Jr-Edward-GC, Ronald-LR. Orthogonal packings in two dimensions. SIAM Journal on Computing, 1980,9(4):846−855.
          [7]    Chazelle B. The bottom-left bin-packing heuristic: An efficient implementation. IEEE Trans. on Computers, 1983,(8):697−707.
          [8]    Huang WQ, Liu JF. A deterministic heuristic algorithm based on euclidian distance for solving the rectangles packing. Chinese
             Journal of Computers, 2006,29(5):734−739 (in Chinese with English abstract).
          [9]    Burke EK, Graham K, Glenn W. A  new  placement  heuristic  for the  orthogonal stock-cutting problem.  Operations  Research,
             2004,52(4):655−671.
         [10]    Leung SCH, Zhang DF, Zhou CL, et al. A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack
             packing problem. Computers & Operations Research, 2012,39(1):64−73.
         [11]    Jakobs S. On genetic algorithms for the packing of polygons. European Journal of Operational Research, 1996,88(1):165−181.
         [12]    Hopper E, Turton BCH. An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem. European
             Journal of Operational Research, 2001,128(1):34−57.
         [13]    Bortfeldt A. A genetic  algorithm  for the two-dimensional strip packing problem  with  rectangular pieces.  European Journal of
             Operational Research, 2006,172(3):814−837.
         [14]    Liu DQ, Teng HF. An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles. European Journal of
             Operational Research, 1999,112(2):413−420.
         [15]    He K, Ji PL, Li CM. Heuristics for solving the 2D rectangle packing area minimization problem basing on a dynamic reduction
             method. Ruan Jian Xue Bao/Journal of Software, 2013,24(9):2078−2088 (in Chinese with English abstract). http://www.jos.org.cn/
             1000-9825/4404.htm [doi: 10.3724/SP.J.1001.2013.04404]
         [16]    Wei LJ, Oon WC, Zhu WB, et al. A skyline heuristic for the 2D rectangular packing and strip packing problems. European Journal
             of Operational Research, 2011,215(2):337−346.
         [17]    Alvarez-Valdés R, Francisco P, José-Manuel T. Reactive GRASP for the strip-packing problem. Computers & Operations Research,
             2008,35(4):1065−1083.
         [18]    Zhang DF, Wei LJ, Leung SCH, et al. A binary search heuristic algorithm based on randomized local search for the rectangular
             strip-packing problem. INFORMS Journal on Computing, 2013,25(2):332−345.
         [19]    Leung  SCH, Zhang DF, Sim KM. A  two-stage  intelligent search algorithm  for the  two-dimensional  strip packing  problem.
             European Journal of Operational Research, 2011,215(1):57−69.
         [20]    Yang SY, Han SH, Ye WG. A simple randomized algorithm for two-dimensional strip packing. Computers & Operations Research,
             2013,40(1):1−8.
         [21]    Chen Z, Chen JL. An effective corner increment-based algorithm for the two-dimensional strip packing problem. IEEE Access,
             2018,6:72906−72924.
         [22]    Chen MF, Li K, Zhang DF,  et  al.  Hierarchical search-embedded hybrid heuristic  algorithm for  two-dimensional strip  packing
             problem. IEEE Access, 2019,7,179086−179103.
         [23]    Hopfield JJ,  David-W  T. “Neural”  computation of  decisions  in optimization problems. Biological  Cybernetics, 1985,52(3):
             141−152.
         [24]    Vinyals  O, Meire F, Navdeep J. Pointer networks. In: Advances in  Neural Information Processing Systems (NIPS). 2015.
             2692−2700.
         [25]    Mnih V, Nicolas H, Alex G. Recurrent models of visual attention. arXiv:1406. 6247 2014. 2204−2212.
         [26]    Bello I, Hieu P, Quoc-V L, et al. Neural combinatorial optimization with reinforcement learning. arXiv preprint arXiv: 1611. 09940,
             2016.
   27   28   29   30   31   32   33   34   35   36   37